S. Koenig and M. Likhachev. Adaptive A* [Short Paper]. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 1311-1312, 2005.

Abstract: Agents often have to perform repeated on-line searches as they gain additional knowledge about their environment. We describe an incremental version of A*, called Adaptive A*, that solves series of similar search problems faster than running A* repeatedly from scratch because it updates its heuristics between search episodes. It is simpler than other incremental versions of A* and thus likely easier to extend and adapt to new applications. Comment: Robert Holte has recently pointed out to us that his Hierarchical A* (R. Holte, T. Mkadmi, R. Zimmer, A. MacDonald. Speeding up Problem Solving by Abstraction: A Graph Oriented Approach. Artificial Intelligence, 85(1-2), although it is not an incremental heuristic search method, updates the heuristics in a way similar to Adaptive A*. You might want to check out his search method as well.

Download the paper in pdf.

Download the paper in gzipped postscript (large download time).

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.