Transition Constraints for Parallel Planning

Authors

  • Nina Ghooshchi Urmia University
  • Majid Namazi Urmia University
  • M A Hakim Newton Griffith University
  • Abdul Sattar Griffith University

DOI:

https://doi.org/10.1609/aaai.v29i1.9664

Keywords:

Constraint-Based Planning, Planning, Constraints

Abstract

We present a planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs a new constraint model from domain transition graphs (DTG) of a given planning problem. TCPP encodes the constraint model by using table constraints that allow don't cares or wild cards as cell values. TCPP uses Minion the constraint solver to solve the constraint model and returns the parallel plan. Empirical results exhibit the efficiency of our planning system over state-of-the-art constraint-based planners.

AAAI 2015 Proceedings Cover

Downloads

Published

2015-03-04

How to Cite

Ghooshchi, N., Namazi, M., Newton, M. A. H., & Sattar, A. (2015). Transition Constraints for Parallel Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9664

Issue

Vol. 29 No. 1 (2015): Twenty-Ninth AAAI Conference on Artificial Intelligence

Section

Main Track: Planning and Scheduling