In various domains, such as computer games, robotics, and transportation networks, shortest paths may need to be found quickly. Search time can be significantly reduced if it is known which parts of the graph include “swamps”-areas that cannot lie on the only available shortest path, and can thus safely be pruned during search. We introduce an algorithm for detecting hierarchies of swamps, and exploiting them. Experiments support our claims of improved efficiency, showing significant reduction in search time.
|Original language||American English|
|Title of host publication||Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010|
|Number of pages||6|
|State||Published - 15 Jul 2010|
|Event||24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States|
Duration: 11 Jul 2010 → 15 Jul 2010
|Name||Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010|
|Conference||24th AAAI Conference on Artificial Intelligence, AAAI 2010|
|Period||11/07/10 → 15/07/10|
Bibliographical noteFunding Information:
This research was supported in part by Israel Science Foundation grants #898/05 and #305/09.
© 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.