An LP-based heuristic for optimal planning

Menkes Van Den Briel; J. Benton; Subbarao Kambhampati; Thomas Vossen

doi:10.1007/978-3-540-74970-7_46

An LP-based heuristic for optimal planning

Menkes Van Den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

39 Scopus citations

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.

Original language	English (US)
Title of host publication	Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings
Publisher	Springer Verlag
Pages	651-665
Number of pages	15
ISBN (Print)	3540749691, 9783540749691
DOIs	https://doi.org/10.1007/978-3-540-74970-7_46
State	Published - 2007
Externally published	Yes
Event	13th International Conference on Principles and Practice of Constraint Programming, CP 2007 - Providence, RI, United States Duration: Sep 23 2007 → Sep 27 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4741 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	13th International Conference on Principles and Practice of Constraint Programming, CP 2007
Country/Territory	United States
City	Providence, RI
Period	9/23/07 → 9/27/07

Keywords

Automated planning
Improving admissible heuristics
Optimal relaxed planning

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-74970-7_46

Cite this

Van Den Briel, M., Benton, J., Kambhampati, S., & Vossen, T. (2007). An LP-based heuristic for optimal planning. In Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings (pp. 651-665). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4741 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_46

An LP-based heuristic for optimal planning. / Van Den Briel, Menkes; Benton, J.; Kambhampati, Subbarao et al.
Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings. Springer Verlag, 2007. p. 651-665 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4741 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Van Den Briel, M, Benton, J, Kambhampati, S & Vossen, T 2007, An LP-based heuristic for optimal planning. in Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4741 LNCS, Springer Verlag, pp. 651-665, 13th International Conference on Principles and Practice of Constraint Programming, CP 2007, Providence, RI, United States, 9/23/07. https://doi.org/10.1007/978-3-540-74970-7_46

Van Den Briel M, Benton J, Kambhampati S, Vossen T. An LP-based heuristic for optimal planning. In Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings. Springer Verlag. 2007. p. 651-665. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74970-7_46

Van Den Briel, Menkes ; Benton, J. ; Kambhampati, Subbarao et al. / An LP-based heuristic for optimal planning. Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings. Springer Verlag, 2007. pp. 651-665 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7a774057841d43c89ac7e4dbcf20b786,

title = "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.",

keywords = "Automated planning, Improving admissible heuristics, Optimal relaxed planning",

author = "{Van Den Briel}, Menkes and J. Benton and Subbarao Kambhampati and Thomas Vossen",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 13th International Conference on Principles and Practice of Constraint Programming, CP 2007 ; Conference date: 23-09-2007 Through 27-09-2007",

year = "2007",

doi = "10.1007/978-3-540-74970-7_46",

language = "English (US)",

isbn = "3540749691",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "651--665",

booktitle = "Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings",

}

TY - GEN

T1 - An LP-based heuristic for optimal planning

AU - Van Den Briel, Menkes

AU - Benton, J.

AU - Kambhampati, Subbarao

AU - Vossen, Thomas

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Automated planning

KW - Improving admissible heuristics

KW - Optimal relaxed planning

UR - http://www.scopus.com/inward/record.url?scp=38149069722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149069722&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74970-7_46

DO - 10.1007/978-3-540-74970-7_46

M3 - Conference contribution

AN - SCOPUS:38149069722

SN - 3540749691

SN - 9783540749691

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 651

EP - 665

BT - Principles and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings

PB - Springer Verlag

T2 - 13th International Conference on Principles and Practice of Constraint Programming, CP 2007

Y2 - 23 September 2007 through 27 September 2007

ER -

An LP-based heuristic for optimal planning

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this