Temporal Planning as Refinement-Based Model Checking

Heinz, Alexander and Wehrle, Martin and Bogomolov, Sergiy and Magazzeni, Daniele and Greitschus, Marius and Podelski, Andreas. (2019) Temporal Planning as Refinement-Based Model Checking. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling. pp. 195-199.

Full text not available from this repository.

Official URL: https://edoc.unibas.ch/75012/

Downloads: Statistics Overview


Planning as model checking based on source-to-source compilations has found increasing attention. Previously proposed approaches for temporal and hybrid planning are based on static translations, in the sense that the resulting model checking problems are uniquely defined by the given input planning problems. As a drawback, the translations can become too large to be efficiently solvable. In this paper, we address propositional temporal planning, lifting static translations to a more flexible framework. Our framework is based on a refinement cycle that allows for adaptively computing suitable translations of increasing size. Our experiments on temporal IPC domains show that the resulting translations to timed automata often become succinct, resulting in promising performance when applied with the directed model checker MCTA.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI press
Note:Publication type according to Uni Basel Research Database: Conference paper
Last Modified:10 Mar 2020 11:21
Deposited On:10 Mar 2020 11:21

Repository Staff Only: item control page