A heuristic search approach to planning with temporally extended preferences

Simple item page
dc.contributor.authorBaier, Jorge A.
dc.contributor.authorBacchus, Fahiem
dc.contributor.authorMcllraith, Sheila A.
dc.date.accessioned2024-01-10T13:45:41Z
dc.date.available2024-01-10T13:45:41Z
dc.date.issued2009
dc.description.abstractPlanning with preferences involves not only finding a plan that achieves the goal, it requires finding a preferred plan that achieves the goal, where preferences over plans are specified as part of the planner's input. In this paper we provide a technique for accomplishing this objective. Our technique can deal with a rich class of preferences, including so-called temporally extended preferences (TEPs). Unlike simple preferences which express desired properties of the final state achieved by a plan, TEPs can express desired properties of the entire sequence of states traversed by a plan, allowing the user to express a much richer set of preferences. Our technique involves converting a planning problem with TEPs into an equivalent planning problem containing only simple preferences. This conversion is accomplished by augmenting the inputed planning domain with a new set of predicates and actions for updating these predicates. We then provide a collection of new heuristics and a specialized search algorithm that can guide the planner towards preferred plans. Under some fairly general conditions our method is able to find a most preferred plan-i.e., an optimal plan. It can accomplish this without having to resort to admissible heuristics, which often perform poorly in practice. Nor does our technique require an assumption of restricted plan length or make-span. We have implemented our approach in the HPLAN-P planning system and used it to compete in the 5th International Planning Competition, where it achieved distinguished performance in the Qualitative Preferences track. (C) 2008 Elsevier B.V. All rights reserved.
dc.fechaingreso.objetodigital19-04-2024
dc.format.extent26 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.artint.2008.11.011
dc.identifier.issn0004-3702
dc.identifier.urihttps://doi.org/10.1016/j.artint.2008.11.011
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/79066
dc.identifier.wosidWOS:000264656000005
dc.information.autorucIngeniería;Baier JA ;S/I;9477
dc.issue.numero5-6
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final618
dc.pagina.inicio593
dc.publisherELSEVIER SCIENCE BV
dc.revistaARTIFICIAL INTELLIGENCE
dc.rightsacceso restringido
dc.subjectPlanning with preferences
dc.subjectTemporally extended preferences
dc.subjectPDDL3
dc.subjectSYSTEM
dc.titleA heuristic search approach to planning with temporally extended preferences
dc.typeartículo
dc.volumen173
sipa.codpersvinculados9477
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2024-04-19. A heuristic search approach to planning with temporally extended preferences.pdf
Size:
3.04 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas