TY - GEN
T1 - Search space reduction using swamp hierarchies
AU - Pochter, Nir
AU - Zohar, Aviv
AU - Rosenschein, Jeffrey S.
AU - Felner, Ariel
PY - 2010
Y1 - 2010
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=84893388881&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84893388881
SN - 9781577354819
T3 - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
SP - 155
EP - 156
BT - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
T2 - 3rd International Symposium on Combinatorial Search, SoCS 2010
Y2 - 8 July 2010 through 10 July 2010
ER -