First Solutions to PDDL+ Planning Problems
نویسنده
چکیده
In this paper we present the design and algorithmic details of a directed search planner to solve benchmark planning problems speci ed in PDDL+ syntax. The planner copes with durative actions, grounds and groups predicates and instantiates functions. The operators possibly span an in nite state space which is tackled by guided exploration. The heuristic estimates are inferred by plan relaxation, through pattern databases, or by state-to-goal di erences of numerical values and are incorporated in scalable heuristic search planning algorithms.
منابع مشابه
An Empirical Comparison of PDDL-based and ASP-based Task Planners
General purpose planners enable AI systems to solve many different types of planning problems. However, many different planners exist, each with different strengths and weaknesses, and there are no general rules for which planner would be best to apply to a given problem. In this paper, we empirically compare the performance of state-of-the-art planners that use either the Planning Domain Descr...
متن کاملCASP solutions for planning in hybrid domains
CASP is an extension of ASP that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solv...
متن کاملPDDL+ Planning via Constraint Answer Set Programming
PDDL+ is an extension of PDDL that enables modelling planning domains with mixed discrete-continuous dynamics. In this paper we present a new approach to PDDL+ planning based on Constraint Answer Set Programming (CASP), i.e. ASP rules plus numerical constraints. To the best of our knowledge, ours is the first attempt to link PDDL+ planning and logic programming. We provide an encoding of PDDL+ ...
متن کاملSolving Planning Problems Using Real-Time Model Checking (Translating PDDL3 into Timed Automata)
We present a translation for the variant PDDL 3 of PDDL (Planning Domain Definition Language) into Timed Automata. The advantage of having such a translation is the availability of tool support by modelcheckers. We present a case study in which we apply a version of UPPAAL that has been extended for the search of cost-optimal solutions.
متن کاملA PDDL Representation for Contradance Composition
Classical planning representations such as PDDL are primarily designed for goal-oriented problem solving, but some tasks such as creative composition lack a well defined goal. Structured performing arts, despite lacking a specific goal for their composition tasks, can be sufficiently expressed as goal-oriented problems for their performance tasks. Using contradance as an example performing art,...
متن کامل