Logo der Universität Basel

Research Database / FORSCHUNGSDATENBANK 
PRINTDOC
 
Publication 4624397 | Verified
 

Data Entry: Please note that the research database will be replaced by UNIverse by the end of October 2023. Please enter your data into the system https://universe-intern.unibas.ch. Thanks

Login for users with Unibas email account...

Login for registered users without Unibas email account...

 
Subset-Saturated Transition Cost Partitioning
ConferencePaper (Artikel, die in Tagungsbänden erschienen sind)
 
ID 4624397
Author(s) Drexler, Dominik; Seipp, Jendrik; Speck, David
Author(s) at UniBasel Seipp, Jendrik
Year 2021
Title Subset-Saturated Transition Cost Partitioning
Book title (Conference Proceedings) Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021)
Volume 31
Place of Conference Online
Publisher AAAI Press
Pages 131-139
ISSN/ISBN 2334-0835 ; 2334-0843 ; 978-1-57735-867-1
Abstract Cost partitioning admissibly combines the information from multiple heuristics for optimal state-space search. One of the strongest cost partitioning algorithms is saturated cost partitioning. It considers the heuristics in sequence and assigns to each heuristic the minimal fraction of the remaining costs that are needed for preserving all heuristic estimates. Saturated cost partitioning has recently been generalized in two directions: first, by allowing to use different costs for the transitions induced by the same operator, and second, by preserving the heuristic estimates for only a subset of states. In this work, we unify these two generalizations and show that the resulting subset-saturated transition cost partitioning algorithm usually yields stronger heuristics than the two generalizations by themselves.
edoc-URL https://edoc.unibas.ch/84301/
Full Text on edoc Available
 
   

MCSS v5.8 PRO. 0.369 sec, queries - 0.000 sec ©Universität Basel  |  Impressum   |    
02/05/2024