Using swamps to improve optimal pathfinding

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

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.

Original languageAmerican English
Title of host publication8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1318-1319
Number of pages2
ISBN (Print)9781615673346
StatePublished - 2009
Event8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009 - Budapest, Hungary
Duration: 10 May 200915 May 2009

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
Country/TerritoryHungary
CityBudapest
Period10/05/0915/05/09

Keywords

  • Pathfinding
  • Pruning
  • Search

Fingerprint

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

Cite this