Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

09/29/2011
by   S. Edelkamp, et al.
0

In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4.

READ FULL TEXT
research
09/26/2011

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks

Between 1998 and 2004, the planning community has seen vast progress in ...
research
10/12/2011

An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events

The treatment of exogenous events in planning is practically important i...
research
06/01/2011

OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains

Recently model checking representation and search techniques were shown ...
research
06/30/2011

Taming Numbers and Durations in the Model Checking Integrated Planning System

The Model Checking Integrated Planning System (MIPS) is a temporal least...
research
09/09/2011

Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators

Despite recent progress in AI planning, many benchmarks remain challengi...
research
07/16/2013

Parameterized Complexity Results for Plan Reuse

Planning is a notoriously difficult computational problem of high worst-...
research
02/04/2014

A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning

Although the use of metric fluents is fundamental to many practical plan...

Please sign up or login with your details

Forgot password? Click here to reset