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

 
A stubborn set algorithm for optimal planning
ConferencePaper (Artikel, die in Tagungsbänden erschienen sind)
 
ID 1435184
Author(s) Alkhazraji, Yusra; Wehrle, Martin; Mattmueller, Robert; Helmert, Malte
Author(s) at UniBasel Helmert, Malte
Wehrle, Martin
Year 2012
Title A stubborn set algorithm for optimal planning
Editor(s) De Raedt, Luc; Bessière, Christian; Dubois, Didier; Doherty, Patrick; Frasconi, Paolo; Heintz, Fredrik; Lucas, Peter J. F.
Book title (Conference Proceedings) Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012)
Volume 242
Place of Conference Montpellier, France
Year of Conference 2012
Publisher IOS Press
Place of Publication [s.l.]
Pages S. 891-892
ISSN/ISBN 978-1-61499-097-0
Abstract We adapt a partial order reduction technique based on stubborn sets, originally proposed for detecting dead ends in Petri Nets, to the setting of optimal planning. We demonstrate that stubborn sets can provide significant state space reductions on standard planning benchmarks, outperforming the expansion core method.
URL http://ai.cs.unibas.ch/papers/alkhazraji-et-al-ecai2012.pdf
edoc-URL http://edoc.unibas.ch/dok/A6043815
Full Text on edoc No
Digital Object Identifier DOI 10.3233/978-1-61499-098-7-891
ISI-Number WOS:000349006300151
 
   

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