Recent Advances in Path Planning

Speaker:  Sven Koenig – Los Angeles, CA, United States
Topic(s):  Artificial Intelligence, Machine Learning, Computer Vision, Natural language processing

Abstract

Path planning is an important technology for a large number of applications, and most computer scientists are familiar with Dijkstra's algorithm. In this talk, I discuss recent advances in path planning in the context of both 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) and 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).

About this Lecture

Number of Slides:  60
Duration:  50 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.