Symbolic A* search with pattern databases and the merge-and-shrink abstraction

Stefan Edelkamp, Peter Kissmann, Álvaro Torralba

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

16 Citationer (Scopus)

Abstract

The efficiency of heuristic search planning crucially depends on the quality of the search heuristic, while succinct representations of state sets in decision diagrams can save large amounts of memory in the exploration. BDDA* - a symbolic version of A* search - combines the two approaches into one algorithm. This paper compares two of the leading heuristics for sequential-optimal planning: the merge-and-shrink and the pattern databases heuristic, both of which can be compiled into a vector of BDDs and be used in BDDA*. The impact of optimizing the variable ordering is highlighted and experiments on benchmark domains are reported.

OriginalsprogEngelsk
TitelECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration
Antal sider6
ForlagIOS Press
Publikationsdato2012
Sider306-311
ISBN (Trykt)9781614990970
DOI
StatusUdgivet - 2012
Udgivet eksterntJa
Begivenhed20th European Conference on Artificial Intelligence, ECAI 2012 - Montpellier, Frankrig
Varighed: 27 aug. 201231 aug. 2012

Konference

Konference20th European Conference on Artificial Intelligence, ECAI 2012
Land/OmrådeFrankrig
ByMontpellier
Periode27/08/201231/08/2012
NavnFrontiers in Artificial Intelligence and Applications
Vol/bind242
ISSN0922-6389

Fingeraftryk

Dyk ned i forskningsemnerne om 'Symbolic A* search with pattern databases and the merge-and-shrink abstraction'. Sammen danner de et unikt fingeraftryk.

Citationsformater