An Investigation into the Expressive Power of PDDL2.1

نویسندگان

  • Maria Fox
  • Derek Long
  • Keith Halsey
چکیده

The planning domain language PDDL2.1, used in the 3rd International Planning Competition, has sparked off some controversy in the planning community as researchers consider its expressive power and the ease with which interesting domain models can be constructed in the language. In this paper we show that the expressive power of PDDL2.1 is much greater than is commonly believed. We demonstrate that PDDL2.1 can model many of the domain features often claimed to lie beyond its modelling capability. In so doing we provide a means by which powerful domain features and language constructs can be given a semantics in terms of the canonical basis of PDDL2.1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning with Problems Requiring Temporal Coordination

We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heuristic forward search, using the start-and-end semantics of PDDL2.1 to manage temporal actions. The planning phase is interleaved with a scheduling phase, using a Simple Temporal Network, in order to ensure that tempor...

متن کامل

PDDL+ : Modelling Continuous Time-dependent Effects

The adoption of a common formalism for describing planning domains fosters far greater reuse of research and allows more direct comparison of systems and approaches, and therefore supports faster progress in the field. A common formalism is a compromise between expressive power (in which development is strongly driven by potential applications) and the progress of basic research (which encourag...

متن کامل

Admissible Makespan Estimates for PDDL2.1 Temporal Planning

Though recent renewed interest in “expressive” temporal planning, as exemplified by PDDL2.1, has led to advances, few such planners to date can guarantee optimality, or even bounded suboptimality, w.r.t. plan makespan. As a step towards improving planners’ awareness of the quality of their plans, we describe three ways of obtaining lower bound functions, i.e., admissible heuristics, for plan ma...

متن کامل

An Investigation into the Relationship between Dialog and Narrative Elements of the Holy Quran from a Literary Perspective

After more than 14 centuries, the expressive inimitability of the holy Quran opens new dimensions for thinkers every day. One of these angles is the study of the story and its relation to the element of dialog. The purpose of this article is to look into this issue in the verses of the holy Quran. For this purpose, the methods and techniques of storytelling in the Quran, the characteristics of ...

متن کامل

Temporally Expressive Planning Based on Answer Set Programming with Constraints

Recently, a new language AC(C) was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that temporally expressive planning problems in PDDL2.1 can be translated into AC(C) and solved using AC(C) solvers. Compared with existing approaches, the new approach puts less restrictions on the planning problems and is easy to extend with new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004