@Misc{dcSanchez04,
author = {Romeo Sanchez},
title = {Planning Graph Based Heuristics for Partial Satisfaction Problems},
howpublished = {In the 14th International Conference on Automated Planning and Scheduling Doctoral Consortium},
year = {2004},
abstract = {In many real world planning scenarios, agents often do
not have enough resources to achieve all of their goals.
Hence, this requires finding plans that satisfy only a
subset of them. Solving such partial satisfaction planning
(PSP) problems poses several challenges, including
an increased emphasis on modelling 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 extended abstract, we focus on one of the
more general PSP problems, termed PSP NET BENEFIT.
After describing our problem, we present an initial
approach for solving it based on AltAlt (Nguyen,
Kambhampati, \& Sanchez 2002), a regression planner
enforced with reachability heuristics. We called our approach
AltAltps . We describe how cost information
could be propagated in a planning graph data structure,
and how this information could be used to select a subset
of the top level goals upfront, and also to generate
cost sensitive heuristics to guide the regression search.
We also present an evaluation plan of our approach, as
well as some possible improvements to AltAltps.},
url = {pspForPartialSat.pdf},
note = {Whistler, Canada}
}

{"_id":{"_str":"51f6915559ced8df44000def"},"__v":10,"authorIDs":["545d40b96aaec20d230003fc"],"author_short":["Sanchez, R."],"bibbaseid":"sanchez-planninggraphbasedheuristicsforpartialsatisfactionproblems-2004","bibdata":{"bibtype":"misc","type":"misc","author":[{"firstnames":["Romeo"],"propositions":[],"lastnames":["Sanchez"],"suffixes":[]}],"title":"Planning Graph Based Heuristics for Partial Satisfaction Problems","howpublished":"In the 14th International Conference on Automated Planning and Scheduling Doctoral Consortium","year":"2004","abstract":"In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Hence, this requires finding plans that satisfy only a subset of them. Solving such partial satisfaction planning (PSP) problems poses several challenges, including an increased emphasis on modelling 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 extended abstract, we focus on one of the more general PSP problems, termed PSP NET BENEFIT. After describing our problem, we present an initial approach for solving it based on AltAlt (Nguyen, Kambhampati, & Sanchez 2002), a regression planner enforced with reachability heuristics. We called our approach AltAltps . We describe how cost information could be propagated in a planning graph data structure, and how this information could be used to select a subset of the top level goals upfront, and also to generate cost sensitive heuristics to guide the regression search. We also present an evaluation plan of our approach, as well as some possible improvements to AltAltps.","url":"pspForPartialSat.pdf","note":"Whistler, Canada","bibtex":"@Misc{dcSanchez04,\nauthor = {Romeo Sanchez},\ntitle = {Planning Graph Based Heuristics for Partial Satisfaction Problems},\nhowpublished = {In the 14th International Conference on Automated Planning and Scheduling Doctoral Consortium},\nyear = {2004},\nabstract = {In many real world planning scenarios, agents often do\nnot have enough resources to achieve all of their goals.\nHence, this requires finding plans that satisfy only a\nsubset of them. Solving such partial satisfaction planning\n(PSP) problems poses several challenges, including\nan increased emphasis on modelling and handling\nplan quality (in terms of action costs and goal utilities).\nDespite the ubiquity of such PSP problems, very little\nattention has been paid to them in the planning community.\nIn this extended abstract, we focus on one of the\nmore general PSP problems, termed PSP NET BENEFIT.\nAfter describing our problem, we present an initial\napproach for solving it based on AltAlt (Nguyen,\nKambhampati, \\& Sanchez 2002), a regression planner\nenforced with reachability heuristics. We called our approach\nAltAltps . We describe how cost information\ncould be propagated in a planning graph data structure,\nand how this information could be used to select a subset\nof the top level goals upfront, and also to generate\ncost sensitive heuristics to guide the regression search.\nWe also present an evaluation plan of our approach, as\nwell as some possible improvements to AltAltps.},\nurl = {pspForPartialSat.pdf},\nnote = {Whistler, Canada}\n}\n\n","author_short":["Sanchez, R."],"key":"dcSanchez04","id":"dcSanchez04","bibbaseid":"sanchez-planninggraphbasedheuristicsforpartialsatisfactionproblems-2004","role":"author","urls":{"Paper":"yalma.fime.uanl.mx/~romeo/publications/pspForPartialSat.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"misc","biburl":"yalma.fime.uanl.mx/~romeo/publications/romeo-sanchez.bib","downloads":0,"keywords":[],"search_terms":["planning","graph","based","heuristics","partial","satisfaction","problems","sanchez"],"title":"Planning Graph Based Heuristics for Partial Satisfaction Problems","title_words":["planning","graph","based","heuristics","partial","satisfaction","problems"],"year":2004,"dataSources":["hFEMyDFMRXsJxPXm4","y4oAARNut5dWSPinx"]}