Simple optimization techniques for a*-based search

Xiaoxun Sun, William Yeoh, Po-An Chen, Sven Koenig

研究成果: Conference contribution同行評審

8 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
發行者International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
頁面931–936
頁數6
2
ISBN(列印)9781615673346
出版狀態Published - 10 5月 2009
事件8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009 - Budapest, 匈牙利
持續時間: 10 5月 200915 5月 2009

出版系列

名字Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
1
ISSN(列印)1548-8403
ISSN(電子)1558-2914

Conference

Conference8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
國家/地區匈牙利
城市Budapest
期間10/05/0915/05/09

指紋

深入研究「Simple optimization techniques for a*-based search」主題。共同形成了獨特的指紋。

引用此