Single-Robot and Multi-Robot Path Planning

Cray Distinguished Speaker Series
October 31, 2016 - 11:15am to 12:15pm
University of Southern California
Keller 3-125
Stephen J. Guy
ABSTRACT: Path planning is an important technology for a large number of applications.  In this talk, I discuss recent advances in path planning in the context of game programming and robotics, building on the heuristic search algorithm A*. Examples include incremental heuristic search (that is, heuristic search methods that reuse information from previous searches to search faster than repeated A* searches), any-angle search (that is, heuristic search methods that propagate information on graphs but do not restrict the resulting paths to the edges of the graph) and multi-agent path planning (that is, heuristic search methods that find collision-free paths for robot teams).

BIO: Sven Koenig is a professor in computer science at the University of Southern California. Most of his research centers around techniques for decision making (planning and learning) that enable single situated agents (such as robots or decision-support systems) and teams of agents to act intelligently in their environments and exhibit goal-directed behavior in real-time, even if they have only incomplete knowledge of their environment, imperfect abilities to manipulate it, limited or noisy perception or insufficient reasoning speed. Additional information about Sven can be found on his webpages: