Portal-based true-distance heuristics for path finding

Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer

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

22 Scopus citations

Abstract

True distance memory-based heuristics (TDHs) were recently introduced as a way to obtain admissible heuristics for explicit state spaces. In this paper, we introduce a new TDH, the portal-based heuristic. The domain is partitioned into regions and portals between regions are identified. True distances between all pairs of portals are stored and used to obtain admissible heuristics throughout the search. We introduce an A*- based algorithm that takes advantage of the special properties of the new heuristic. We study the advantages and limitations of the new heuristic. Our experimental results show large performance improvements over previously-reported TDHs for commonly used classes of maps.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages39-45
Number of pages7
StatePublished - 1 Dec 2010
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

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Portal-based true-distance heuristics for path finding'. Together they form a unique fingerprint.

Cite this