Plan Relaxation via Action Debinding and Deordering

Authors

  • Max Waters RMIT University
  • Bernhard Nebel University of Freiburg
  • Lin Padgham RMIT University
  • Sebastian Sardina RMIT University

DOI:

https://doi.org/10.1609/icaps.v28i1.13901

Keywords:

planning and scheduling, partial-order planning

Abstract

While seminal work has studied the problem of relaxing the ordering of a plan’s actions, less attention has been given to the problem of relaxing and modifying a plan’s variable bindings. This paper studies the problem of relaxing a plan into a partial plan which specifies which operators must be executed, but need not completely specify their order or variable bindings. While partial plans can provide an agent with additional flexibility and robustness at execution time, many operations over partial plans are intractable. This paper tackles this problem by proposing and empirically evaluating a fixed-parameter tractable algorithm which searches for tractable, flexible partial plans.

Downloads

Published

2018-06-15

How to Cite

Waters, M., Nebel, B., Padgham, L., & Sardina, S. (2018). Plan Relaxation via Action Debinding and Deordering. Proceedings of the International Conference on Automated Planning and Scheduling, 28(1), 278-287. https://doi.org/10.1609/icaps.v28i1.13901