• Mathematics, Computer Science
  • Published in J. Artif. Intell. Res. 2016
  • DOI:10.1613/jair.5128

Optimal Partial-Order Plan Relaxation via MaxSAT

@article{Muise2016OptimalPP,
  title={Optimal Partial-Order Plan Relaxation via MaxSAT},
  author={Christian J. Muise and J. Christopher Beck and Sheila A. McIlraith},
  journal={J. Artif. Intell. Res.},
  year={2016},
  volume={57},
  pages={113-149}
}
Partial-order plans (POPs) are attractive because of their least-commitment nature, which provides enhanced plan flexibility at execution time relative to sequential plans. Current research on automated plan generation focuses on producing sequential plans, despite the appeal of POPs. In this paper we examine POP generation by relaxing or modifying the action orderings of a sequential plan to optimize for plan criteria that promote flexibility. Our approach relies on a novel partial weighted… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Characterizing and Computing All Delete-Relaxed Dead-ends

  • Christian J. Muise
  • Computer Science
  • Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 42 REFERENCES

Computational Aspects of Reordering Plans

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

An Introduction to Least Commitment Planning

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Forward-Chaining Partial-Order Planning

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Handbook of satisfiability

VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

ICAPS competition page

  • J. Hoffmann
  • http://ipc.icaps-conference.org/. Accessed: 2016-09-06.
  • 2016
VIEW 1 EXCERPT