Temporal Planning as Refinement-Based Model Checking


  • Alexander Heinz University of Freiburg
  • Martin Wehrle University of Basel
  • Sergiy Bogomolov Australian National University
  • Daniele Magazzeni King’s College London
  • Marius Greitschus University of Freiburg
  • Andreas Podelski University of Freiburg


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.




How to Cite

Heinz, A., Wehrle, M., Bogomolov, S., Magazzeni, D., Greitschus, M., & Podelski, A. (2019). Temporal Planning as Refinement-Based Model Checking. Proceedings of the International Conference on Automated Planning and Scheduling, 29(1), 195-199. Retrieved from https://ojs.aaai.org/index.php/ICAPS/article/view/3476