Transition Constraints for Parallel Planning

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.

Cite

Text

Ghooshchi et al. "Transition Constraints for Parallel Planning." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9664

Markdown

[Ghooshchi et al. "Transition Constraints for Parallel Planning." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/ghooshchi2015aaai-transition/) doi:10.1609/AAAI.V29I1.9664

BibTeX

@inproceedings{ghooshchi2015aaai-transition,
  title     = {{Transition Constraints for Parallel Planning}},
  author    = {Ghooshchi, Nina Ghanbari and Namazi, Majid and Newton, M. A. Hakim and Sattar, Abdul},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {3268-3274},
  doi       = {10.1609/AAAI.V29I1.9664},
  url       = {https://mlanthology.org/aaai/2015/ghooshchi2015aaai-transition/}
}