TY - GEN
T1 - Using swamps to improve optimal pathfinding
AU - Pochter, Nir
AU - Zohar, Aviv
AU - Rosenschein, Jeffrey S.
PY - 2009
Y1 - 2009
N2 - We address the problem of quickly finding shortest paths in known graphs. We propose a method that relies on identifying areas that tend to be searched needlessly (areas we call swamps), and exploits this knowledge to improve search. The method requires relatively little memory, and reduces search cost drastically, while still finding optimal paths Our method is independent of the heuristics used in the search, and of the search algorithm. We present experimental results that support our claims, and provide an anytime algorithm for the pre-processing stage that identifies swamps.
AB - We address the problem of quickly finding shortest paths in known graphs. We propose a method that relies on identifying areas that tend to be searched needlessly (areas we call swamps), and exploits this knowledge to improve search. The method requires relatively little memory, and reduces search cost drastically, while still finding optimal paths Our method is independent of the heuristics used in the search, and of the search algorithm. We present experimental results that support our claims, and provide an anytime algorithm for the pre-processing stage that identifies swamps.
KW - Pathfinding
KW - Pruning
KW - Search
UR - http://www.scopus.com/inward/record.url?scp=84899855835&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84899855835
SN - 9781615673346
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1318
EP - 1319
BT - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
Y2 - 10 May 2009 through 15 May 2009
ER -