Abstract
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graph-plan-like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. This paper presents a new approach to extend the functionality of these graphs in order to manage numeric optimization criteria (problem metric), instead of only plan length optimization. This extension leads to more informed relaxed plans, without increasing significantly the computational cost. Planners that use the relaxed plans for further refinements can take advantage of this additional information to compute better quality plans.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence Journal 129, 5–33 (2001)
Bylander, T.: ‘The computational complexity of propositional STRIPS planning’. Artificial Intelligence 69, 165–204 (1994)
Do, M.B., Kambhampati, S.: Sapa: A multi-objective metric temporal planner. Journal of Artificial Intelligence Research 20, 155–194 (2003)
Edelkamp, S.: Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research 20, 195–238 (2003)
Fox, M., Derek, L.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20, 61–124 (2003)
Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research 20, 239–290 (2003)
Hoffmann, J.: The Metric-FF planning system: Translating ’ignoring delete lists’ to numeric state variables. Journal of Artificial Intelligence Research 20, 291–341 (2003)
Hoffmann, J., Nebel, B.: The FF planning system: Fast planning generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
McDermott, D.: A heuristic estimator for means-ends analysis in planning. In: Proceedings of the International Conference on Artificial Intelligence Planning Systems, vol. 3, pp. 142–149 (1996)
Refanidis, I., Vlahavas, I.: The GRT planning system: Backward heuristic construction in forward state-space planning. Journal of Artificial Intelligence Research 14, 115–161 (2001)
Sapena, O., Onaindia, E., Mellado, M., Correcher, C., Vendrell, V.: Reactive planning simulation in dynamic environments with VirtualRobot. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS, vol. 3029, pp. 699–707. Springer, Heidelberg (2004)
Younes, H.L.S., Simmons, R.G.: VHPOP: Versatile heuristic partial order planner. Journal of Artificial Intelligence Research 20, 405–430 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sapena, O., Onaindía, E. (2004). Handling Numeric Criteria in Relaxed Planning Graphs. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive