| Sponsor | Sven Koenig |
| Area | Intelligent Systems |
Problem
Incremental search methods use information from previous searches to speed up the current search. This is important because agents often have to perform several similar searches in a row. For example, the wind direction might change after a planning system for crisis management has found a plan for how to contain a marine oil spill. The planning system then has to solve a planning problem that is very similar to the one that it solved before.
Incremental search has been studied by researchers from different areas of computer science, such as artificial intelligence, robotics, algorithms, and so on. Perform a literature search to identify and compare those incremental search methods that can be used to either find shortest paths or at least make guarantees about the path length. Starting points for a literature search are provided on the following web page:
http://www.cc.gatech.edu/fac/Sven.Koenig/fastreplanning.html