RT Conference Proceedings
T1 Using the relaxed plan heuristic to select goals in oversubscription planning problems
A1 García Olaya, Ángel
A1 Rosa Turbides, Tomás Eduardo de la
A1 Borrajo Millán, Daniel
AB Oversubscription planning (OSP) appears in manyreal 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, wepresent a new technique to select goals \a priori" for problems inwhich 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 inthe space of subsets of goals is performed, yielding a new set ofgoals to plan for. A revised planning problem can be created andsolved, taking into account only the selected goals. We presentexperiments in six di erent domains with good results.
PB Springer
SN 978-3-642-25273-7
SN 0302-9743 (Print)
SN 1611-3349 (Online)
YR 2011
FD 2011
LK https://hdl.handle.net/10016/12968
UL https://hdl.handle.net/10016/12968
LA eng
NO This work has been partially supported by MICIIN TIN2008-06701-C03-03 andCCG10-UC3M/TIC-5597 projects.
DS e-Archivo
RD 19 may. 2024