Abstract
We present a representation scheme for the declarative formalization of strategies for action selection based on the situation calculus and circumscription.The formalism is applied to represent a number of heuristics for moving blocks in order to solve planning problems in the blocks world.T he formal model of a heuristic forward chaining planner, which can take advantage of declarative formalizations of strategies for action selection, is proposed. Experiments showing how the use of declarative representations of strategies for action selection allows a heuristic forward chaining planner to improve the performance of state of the art planning systems are described.
In the blocks world, a block is in final position if it is on the table and it should be on the table in the goal configuration, or if it is on a block it should be on in the goal configuration and that block is in final position.
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., and Kabanza, F. 2000 Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116:123–191.
Barrett, A., Golden, K., Penberthy, J. S., and Weld, D. 1993 UCPOP user’s manual, (version 2.0). Technical report TR-93-09-06, University of Washington, Department of Computer Science and Engineering. ftp://cs.washington.edu/pub/ai.
Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence, 90.
Clark, K. 1978. Negation as failure. Gallaire, H., and Minker, J. (Eds.) Advances in data base theory, Plemum Press, New York, 293–322.
Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. A rtificial Intelligence, 2:189–208.
Finzi, A., Pirri, F., and Reiter, R. 2000. Open world planning in the situation calculus.In Proc. of AAAI-2000.
Genesereth, M. R., and Hsu, J. 1989. Partial programs.TR-89-20, Comp. Science, Stanford University.
Huang, Y., Selman, B., and Kautz, H. 1999. Control Knowledge in Planning: Benefits and Tradeoffs. In Proc. of AAAI-99.
Kautz, H., and Selman, B. 1996. Pushing the envelope: planning, propositional logic, and stochastic search. In Proc. of AAAI-96.
Kautz, H., and Selman, B. 1998 Blackbox: a new approach to the application of theorem proving to problem solving. http://www.research.att.com/kautz
Kibler, D., and Morris, P. 1981. Don’t be stupid. In Proc. of IJCAI-81.
Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y. 1997 Extending Planning Graphs to an ADL subset. In European Conference on Planning, 1997, pp. 273–285.
Levesque, H., Reiter, R., Lespérance, Y., Lin, F., and Scherls, R. 1997. GOLOG: a logic programming language for dynamic domains. J. of Logic Programming, Special Issue on Actions, 31(1-3):59–83.
Lifschitz, 1990. Frames in the space of situations. Artificial Intelligence, 46:365–376.
Lifschitz, V. 1993. Circumscription. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay and C.J. Hogger, Ed., volume 3: Nonmonotonic Reasoning and Uncertain Reasoning.Oxf ord University Press.
Lifschitz, 1995. Nested abnormality theories. Artificial Intelligence, 74:1262–1277.
Laird, J., Newell, A., and Rosenbloom, P. 1987 SOAR: an architecture for generalintelligence. Artificial Intelligence, 33(1):1–67.
McCarthy, J., and Hayes, P. 1969. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence, 4:463–502.
McCarthy, J. 1959. Programs with common sense. In Mechanization of Thought Processes, Proc. of the Symp. of the National Physics Laboratory, 77–84.
McCarthy, J. 1980. Circu mscription-a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39.
McCarthy, J. 1985. Formalization of STRIPS in situation calculus.TR-85-9, Comp.Sc ience, Stanford University.
McCarthy, J. 1986. A pplications of circumscription to formalizing common sense knowledge. Artificial Intelligence, 28:89–116.
Reiter, R. 1993. Proving properties of states in situation calculus. Artificial Intelligence 64:337–351.
Reiter, R. 1999. Knowledge in action: logical foundations for describing and implementing dynamical systems. In preparation. Draft available athttp://www.cs.toronto.edu/cogrobo.
Sierra, J. 1998. Declarative formalization of strategies for action selection. In Proc. of the Seventh International Workshop on Non-monotonic Reasoning.
Sierra, J. 1998. Adeclarative formalization of STRIPS. In Proc. of the Thirteenth European Conference on Artificial Intelligence.
Sierra, J. 1999. Declarative formalization of heuristics (taking advice in the blocks world). In Proc. of the International Conference on Computational Intelligence, Modeling, Control and Automation.
Veloso, M., Carbonell, et al. 1995 Integrating planning and learning: the PRODIGY architecture. JETAI, 7(1).
Wilkins, D. 1988 Practical planning: extending the classical AI planning paradigm. Morgan Kaufmann, San Mateo, California.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierra-Santibáñez, J. (2000). Declarative Formalization of Strategies for Action Selection: Applications to Planning. In: Ojeda-Aciego, M., de Guzmán, I.P., Brewka, G., Moniz Pereira, L. (eds) Logics in Artificial Intelligence. JELIA 2000. Lecture Notes in Computer Science(), vol 1919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40006-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-40006-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41131-4
Online ISBN: 978-3-540-40006-6
eBook Packages: Springer Book Archive