Adaptive A

Authors:
Sven Koenig;Maxim Likhachev
Affiliations:
University of Southern California, Los Angeles, CA;Carnegie Mellon University, Pittsburgh, PA
Venue:
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Year:
2005

Citing 2
Cited 4

D*lite

Eighteenth national conference on Artificial intelligence
Performance bounds for planning in unknown terrain

Artificial Intelligence - special issue on planning with uncertainty and incomplete information

Real-time adaptive A*

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Speeding up moving-target search

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Probabilistic planning with clear preferences on missing information

Artificial Intelligence
Multi-target adaptive A*

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.