Modelling Mixed Discrete-Continuous Domains for Planning
arXiv:1110.2200 · doi:10.1613/jair.2044
Abstract
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl+, showing that the language makes convenient the modelling of complex time-dependent effects. We provide a formal semantics for pddl+ by mapping planning instances into constructs of hybrid automata. Using the syntax of HAs as our semantic model we construct a semantic mapping to labelled transition systems to complete the formal interpretation of pddl+ planning instances. An advantage of building a mapping from pddl+ to HA theory is that it forms a bridge between the Planning and Real Time Systems research communities. One consequence is that we can expect to make use of some of the theoretical properties of HAs. For example, for a restricted class of HAs the Reachability problem (which is equivalent to Plan Existence) is decidable. pddl+ provides an alternative to the continuous durative action model of pddl2.1, adding a more flexible and robust model of time-dependent behaviour.
References in corpus (5)
Cited by in corpus (34)
- Modelling Mixed Discrete-Continuous Domains for Planning
- COLIN: Planning with Continuous Linear Numeric Change
- Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk
- A Survey of Optimization-based Task and Motion Planning: From Classical To Learning Approaches
- Adaptive Process Management in Highly Dynamic and Pervasive Scenarios
- Plan-based Policies for Efficient Multiple Battery Load Management
- MPTP: Motion-Planning-aware Task Planning for Navigation in Belief Space
- Deliberative Acting, Online Planning and Learning with Hierarchical Operational Models
- Behavior and path planning for the coalition of cognitive robots in smart relocation tasks
- A Constraint-based Encoding for Domain-Independent Temporal Planning
- STRIPS Planning in Infinite Domains
- Resource-Optimal Planning For An Autonomous Planetary Vehicle
- PDDL+ Planning via Constraint Answer Set Programming
- Timeline-based planning: Expressiveness and Complexity
- A Conflict-driven Interface between Symbolic Planning and Nonlinear Constraint Solving
- A Domain-Independent Agent Architecture for Adaptive Operation in Evolving Open Worlds
- Software Architecture for Next-Generation AI Planning Systems
- Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming
- Reformulation Techniques for Automated Planning: A Systematic Review
- On the Relationship Between KR Approaches for Explainable Planning
- Gradient-Based Mixed Planning with Symbolic and Numeric Action Parameters
- Task-assisted Motion Planning in Partially Observable Domains
- Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains
- Playing Angry Birds with a Domain-Independent PDDL+ Planner
- Representing Hybrid Automata by Action Language Modulo Theories
- Efficient Temporal Piecewise-Linear Numeric Planning with Lazy Consistency Checking
- Reasoning about Discrete and Continuous Noisy Sensors and Effectors in Dynamical Systems
- CASP Solutions for Planning in Hybrid Domains
- Domain-Independent Dynamic Programming
- An ASP Framework for Efficient Urban Traffic Optimization
- Formalisation of Action with Durations in Answer Set Programming
- Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems
- Collaborative Robotic Manipulation: A Use Case of Articulated Objects in Three-dimensions with Gravity
- Optimal Mixed Discrete-Continuous Planning for Linear Hybrid Systems