Tractable Monotone Temporal Planning

Authors

  • Martin Cooper University of Toulouse
  • Frederic Maris University of Toulouse
  • Pierre Regnier University of Toulouse

DOI:

https://doi.org/10.1609/icaps.v22i1.13501

Keywords:

tractable, monotone, temporal, planning

Abstract

This paper describes a polynomially-solvable sub-problem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each sub-goal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of sub-goal fluents allows us to express planning as an instance of STP≠ (Simple Temporal Problem, difference constraints). Our class includes temporally-expressive problems, which we illustrate with an example of chemical process planning.

Downloads

Published

2012-05-14

How to Cite

Cooper, M., Maris, F., & Regnier, P. (2012). Tractable Monotone Temporal Planning. Proceedings of the International Conference on Automated Planning and Scheduling, 22(1), 20-28. https://doi.org/10.1609/icaps.v22i1.13501