Abstract
In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partial plans. Total plans can be seen as (partially ordered) sets of actions which, if executed successfully, would lead to the achievement of the goals. Partial plans, instead, can be seen as (partially ordered) sets of actions which, if executed successfully, would contribute to the achievement of the goals, subject to the achievement of further sub-goals. Planning partially (namely computing partial plans for goals) is useful (or even necessary) for a number of reasons: (i) because the planning agent is resource-bounded, (ii) because the agent has incomplete and possibly incorrect knowledge of the environment in which it is situated, (iii) because this environment is highly dynamic. In this paper, we propose a framework to design situated agents capable of planning partially. The framework is based upon the specification of planning problems via an abductive variant of the event calculus.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90, 281–300 (1997)
Bracciali, A., Demetriou, N., Endriss, U., Kakas, A., Lu, W., Mancarella, P., Sadri, F., Stathis, K., Terreni, G., Toni, F.: The KGP model of agency for global computing: Computational model and prototype implementation. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 340–367. Springer, Heidelberg (2005)
Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: Abductive logic programming with CIFF: system description. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 680–684. Springer, Heidelberg (2004)
Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The CIFF proof procedure for abductive logic programming with constraints. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 31–43. Springer, Heidelberg (2004)
De Giacomo, G., Reiter, R., Soutchanski, M.: Execution monitoring of high-level robot programs. In: Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), Trento, Italy, June 2-5, pp. 453–465. Morgan Kaufmann, San Francisco (1998)
Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. Journal of Logic Programming 19-20, 503–582 (1994)
Kakas, A., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: The KGP model of agency. In: Lopez de Mantaras, R., Saitta, L. (eds.) Proceedings of the Sixteenth European Conference on Artificial Intelligence, Valencia, Spain, August 2004, pp. 33–37. IOS Press, Amsterdam (2004)
Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)
Kakas, A.C., Miller, R.: A simple declarative language for describing narratives with ations. Journal of Logic Programming 31(1-3), 157–200 (1997)
Kowalski, R.A., Sergot, M.: A logic-based calculus of events. New Generation Computing 4(1), 67–95 (1986)
Levesque, H.J., Reiter, R., Lesperance, Y., Lin, F., Scherl, R.B.: GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming 31(1-3), 59–83 (1997)
McIlraith, S., Fadel, R.: Planning with complex actions. In: Benferhat, S., Giunchiglia, E. (eds.) Proceedings of 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), Toulouse, France, April 19-21, pp. 356–364 (2002)
Scherl, R., Levesque, H.J.: Knowledge, action, and the frame problem. Artificial Intelligence 144, 1–39 (2003)
Shanahan, M.: Solving the Frame Problem. MIT Press, Cambridge (1997)
Shanahan, M.: Event calculus planning revisited. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 390–402. Springer, Heidelberg (1997)
Shanahan, M.: Reinventing shakey. In: Working Notes of the 1998 AAAI Fall Symposium on Cognitive Robotics, pp. 125–135 (1998)
Shanahan, M.: The ramification problem in the event calculus. In: Dean, T. (ed.) Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 140–146. Morgan Kaufmann Publishers, San Francisco (1999)
Shanahan, M.: Using reactive rules to guide a forward-chaining planner. In: Proc. of the Fourth European Conference on Planning. Springer, Heidelberg (2001)
Stathis, K., Kakas, A.C., Lu, W., Demetriou, N., Endriss, U., Bracciali, A.: PROSOCS: a platform for programming software agents in computational logic. In: Trappl, R. (ed.) Proceedings of the 17th European Meeting on Cybernetics and Systems Research, Symposium From Agent Theory to Agent Implementation (AT2AI-4), Vienna, Austria, vol. II, pp. 523–528. Austrian Society for Cybernetic Studies (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mancarella, P., Sadri, F., Terreni, G., Toni, F. (2005). Planning Partially for Situated Agents. In: Leite, J., Torroni, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2004. Lecture Notes in Computer Science(), vol 3487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533092_14
Download citation
DOI: https://doi.org/10.1007/11533092_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28060-6
Online ISBN: 978-3-540-31857-6
eBook Packages: Computer ScienceComputer Science (R0)