A Critical Assessment of Benchmark Comparison in Planning

06/09/2011
by   E. Dahlman, et al.
0

Recent trends in planning research have led to empirical comparison becoming commonplace. The field has started to settle into a methodology for such comparisons, which for obvious practical reasons requires running a subset of planners on a subset of problems. In this paper, we characterize the methodology and examine eight implicit assumptions about the problems, planners and metrics used in many of these comparisons. The problem assumptions are: PR1) the performance of a general purpose planner should not be penalized/biased if executed on a sampling of problems and domains, PR2) minor syntactic differences in representation do not affect performance, and PR3) problems should be solvable by STRIPS capable planners unless they require ADL. The planner assumptions are: PL1) the latest version of a planner is the best one to use, PL2) default parameter settings approximate good performance, and PL3) time cut-offs do not unduly bias outcome. The metrics assumptions are: M1) performance degrades similarly for each planner when run on degraded runtime environments (e.g., machine platform) and M2) the number of plan steps distinguishes performance. We find that most of these assumptions are not supported empirically; in particular, that planners are affected differently by these assumptions. We conclude with a call to the community to devote research resources to improving the state of the practice and especially to enhancing the available benchmark problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2011

Task Interaction in an HTN Planner

Hierarchical Task Network (HTN) planning uses task decomposition to plan...
research
01/15/2014

Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width

Conformant planning is the problem of finding a sequence of actions for ...
research
01/23/2014

Replanning in Domains with Partial Information and Sensing Actions

Replanning via determinization is a recent, popular approach for online ...
research
04/23/2018

An Empirical Comparison of PDDL-based and ASP-based Task Planners

General purpose planners enable AI systems to solve many different types...
research
03/12/2023

The Planner Optimization Problem: Formulations and Frameworks

Identifying internal parameters for planning is crucial to maximizing th...
research
03/15/2021

Flexible FOND Planning with Explicit Fairness Assumptions

We consider the problem of reaching a propositional goal condition in fu...
research
06/19/2018

SMarTplan: a Task Planner for Smart Factories

Smart factories are on the verge of becoming the new industrial paradigm...

Please sign up or login with your details

Forgot password? Click here to reset