Search space reduction using swamp hierarchies

Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner

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

10 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages155-156
Number of pages2
StatePublished - 2010
Externally publishedYes
Event3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States
Duration: 8 Jul 201010 Jul 2010

Publication series

NameProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Conference

Conference3rd International Symposium on Combinatorial Search, SoCS 2010
Country/TerritoryUnited States
CityAtlanta, GA
Period8/07/1010/07/10

Fingerprint

Dive into the research topics of 'Search space reduction using swamp hierarchies'. Together they form a unique fingerprint.

Cite this