An LP-Based Heuristic for Optimal Planning

  • Menkes van den Briel
  • J. Benton
  • Subbarao Kambhampati
  • Thomas Vossen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4741)

Abstract

One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners is based on relaxing the planning task by ignoring the delete effects of the actions. In several planning domains, however, this relaxation produces rather weak estimates to guide search effectively. We present a relaxation using (integer) linear programming that respects delete effects but ignores action ordering, which in a number of problems provides better distance estimates. Moreover, our approach can be used as an admissible heuristic for optimal planning.

Keywords

Automated planning improving admissible heuristics optimal relaxed planning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Menkes van den Briel
    • 1
  • J. Benton
    • 2
  • Subbarao Kambhampati
    • 2
  • Thomas Vossen
    • 3
  1. 1.Arizona State University, Department of Industrial Engineering 
  2. 2.Department of Computer Science and Engineering, Tempe AZ, 85287USA
  3. 3.University of Colorado, Leeds School of Business, Boulder CO, 80309USA

Personalised recommendations