Talk by Sven Koenig; Tuesday August 7

SPEAKER: SVEN KOENIG (http://idm-lab.org/)
Computer Science Department, University of Southern CaliforniaPICTURE: See http://idm-lab.org
TITLE: ADVANCES IN PATH PLANNING
DATE: August 7, TuesdayTIME: 10:30am-11:30am
LOCATION: Newell Simon 1305
FACULTY HOST / APPOINTMENTS: Eugene Fink (e.fink@cs.cmu.edu )


ABSTRACT:
An Overview of two of currentresearch projects on path planning for video games, namely, any-anglepath planning and fast replanning for moving-target search.


Any-Angle Path Planning:
Theta*, a variant of A* that propagates information along grid edges without constraining the paths to grid edges. Theta* is simple, fast and finds short and realistic looking paths.


Fast Replanning for Moving-Target Search:
MT-Adaptive A*, anincremental variant of A* that updates the heuristics between searches. MT-Adaptive A* is faster than isolated A* searches and, in many situations, also D* Lite, astate-of-the-art incremental variant of A*.



Additional information about Sven can be found on his web pages: idm-lab.org.