A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems

J. Benton; Menkes Van Den Briel; Subbarao Kambhampati

A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems

J. Benton, Menkes Van Den Briel, Subbarao Kambhampati

Computer Science and Engineering

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

23 Scopus citations

Abstract

The availability of informed (but inadmissible) planning heuristics has enabled the development of highly scalable planning systems. Due to this success, a body of work has grown around modifying these heuristics to handle extensions to classical planning. Most recently, there has been an interest in addressing partial satisfaction planning problems, but existing heuristics fail to address the complex interactions that occur in these problems between action and goal selection. In this paper we provide a unique admissible heuristic based on linear programming that we use to solve a relaxed version of the partial satisfaction planning problem. We incorporate this heuristic in conjunction with a lookahead strategy in a branch and bound algorithm to solve a class of over-subscribed planning problems.

Original language	English (US)
Title of host publication	ICAPS 2007, 17th International Conference on Automated Planning and Scheduling
Pages	34-41
Number of pages	8
State	Published - Dec 1 2007
Event	ICAPS 2007, 17th International Conference on Automated Planning and Scheduling - Providence, RI, United States Duration: Sep 22 2007 → Sep 26 2007

Publication series

Name	ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Other

Other	ICAPS 2007, 17th International Conference on Automated Planning and Scheduling
Country/Territory	United States
City	Providence, RI
Period	9/22/07 → 9/26/07

ASJC Scopus subject areas

Strategy and Management
Computer Science Applications
Mathematics(all)

Cite this

A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. / Benton, J.; Van Den Briel, Menkes; Kambhampati, Subbarao.

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling. 2007. p. 34-41 (ICAPS 2007, 17th International Conference on Automated Planning and Scheduling).

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

Benton, J, Van Den Briel, M & Kambhampati, S 2007, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems. in ICAPS 2007, 17th International Conference on Automated Planning and Scheduling. ICAPS 2007, 17th International Conference on Automated Planning and Scheduling, pp. 34-41, ICAPS 2007, 17th International Conference on Automated Planning and Scheduling, Providence, RI, United States, 9/22/07.

@inproceedings{cbb52ed3eb354ae7a34556d9cf01414b,

title = "A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems",

abstract = "The availability of informed (but inadmissible) planning heuristics has enabled the development of highly scalable planning systems. Due to this success, a body of work has grown around modifying these heuristics to handle extensions to classical planning. Most recently, there has been an interest in addressing partial satisfaction planning problems, but existing heuristics fail to address the complex interactions that occur in these problems between action and goal selection. In this paper we provide a unique admissible heuristic based on linear programming that we use to solve a relaxed version of the partial satisfaction planning problem. We incorporate this heuristic in conjunction with a lookahead strategy in a branch and bound algorithm to solve a class of over-subscribed planning problems.",

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

year = "2007",

month = dec,

day = "1",

language = "English (US)",

isbn = "9781577353447",

series = "ICAPS 2007, 17th International Conference on Automated Planning and Scheduling",

pages = "34--41",

booktitle = "ICAPS 2007, 17th International Conference on Automated Planning and Scheduling",

note = "ICAPS 2007, 17th International Conference on Automated Planning and Scheduling ; Conference date: 22-09-2007 Through 26-09-2007",

}

TY - GEN

T1 - A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems

AU - Benton, J.

AU - Van Den Briel, Menkes

AU - Kambhampati, Subbarao

PY - 2007/12/1

Y1 - 2007/12/1

N2 - The availability of informed (but inadmissible) planning heuristics has enabled the development of highly scalable planning systems. Due to this success, a body of work has grown around modifying these heuristics to handle extensions to classical planning. Most recently, there has been an interest in addressing partial satisfaction planning problems, but existing heuristics fail to address the complex interactions that occur in these problems between action and goal selection. In this paper we provide a unique admissible heuristic based on linear programming that we use to solve a relaxed version of the partial satisfaction planning problem. We incorporate this heuristic in conjunction with a lookahead strategy in a branch and bound algorithm to solve a class of over-subscribed planning problems.

AB - The availability of informed (but inadmissible) planning heuristics has enabled the development of highly scalable planning systems. Due to this success, a body of work has grown around modifying these heuristics to handle extensions to classical planning. Most recently, there has been an interest in addressing partial satisfaction planning problems, but existing heuristics fail to address the complex interactions that occur in these problems between action and goal selection. In this paper we provide a unique admissible heuristic based on linear programming that we use to solve a relaxed version of the partial satisfaction planning problem. We incorporate this heuristic in conjunction with a lookahead strategy in a branch and bound algorithm to solve a class of over-subscribed planning problems.

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

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

M3 - Conference contribution

AN - SCOPUS:44449108079

SN - 9781577353447

T3 - ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

SP - 34

EP - 41

BT - ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

T2 - ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Y2 - 22 September 2007 through 26 September 2007

ER -

A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this