Memory-Efficient Symbolic Heuristic Search

Rune Møller Jensen, Eric A. Hansen, Simon Richards, Rong Zhou

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

Abstrakt

A promising approach to solving large state-space search problems is to integrate heuristic search with symbolic search. Recent work shows that a symbolic A* search algorithm that uses binary decision diagrams to compactly represent sets of states outperforms traditional A* in many domains. Since the memory requirements of A* limit its scalability, we show how to integrate symbolic search with a memory-efficient strategy for heuristic search. We analyze the resulting search algorithm, consider the factors that affect its behavior, and evaluate its performance in solving benchmark problems that include STRIPS planning problems.
OriginalsprogEngelsk
TitelProceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS-06)
Antal sider10
ForlagAAAI Press
Publikationsdato2006
Sider304-313
ISBN (Trykt)9781577352709
StatusUdgivet - 2006

Fingeraftryk

Dyk ned i forskningsemnerne om 'Memory-Efficient Symbolic Heuristic Search'. Sammen danner de et unikt fingeraftryk.

Citationsformater