Portal-based true-distance heuristics for path finding

Meir Goldenberg; Ariel Felner; Nathan Sturtevant; Jonathan Schaeffer

Portal-based true-distance heuristics for path finding

Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 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 language	English
Title of host publication	Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010
Pages	39-45
Number of pages	7
State	Published - 2010
Externally published	Yes
Event	3rd International Symposium on Combinatorial Search, SoCS 2010 - Atlanta, GA, United States Duration: 8 Jul 2010 → 10 Jul 2010

Publication series

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

Conference

Conference	3rd International Symposium on Combinatorial Search, SoCS 2010
Country/Territory	United States
City	Atlanta, GA
Period	8/07/10 → 10/07/10

Cite this

@inproceedings{d88c834ed757423997ce7c595c5fa725,

title = "Portal-based true-distance heuristics for path finding",

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.",

author = "Meir Goldenberg and Ariel Felner and Nathan Sturtevant and Jonathan Schaeffer",

year = "2010",

language = "אנגלית",

isbn = "9781577354819",

series = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",

pages = "39--45",

booktitle = "Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010",

note = "3rd International Symposium on Combinatorial Search, SoCS 2010 ; Conference date: 08-07-2010 Through 10-07-2010",

}

Goldenberg, M, Felner, A, Sturtevant, N & Schaeffer, J 2010, Portal-based true-distance heuristics for path finding. in Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010. Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010, pp. 39-45, 3rd International Symposium on Combinatorial Search, SoCS 2010, Atlanta, GA, United States, 8/07/10.

Portal-based true-distance heuristics for path finding. / Goldenberg, Meir; Felner, Ariel; Sturtevant, Nathan et al.
Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010. 2010. p. 39-45 (Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Portal-based true-distance heuristics for path finding

AU - Goldenberg, Meir

AU - Felner, Ariel

AU - Sturtevant, Nathan

AU - Schaeffer, Jonathan

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84860485716&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84860485716

SN - 9781577354819

T3 - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

SP - 39

EP - 45

BT - Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

T2 - 3rd International Symposium on Combinatorial Search, SoCS 2010

Y2 - 8 July 2010 through 10 July 2010

ER -

Portal-based true-distance heuristics for path finding

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this