Abstract
Most of the real world problems involve numerical handling. New planning systems such as FF-Metric [9], MIPS [4] and SAPA [3] are able to handle numerical resources, but in most cases the resources are only used as auxiliary numerical constraints added to the symbolic planning domains. Furthermore the numerical update in all of these planning systems is limited to the arithmetic operations. In this paper we present a new planning system FHP (Functional Heuristic Planning) that is able to solve totally numerical and/or symbolic planning domains. We propose a new action representation to support numerical conditions and effects, where we allow a non-restricted function application for numerical update. FHP guides its search using a heuristic derived from a relaxed problem by using the planning graph of GraphPlan-style [1]. Allowing functions application gives the possibility to solve a larger class of problems where the planning process requires a complex calculation instead of simple arithmetic operations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 1636–1642 (1995)
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129, 5–33 (2001)
Do, M.B., Kambhampati, S.S.: A domain-independent heuristic metric temporal planner. In: European Conference on Planning (2001)
Edelkamp, S.: Mixed propositional and numerical planning in the model checking integrated planning system. In: AIPS, Workshop on Temporal Planning (2002)
Fox, M., Long, D.: PDDL2.1: An extention to PDDL for expressing temporal planning domains. In: AIPS (2002)
Haslum, P., Geffner, H.: Heuristic planning with time and resources. In: Proc. IJCAI 2001 Workshop on Planning with Resources (to appear, 2001)
Hoffman, J.: FF: The fast-forward planning system. AI Magazine 22, 57–62 (2001)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Artificial Intelligence Research 14, 253–302 (2001)
Hoffmann, J.: Extending FF to numerical state variables. In: Proceedings of the 15th European Conference on Artificial Intelligence, Lyon, France (to appear, 2002)
Long, D., Fox, M.: Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research 10, 87–115 (1999)
Nigenda, R., N, X., Kambhampati, S.: AltAlt: Combining the advantages of graphplan and heuristic state search. Technical Report, Arizona State University, US (2000)
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
Zalaket, J., Camilleri, G. (2004). FHP: Functional Heuristic Planning. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30133-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30133-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23206-3
Online ISBN: 978-3-540-30133-2
eBook Packages: Springer Book Archive