Sciweavers

Share
CP
2007
Springer

An LP-Based Heuristic for Optimal Planning

9 years 2 months ago
An LP-Based Heuristic for Optimal Planning
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. Key words: Automated planning, improving admissible heuristics, optimal relaxed planning
Menkes van den Briel, J. Benton, Subbarao Kambhamp
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CP
Authors Menkes van den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen
Comments (0)
books