Abstract
We present an extension of state-based planning from traditional Strips to function application, allowing to express operator effects as updates. As proposed in PDDL, fluent variables are introduced and, consequently, predicates are defined over general terms. Preconditions of operators are characterized as variable binding constraints with standard preconditions as a special case of equality constraints. Operator effects can be expressed by ADD/DEL effects and additionally by updates of fluent variables. Mixing ADD/DEL effects and updates in an operator is allowed. Updating can involve the application of user-defined and built-in functions of the language in which the planner is realized. We present an operational semantics of the extended language. We will give a variety of example domains which can be dealt with in an uniform way: planning with resource variables, numerical problems such as water jug, functional variants of Tower of Hanoi and blocks-world, list sorting, and constraint-logic programming.
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
Bacchus, F., Kautz, H., Smith, D. E., Long, D., Geffner, H., & Koehler, J. (2000). AIPS-00 Planning Competition, Breckenridge, CO.
Bibel, W. (1998). Let’s plan it deductively. Artificial Intelligence, 103(1–2), 183–208.
Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1–2), 281–300.
Bonet, B., & Geffner, H. (1998). Learning sorting and decision trees with POMDPs. In Proc. 15th international conf. on machine learning (pp. 73–81). Morgan Kaufmann.
Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In Proc. European Conference on Planning (ECP-99), Durham, UK. Springer.
Ehrig, H., & Mahr, B. (1985). Fundamentals of algebraic specification 1. Springer.
Field, A. J., & Harrison, P. G. (1988). Functional progamming. Reading, MA: Addison-Wesley.
Fox, M., & Long, D. (2001). PDDL2.1: An extension to PDDLfor expressing temporal planning domains. http://www.dur.ac.uk/d.p.long/competition.html.
Frühwirth, T., & Abdennadher, S. (1997). Constraint-programming. Berlin: Springer.
Geffner, H. (2000). Functional Strips: A more flexible language for planning and problem solving. In J. Minker (Ed.), Logic-based artificial intelligence. Dordrecht: Kluwer.
Kautz, H., & Selman, B. (1996). Pushing the envelope: Planning, propositional logic and stochastic search. In Proc. 13th national conference on artificial intelligence and 8th innovative applications of artificial intelligence conference (pp. 1194–1201).
Koehler, J. (1998). Planning under resource constraints. In H. Prade (Ed.), Proc. 13th European Conference on Artificial Intelligence (ECAI-98 (p. 489–493). Wiley.
Koehler, J., Nebel, B., & Hoffmann, J. (1997). Extending planning graphs to an ADL subset. In Proc. European Conference on Planning (ECP-97) (p. 273–285). Springer. (extended version as Technical Report No. 88/1997, University Freiburg)
Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Proc. of the 14th IJCAI (p. 1643–1649). Morgan Kaufmann.
Manna, Z., & Waldinger, R. (1987). How to clear a block: a theory of plans. Journal of Automated Reasoning, 3(4), 343–378.
McDermott, D. (1998). PDDL-the planning domain definition language. http://ftp.cs.yale.edu/pub/mcdermott.
McDermott, D. (2000). The 1998 AI planning systems competition. AI Magazine, 21(2).
Müller, M. (2000). Integration von Funktionsanwendungen beim zustandsbasierten Planen. diploma thesis, Dep. of Computer Science, TU Berlin.
Pednault, E. P. D. (1987). Formulating multiagent, dynamic-world problems in the classical planning framework. In M. P. Georgeff & A. L. Lansky (Eds.), Proc. Workshop on Reasoning About Actions and Plans (pp. 47–82). Morgan Kaufmann.
Pednault, E. P. D. (1994). ADL and the state-transition model of action. Journal of Logic and Computation, 4(5), 467–512.
Schmid, U., & Wysotzki, F. (1998). Induction of recursive program schemes. In Proc. 10th European Conference on Machine Learning (ECML-98) (Vol. 1398, p. 214–225). Springer.
Schmid, U., & Wysotzki, F. (2000). Applying inductive programm synthesis to macro learning. In Proc. 5th Int.. Conf. on Artificial Intelligence Planning and Scheduling (p. 371–378).
Sterling, L., & Shapiro, E. (1986). The art of Prolog: Advanced programming techniques. MIT Press.
Veloso, M., Carbonell, J., Pérez, M. A., Borrajo, D., Fink, E., & Blythe, J. (1995). Integrating planning and learning: The Prodigy architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7(1), 81–120.
Weld, D. (1994). An introduction to least commitment planning. AI Magazine, 15(4), 27–61.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmid, U., Müller, M., Wysotzki, F. (2002). Integrating Function Application in State-Based Planning. In: Jarke, M., Lakemeyer, G., Koehler, J. (eds) KI 2002: Advances in Artificial Intelligence. KI 2002. Lecture Notes in Computer Science(), vol 2479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45751-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-45751-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44185-4
Online ISBN: 978-3-540-45751-0
eBook Packages: Springer Book Archive