Planning graph heuristics for selecting objectives in over-subscription planning problems

Romeo Sanchez Nigenda, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

Abstract

Partial Satisfaction or Over-subscription Planning problems arise in many real world applications. Applications in which the planning agent does not have enough resources to accomplish all of their given goals, requiring plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, from new models for handling plan quality to efficient heuristics for selecting the most beneficial goals. In this paper, we extend planning graph-based reachability heuristics with mutex analysis to overcome complex goal interactions in PSP problems. We start by describing one of the most general PSP problems, the PSP Net Benefit problem, where actions have execution costs and goals have utilities. Then, we present AltWlt,] our heuristic approach augmented with a multiple goal set selection process and mutex analysis. Our empirical studies show that AltWlt is able to generate the most beneficial solutions, while incurring only a small fraction of the cost of other PSP approaches. Introduction.

Original languageEnglish (US)
Title of host publicationICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling
Pages192-201
Number of pages10
StatePublished - 2005
Event15th International Conference on Automated Planning and Scheduling, ICAPS 2005 - Monterey, CA, United States
Duration: Jun 5 2005Jun 10 2005

Other

Other15th International Conference on Automated Planning and Scheduling, ICAPS 2005
CountryUnited States
CityMonterey, CA
Period6/5/056/10/05

Fingerprint

Subscription
Planning
Graph
Heuristics
Interaction
Resources
Selection process
Costs
Empirical study
Execution costs

ASJC Scopus subject areas

  • Information Systems and Management

Cite this

Nigenda, R. S., & Kambhampati, S. (2005). Planning graph heuristics for selecting objectives in over-subscription planning problems. In ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling (pp. 192-201)

Planning graph heuristics for selecting objectives in over-subscription planning problems. / Nigenda, Romeo Sanchez; Kambhampati, Subbarao.

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling. 2005. p. 192-201.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nigenda, RS & Kambhampati, S 2005, Planning graph heuristics for selecting objectives in over-subscription planning problems. in ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling. pp. 192-201, 15th International Conference on Automated Planning and Scheduling, ICAPS 2005, Monterey, CA, United States, 6/5/05.
Nigenda RS, Kambhampati S. Planning graph heuristics for selecting objectives in over-subscription planning problems. In ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling. 2005. p. 192-201
Nigenda, Romeo Sanchez ; Kambhampati, Subbarao. / Planning graph heuristics for selecting objectives in over-subscription planning problems. ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling. 2005. pp. 192-201
@inproceedings{e150b88f26fb4b2399534a9caa9f0e89,
title = "Planning graph heuristics for selecting objectives in over-subscription planning problems",
abstract = "Partial Satisfaction or Over-subscription Planning problems arise in many real world applications. Applications in which the planning agent does not have enough resources to accomplish all of their given goals, requiring plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, from new models for handling plan quality to efficient heuristics for selecting the most beneficial goals. In this paper, we extend planning graph-based reachability heuristics with mutex analysis to overcome complex goal interactions in PSP problems. We start by describing one of the most general PSP problems, the PSP Net Benefit problem, where actions have execution costs and goals have utilities. Then, we present AltWlt,] our heuristic approach augmented with a multiple goal set selection process and mutex analysis. Our empirical studies show that AltWlt is able to generate the most beneficial solutions, while incurring only a small fraction of the cost of other PSP approaches. Introduction.",
author = "Nigenda, {Romeo Sanchez} and Subbarao Kambhampati",
year = "2005",
language = "English (US)",
isbn = "1577352203",
pages = "192--201",
booktitle = "ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling",

}

TY - GEN

T1 - Planning graph heuristics for selecting objectives in over-subscription planning problems

AU - Nigenda, Romeo Sanchez

AU - Kambhampati, Subbarao

PY - 2005

Y1 - 2005

N2 - Partial Satisfaction or Over-subscription Planning problems arise in many real world applications. Applications in which the planning agent does not have enough resources to accomplish all of their given goals, requiring plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, from new models for handling plan quality to efficient heuristics for selecting the most beneficial goals. In this paper, we extend planning graph-based reachability heuristics with mutex analysis to overcome complex goal interactions in PSP problems. We start by describing one of the most general PSP problems, the PSP Net Benefit problem, where actions have execution costs and goals have utilities. Then, we present AltWlt,] our heuristic approach augmented with a multiple goal set selection process and mutex analysis. Our empirical studies show that AltWlt is able to generate the most beneficial solutions, while incurring only a small fraction of the cost of other PSP approaches. Introduction.

AB - Partial Satisfaction or Over-subscription Planning problems arise in many real world applications. Applications in which the planning agent does not have enough resources to accomplish all of their given goals, requiring plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, from new models for handling plan quality to efficient heuristics for selecting the most beneficial goals. In this paper, we extend planning graph-based reachability heuristics with mutex analysis to overcome complex goal interactions in PSP problems. We start by describing one of the most general PSP problems, the PSP Net Benefit problem, where actions have execution costs and goals have utilities. Then, we present AltWlt,] our heuristic approach augmented with a multiple goal set selection process and mutex analysis. Our empirical studies show that AltWlt is able to generate the most beneficial solutions, while incurring only a small fraction of the cost of other PSP approaches. Introduction.

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

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

M3 - Conference contribution

AN - SCOPUS:84890306498

SN - 1577352203

SN - 9781577352204

SP - 192

EP - 201

BT - ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

ER -