García Olaya, ÁngelRosa Turbides, Tomás Eduardo de laBorrajo Millán, Daniel2012-01-162012-01-162011Jose 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.978-3-642-25273-70302-9743 (Print)1611-3349 (Online)https://hdl.handle.net/10016/12968Oversubscription 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.application/pdfeng© Springerconference paperInformática10.1007/978-3-642-25274-7_19open access183192Advances in Artificial Intelligence7023