TY - GEN
T1 - Search space reduction using swamp hierarchies
AU - Pochter, Nir
AU - Zohar, Aviv
AU - Rosenschein, Jeffrey S.
AU - Felner, Ariel
PY - 2010/1/1
Y1 - 2010/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77958575633&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:77958575633
SN - 9781577354642
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 155
EP - 160
BT - AAAI-10 / IAAI-10 - Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference
PB - AI Access Foundation
T2 - 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10
Y2 - 11 July 2010 through 15 July 2010
ER -