Modelling mixed discrete-continuous domains for planning

M. Fox, D. Long

Research output: Contribution to journalArticle

108 Citations (Scopus)

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.
LanguageEnglish
Pages235-297
Number of pages62
JournalJournal of Artificial Intelligence Research
Volume27
Publication statusPublished - Oct 2006

Fingerprint

Planning
Semantics
Real time systems

Keywords

  • planning domain
  • pddl+
  • programming
  • hybrid automata
  • artificial intelligence

Cite this

@article{aae0479164e14b3f951f3786a7c14a82,
title = "Modelling mixed discrete-continuous domains for planning",
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.",
keywords = "planning domain, pddl+, programming, hybrid automata, artificial intelligence",
author = "M. Fox and D. Long",
year = "2006",
month = "10",
language = "English",
volume = "27",
pages = "235--297",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",

}

Modelling mixed discrete-continuous domains for planning. / Fox, M.; Long, D.

In: Journal of Artificial Intelligence Research, Vol. 27, 10.2006, p. 235-297.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Modelling mixed discrete-continuous domains for planning

AU - Fox, M.

AU - Long, D.

PY - 2006/10

Y1 - 2006/10

N2 - 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.

AB - 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.

KW - planning domain

KW - pddl+

KW - programming

KW - hybrid automata

KW - artificial intelligence

UR - http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume27/fox06a-html/Main.html

UR - http://www.jair.org/media/2044/live-2044-2913-jair.pdf

M3 - Article

VL - 27

SP - 235

EP - 297

JO - Journal of Artificial Intelligence Research

T2 - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -