In recent years, researchers have reformulated STRIPS planning problems as SAT problems or CSPs. In this paper, we discuss the Constraint-Based Interval Planning (CBIP) paradigm, which can represent planning problems incorporating interval time and resources. We describe how to reformulate mutual exclusion constraints for a CBIPbased system, the Extendible Uniform Remote Operations Planner Architecture (EUROPA). We show that reformulations involving dynamic variable domains restrict the algorithms which can be used to solve the resulting DCSP. We present an alternative formulation which does not employ dynamic domains, and describe the relative merits of the different reformulations.
CITATION STYLE
Frank, J., Jonsson, A. K., & Morris, P. (2000). On reformulating planning as dynamic constraint satisfaction (extended abstract). In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1864, pp. 271–280). Springer Verlag. https://doi.org/10.1007/3-540-44914-0_17
Mendeley helps you to discover research relevant for your work.