An LP-based heuristic for optimal planning

Authors:
Menkes Van Den Briel;J. Benton;Subbarao Kambhampati;Thomas Vossen
Affiliations:
Arizona State University, Department of Industrial Engineering, Tempe, AZ;Department of Computer Science and Engineering, Tempe, AZ;Department of Computer Science and Engineering, Tempe, AZ;University of Colorado, Leeds School of Business, Boulder, CO
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 14
Cited 6

The computational complexity of propositional STRIPS planning

Artificial Intelligence
Using regression-match graphs to control search in planning

Artificial Intelligence
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Tractable plan existence does not imply tractable plan generation

Annals of Mathematics and Artificial Intelligence
New admissible heuristics for domain-independent planning

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
A reactive planner for a model-based executive

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks

Journal of Artificial Intelligence Research
The fast downward planning system

Journal of Artificial Intelligence Research
On the use of integer programming models in AI planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Fast planning with iterative macros

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Fast planning through planning graph analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A linear programming heuristic for optimal planning

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A robust and fast action selection mechanism for planning

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Fast planning by search in domain transition graph

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Loosely coupled formulations for automated planning: an integer programming perspective

Journal of Artificial Intelligence Research
Optimal admissible composition of abstraction heuristics

Artificial Intelligence
A weighted CSP approach to cost-optimal planning

AI Communications
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning

Journal of Artificial Intelligence Research
An admissible heuristic for SAS+ planning obtained from the state equation

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.