Publication:
Using the relaxed plan heuristic to select goals in oversubscription planning problems

Thumbnail Image
Identifiers
URI: http://hdl.handle.net/10016/12968
ISSN: 0302-9743 (Print)
ISSN: 1611-3349 (Online)
ISBN: 978-3-642-25273-7
DOI: 10.1007/978-3-642-25274-7_19
Files
using_LNCS_7023_ps.pdf (308.8 KB)
Publication date
2011
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
Oversubscription planning (OSP) appears in many real problems where nding a plan achieving all goals is infeasi- ble. The objective is to nd a feasible plan reaching a goal sub- set while maximizing some measure of utility. In this paper, we present a new technique to select goals \a priori" for problems in which a cost bound prevents all the goals from being achieved. It uses estimations of distances between goals, which are com- puted using relaxed plans. Using these distances, a search in the space of subsets of goals is performed, yielding a new set of goals to plan for. A revised planning problem can be created and solved, taking into account only the selected goals. We present experiments in six di erent domains with good results.
Description
Keywords
Bibliographic citation
Jose A. Lozano, José A. Gámez, José A. Moreno (eds.). Lectures Notes in Computer Science: vol. 7023. "Advances in Artificial Intelligencce: 14th Conference of the Spanish Association for Artificial Intelligence, CAEPIA, 2011, La Laguna, Spain, November 7-11, 2011. Proceedings" (pp. 183-192). Berlin: Springer.
Collections
DI - PLG - Comunicaciones en Congresos y otros eventos