Computer Science – Artificial Intelligence
Scientific paper
2011-10-10
Journal Of Artificial Intelligence Research, Volume 27, pages 235-297, 2006
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.2044
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.
Fox Marsha
Long Darren D.
No associations
LandOfFree
Modelling Mixed Discrete-Continuous Domains for Planning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modelling Mixed Discrete-Continuous Domains for Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modelling Mixed Discrete-Continuous Domains for Planning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-471042