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

 
Abstractions for Planning with State-Dependent Action Costs
ConferencePaper (Artikel, die in Tagungsbänden erschienen sind)
 
ID 3677046
Author(s) Geißer, Florian; Keller, Thomas; Mattmüller , Robert
Author(s) at UniBasel Keller, Thomas
Year 2016
Title Abstractions for Planning with State-Dependent Action Costs
Book title (Conference Proceedings) Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)
Place of Conference London, UK
Publisher AAAI Press
Pages 140-148
Abstract Extending the classical planning formalism with state-dependent action costs (SDAC) allows an up to exponentially more compact task encoding. Recent work proposed to use edge-valued multi-valued decision diagrams (EVMDDs) to represent cost functions, which allows to automatically detect and exhibit structure in cost functions and to make heuristic estimators accurately reflect SDAC. However, so far only the inadmissible additive heuristic has been considered in this context. In this paper, we define informative admissible abstraction heuristics which enable optimal planning with SDAC. We discuss how abstract cost values can be extracted from EVMDDs that represent concrete cost functions without adjusting them to the selected abstraction. Our theoretical analysis shows that this is efficiently possible for abstractions that are Cartesian or coarser. We adapt the counterexample-guided abstraction refinement approach to derive such abstractions. An empirical evaluation of the resulting heuristic shows that highly accurate values can be computed quickly.
URL https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13028/12671
edoc-URL http://edoc.unibas.ch/45222/
Full Text on edoc Available
 
   

MCSS v5.8 PRO. 0.346 sec, queries - 0.000 sec ©Universität Basel  |  Impressum   |    
29/03/2024