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-ofthe-art constraint-based planners.
Cite
CITATION STYLE
Ghooshchi, N. G., Namazi, M., Newton, M. A. H., & Sattar, A. (2015). Transition constraints for parallel planning. In Proceedings of the National Conference on Artificial Intelligence (Vol. 5, pp. 3268–3274). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9664
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
