Using swamps to improve optimal pathfinding

Nir Pochter*, Aviv Zohar, Jeffrey S. Rosenschein

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review


In a variety of domains, such as computer games and robotics, many shortest paths have to be found quickly in real time. We address the problem of quickly finding shortest paths in large known graphs. We propose a method that relies on identifying areas that tend to be searched needlessly (areas we call swamp-regions), and exploits this knowledge to improve search. The method requires storing only a few bits in memory for each node of the graph, 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 swamp-regions.

Original languageAmerican English
Number of pages8
StatePublished - 2008
Event2008 AAAI Workshop - Chicago, IL, United States
Duration: 13 Jul 200814 Jul 2008


Conference2008 AAAI Workshop
Country/TerritoryUnited States
CityChicago, IL


Dive into the research topics of 'Using swamps to improve optimal pathfinding'. Together they form a unique fingerprint.

Cite this