Encoding Domain Transitions for Constraint-Based Planning
نویسندگان
چکیده
منابع مشابه
Encoding Domain Transitions for Constraint-Based Planning
We describe a constraint-based automated planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs its constraint model from a redefined version of the domain transition graphs (DTG) of a given planning problem. TCPP encodes state transitions in the redefined DTGs by using table constraints with cells containing don’t cares or wild cards. TCPP uses Minion the constraint...
متن کاملSlice Encoding for Constraint-Based Planning
In most of the constraint-based approaches to planning, the problem is unfolded over a given number of steps. Because this unfolded CSP encoding is very time and memory consuming, we propose on top of the CNT framework (Constraint Networks on Timelines) a more efficient slice CSP encoding which allows only a limited number of steps to be considered at each step of the search.
متن کاملA Constraint Model for the Settlers Planning Domain
The Settlers planning domain has proved a challenging problem for planning technology. We present a preliminary model of Settlers in the Essence’ specification language. We generate a constraint model for the CSP solver Minion using the automated modelling tool Tailor. We show this model to be competitive with state-of-the-art planning technology.
متن کاملConstraint-based sensor planning for scene modeling
We describe an automated scene modeling system that consists of two components operating in an interleaved fashion: an incremental modeler that builds solid models from range imagery, and a sensor planner that analyzes the resulting model and computes the next sensor position. This planning component is target-driven and computes sensor positions using model information about the imaged surface...
متن کاملForward Constraint-Based Algorithms for Anytime Planning
This paper presents a generic anytime forward-search constraint-based algorithm for solving planning problems expressed in the CNT framework (Constraint Network on Timelines). It is generic because it allows many kinds of search to be covered, from complete tree search to greedy search. It is anytime because some parameter settings, together with domain-specific knowledge, allow high quality pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2017
ISSN: 1076-9757
DOI: 10.1613/jair.5378