Abstract
When it comes to buildingrob ot controllers, high-level programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a legal execution of it. However, interleaving offline verification with execution in the world seems to be the most practical approach for large programs and complex scenarios involvinginformation gatheringand exogenous events.
In this paper, we present a mechanism for performing local lookahead for the Golog family of high-level robot programs. The main features of such mechanism are that it takes sensing seriously by constructing conditional plans that are ready to be executed in the world, and it mixes perfectly with an account of interleaved perception, planning, and action. Also, a simple implementation is developed.
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
Baral, C., Son, T.C.: Approximate reasoningab out actions in presence of sensing and incomplete information. In Maluszynski, J., ed.: International Logic Programming Symp osium (ILSP’ 97), Port Jeerson, NY, MIT Press (1997) 387–401
De Giacomo, G., Levesque, H.: Projection usingreg ression and sensors. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), Stockholm, Sweden (1999) 160–165
Etzioni, O., Hanks, S., Weld, D.: An approach to planningwith incomplete information. In: Proceedings of 3rd International Conference on Knowledge Representation and Reasoning. (1992)
Levesque, H.: What is planning in the presence of sensing? In: The Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI-96, Portland, Oregon, American Association for Artificial Intelligence (1996) 1139–1146
Peot, M.A., Smith, D.E.: Conditional nonlinear planning. In: Proceedings of the First International Conference on AI PlanningSystems, College Park, Maryland (1992) 189–197
Levesque, H., Reiter, R., Lesperance, Y., Lin, F., Scherl, R.: GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming 31 (1997) 59–84
De Giacomo, G., Lespérance, Y., Levesque, H.: ConGolog, a concurrent programming language based on the situation calculus. Artificial Intelligence 121 (2000) 109–169
Smith, D., Weld, D.: Conformat graphplan. In: Proceedings of AAAI-98. (1998)
Lakemeyer, G.: On sensingand o.-line interpretingin Golog. In: Logical Foundations for Cognitive Agents, Contributions in Honor of Ray Reiter. Springer, Berlin (1999) 173–187
De Giacomo, G., Levesque, H.: An incremental interpreter for high-level programs with sensing. In Levesque, H.J., Pirri, F., eds.: Logical Foundation for Cognitive Agents: Contributions in Honor of Ray Reiter. Springer, Berlin (1999) 86–102
Kowalski, R.A.: Using meta-logic to reconcile reactive with rational agents. In Apt, K.R., Turini, F., eds.: Meta-Logics and Logic Programming. MIT Press (1995) 227–242
Shanahan, M.: What sort of computation mediates best between perception and action? In Levesque, H., Pirri, F., eds.: Logical Fundations for Cognitive Agents: Contributions in Honor of Ray Reiter. Springer-Verlag (1999) 352–368
McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4 (1969) 463–502
Reiter, R.: Knowledge in Action. Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press (2001)
Reiter, R.: The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed.: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Academic Press, San Diego, CA (1991) 359–380
Lifschitz, V., McCain, N., Remolina, E. Tacchella, A.: Gettingto the airport: The oldest planning problem in AI. Logic-Based Artificial Intelligence (2000) 147–165
Scherl, R., Levesque, H.: The frame problem and knowledge-producing actions. In: Proceedings of AAAI-93. (1993) 689–695
De Giacomo, G., Levesque, H.J., Sardiña, S.: Incremental execution of guarded theories. ACM Transactions on Computational Logic (TOCL) 2 (2001) To appear.
Apt, K.R., Pellegrini, A.: On the occur-check free prolog program. ACM Toplas 16 (1994) 687–726
Sardiña, S.: Local conditional high-level robot program (extended version). http://www.cs.toronto.edu/~ssardina/papers/lchlrp-ext.ps (2001)
Smith, D.E., Williamson, M.: Representation and evaluation of plans with loops. In: WorkingNotes of the AAAI Spring Symposium on Extended Theories of Actions. Formal Theory and Practical Applications., Stanford, CA (1995)
Lin, S.H., Dean, T.: Generatingoptimal policies for high-level plan. In Ghallab, M., Milani, A., eds.: New Directions in AI Planning. IOS Press (1996) 187–200
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sardiña, S. (2001). Local Conditional High-Level Robot Programs. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive