@inproceedings{bb4a8068abed4b398eb3e222fc7d674f,
title = "Simple optimization techniques for a*-based search",
abstract = "In this paper, wo present two simple optimizations that can reduce the number of priority queue operations for A* and its extensions. Basically, when the optimized search algorithms expand a state, they check whether they will expand a successor of the state next. If so, they do not first insert it into the priority queue and then immediately remove it again. These changes might appear to be trivial but are well suited for Generalized Adaptive A*, an extension of A*. Our experimental results indeed show that they speed up Generalized Adaptive A* by up to 30 percent if its priority queue is implemented as a binary heap.",
keywords = "A* search, Incremental heuristic search, Path planning",
author = "Xiaoxun Sun and William Yeoh and Po-An Chen and Sven Koenig",
year = "2009",
month = jan,
day = "1",
language = "English",
isbn = "9781615673346",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "696--701",
booktitle = "8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009",
note = "null ; Conference date: 10-05-2009 Through 15-05-2009",
}