Interleaving search and heuristic improvement

Santiago Franco, Álvaro Torralba

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

2 Citationer (Scopus)

Abstract

Abstraction heuristics are a leading approach for deriving admissible estimates in cost-optimal planning. However, a drawback with respect to other families of heuristics is that they require a preprocessing phase for choosing the abstraction, computing the abstract distances, and/or suitable cost-partitionings. Typically, this is performed in advance by a fixed amount of time, even though some instances could be solved much faster with little or no preprocessing. We interleave the computation of abstraction heuristics with search, avoiding a long precomputation phase and allowing information from the search to be used for guiding the abstraction selection. To evaluate our ideas, we implement them on a planner that uses a single symbolic PDB. Our results show that delaying the preprocessing is not harmful in general even when an important amount of preprocessing is required to obtain good performance.

OriginalsprogEngelsk
TitelProceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
RedaktørerPavel Surynek, William Yeoh
Antal sider5
ForlagAAAI Press
Publikationsdato2019
Sider130-134
ISBN (Elektronisk)9781577358084
StatusUdgivet - 2019
Udgivet eksterntJa
Begivenhed12th International Symposium on Combinatorial Search, SoCS 2019 - Napa, USA
Varighed: 16 jul. 201917 jul. 2019

Konference

Konference12th International Symposium on Combinatorial Search, SoCS 2019
Land/OmrådeUSA
ByNapa
Periode16/07/201917/07/2019
NavnProceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019

Fingeraftryk

Dyk ned i forskningsemnerne om 'Interleaving search and heuristic improvement'. Sammen danner de et unikt fingeraftryk.

Citationsformater