Measuring the Performance of Automated Planning Systems

Abstract

In this paper, we describe existing performance measures for automated planning algorithms, and discuss the limitations and biases inherent in those performance measures. We point out the importance of developing a performance measure that explicitly the restrictive assumptions on which a planning algorithm depends, and we propose a composite performance measure based on three factors: (1) the scope of the planning algorithm: which set of restrictive assumption are needed and which can be lifted, (2) the control knowledge and tuning required for each planning domain, (3) the size of the problems that can be solve in a reasonable amount of time in each area of its scope (i.e., for each combination of relaxed assumptions it can handle).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2004
Accession Number
ADA515720

Entities

People

  • Dana S. Nau
  • Malik Ghallab

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Ground and Sea Platforms
  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Automata
  • Competition
  • Computer Science
  • Computers
  • Machining
  • Manufacturing
  • Measurement
  • Observation
  • Sequences
  • Sheet Metal
  • Spacecraft
  • Standards
  • Trajectories
  • Transitions
  • Universities

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Robotics and Automation.
  • Systems Analysis and Design