Effective approaches for partial satisfaction (over-subscription) planning

Menkes Van Den Briel, Romeo Sanchez, Minh B. Do, Subbarao Kambhampati

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

53 Citations (Scopus)

Abstract

In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a subset of the goals. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modeling and handling plan quality (in terms of action costs and goal utilities). Despite the ubiquity of such PSP problems, very little attention has been paid to them in the planning community. In this paper, we start by describing a spectrum of PSP problems and focus on one of the more general PSP problems, termed PSP NET BENEFIT. We develop three techniques, (i) one based on integer programming, called OptiPlan, (ii) the second based on regression planning with reachability heuristics, called AltAlt ps, and (iii) the third based on anytime heuristic search for a forward state-space heuristic planner, called Sapa ps. Our empirical studies with these planners show that the heuristic planners generate plans that are comparable to the quality of plans generated by OptiPlan, while incurring only a small fraction of the cost.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Pages562-569
Number of pages8
StatePublished - 2004
EventProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) - San Jose, CA, United States
Duration: Jul 25 2004Jul 29 2004

Other

OtherProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
CountryUnited States
CitySan Jose, CA
Period7/25/047/29/04

Fingerprint

Planning
Integer programming
Costs

ASJC Scopus subject areas

  • Software

Cite this

Van Den Briel, M., Sanchez, R., Do, M. B., & Kambhampati, S. (2004). Effective approaches for partial satisfaction (over-subscription) planning. In Proceedings of the National Conference on Artificial Intelligence (pp. 562-569)

Effective approaches for partial satisfaction (over-subscription) planning. / Van Den Briel, Menkes; Sanchez, Romeo; Do, Minh B.; Kambhampati, Subbarao.

Proceedings of the National Conference on Artificial Intelligence. 2004. p. 562-569.

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

Van Den Briel, M, Sanchez, R, Do, MB & Kambhampati, S 2004, Effective approaches for partial satisfaction (over-subscription) planning. in Proceedings of the National Conference on Artificial Intelligence. pp. 562-569, Proceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004), San Jose, CA, United States, 7/25/04.
Van Den Briel M, Sanchez R, Do MB, Kambhampati S. Effective approaches for partial satisfaction (over-subscription) planning. In Proceedings of the National Conference on Artificial Intelligence. 2004. p. 562-569
Van Den Briel, Menkes ; Sanchez, Romeo ; Do, Minh B. ; Kambhampati, Subbarao. / Effective approaches for partial satisfaction (over-subscription) planning. Proceedings of the National Conference on Artificial Intelligence. 2004. pp. 562-569
@inproceedings{9d680513f14f49afa8d54eaddfcac7d2,
title = "Effective approaches for partial satisfaction (over-subscription) planning",
abstract = "In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a subset of the goals. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modeling and handling plan quality (in terms of action costs and goal utilities). Despite the ubiquity of such PSP problems, very little attention has been paid to them in the planning community. In this paper, we start by describing a spectrum of PSP problems and focus on one of the more general PSP problems, termed PSP NET BENEFIT. We develop three techniques, (i) one based on integer programming, called OptiPlan, (ii) the second based on regression planning with reachability heuristics, called AltAlt ps, and (iii) the third based on anytime heuristic search for a forward state-space heuristic planner, called Sapa ps. Our empirical studies with these planners show that the heuristic planners generate plans that are comparable to the quality of plans generated by OptiPlan, while incurring only a small fraction of the cost.",
author = "{Van Den Briel}, Menkes and Romeo Sanchez and Do, {Minh B.} and Subbarao Kambhampati",
year = "2004",
language = "English (US)",
pages = "562--569",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",

}

TY - GEN

T1 - Effective approaches for partial satisfaction (over-subscription) planning

AU - Van Den Briel, Menkes

AU - Sanchez, Romeo

AU - Do, Minh B.

AU - Kambhampati, Subbarao

PY - 2004

Y1 - 2004

N2 - In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a subset of the goals. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modeling and handling plan quality (in terms of action costs and goal utilities). Despite the ubiquity of such PSP problems, very little attention has been paid to them in the planning community. In this paper, we start by describing a spectrum of PSP problems and focus on one of the more general PSP problems, termed PSP NET BENEFIT. We develop three techniques, (i) one based on integer programming, called OptiPlan, (ii) the second based on regression planning with reachability heuristics, called AltAlt ps, and (iii) the third based on anytime heuristic search for a forward state-space heuristic planner, called Sapa ps. Our empirical studies with these planners show that the heuristic planners generate plans that are comparable to the quality of plans generated by OptiPlan, while incurring only a small fraction of the cost.

AB - In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a subset of the goals. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modeling and handling plan quality (in terms of action costs and goal utilities). Despite the ubiquity of such PSP problems, very little attention has been paid to them in the planning community. In this paper, we start by describing a spectrum of PSP problems and focus on one of the more general PSP problems, termed PSP NET BENEFIT. We develop three techniques, (i) one based on integer programming, called OptiPlan, (ii) the second based on regression planning with reachability heuristics, called AltAlt ps, and (iii) the third based on anytime heuristic search for a forward state-space heuristic planner, called Sapa ps. Our empirical studies with these planners show that the heuristic planners generate plans that are comparable to the quality of plans generated by OptiPlan, while incurring only a small fraction of the cost.

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

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

M3 - Conference contribution

AN - SCOPUS:9444248634

SP - 562

EP - 569

BT - Proceedings of the National Conference on Artificial Intelligence

ER -