On-Line Decision-Theoretic Golog for Unpredictable Domains

  • Alexander Ferrein
  • Christian Fritz
  • Gerhard Lakemeyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3238)


DTGolog was proposed by Boutilier et al. as an integration of decision-theoretic (DT) planning and the programming language Golog. Advantages include the ability to handle large state spaces and to limit the search space during planning with explicit programming. Soutchanski developed a version of DTGolog, where a program is executed on-line and DT planning can be applied to parts of a program only. One of the limitations is that DT planning generally cannot be applied to programs containing sensing actions. In order to deal with robotic scenarios in unpredictable domains, where certain kinds of sensing like measuring one’s own position are ubiquitous, we propose a strategy where sensing during deliberation is replaced by suitable models like computed trajectories so that DT planning remains applicable. In the paper we discuss the necessary changes to DTGolog entailed by this strategy and an application of our approach in the RoboCup domain.


Situation Calculus Stochastic Action Nondeterministic Choice Exogenous Action Basic Action Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beetz, M., Schmitt, T., Hanek, R., Buck, S., Stulp, F., Schröter, D., Radig, B.: The AGILO 2001 robot soccer team. Experience-based learning and probabilistic reasoning in autonomous robot control. Autonomous Robots (2004)Google Scholar
  2. 2.
    Boutilier, C., Reiter, R., Price, B.: Symbolic dynamic programming for firstorder MDPs. IJCAI, 690–700 (2001)Google Scholar
  3. 3.
    Boutilier, C., Reiter, R., Soutchanski, M., Thrun, S.: Decision-theoretic, highlevel agent programming in the situation calculus. In: Proc. of AAAI 2000, pp. 355–362, July 3-30, AAAI Press, Menlo Park (2000)Google Scholar
  4. 4.
    De Giacomo, G., Lésperance, Y., Levesque, H.J.: ConGolog, A concurrent programming language based on situation calculus. Artificial Intelligence 121(1-2), 109–169 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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, pp. 86–102. Springer, Berlin (1999)Google Scholar
  6. 6.
    Grosskreutz, H., Lakemeyer, G.: On-line execution of cc-Golog plans. In: Proc. of IJCAI 2001 (2001)Google Scholar
  7. 7.
    Großmann, A., Hölldobler, S., Skvortsova, O.: Symbolic dynamic programming with the Fluent Calculus. In: Proc. IASTED (ACI 2002), pp. 378–383 (2002)Google Scholar
  8. 8.
    Lespérance, Y., Ng, H.-K.: Integrating planning into reactive high-level robot programs. In: Proc. 2nd Int. Cognitive Robotics Workshop, pp. 49–54 (2000)Google Scholar
  9. 9.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Lin, F., Reiter, R.: How to progress a database. Artificial Intelligence 92(1-2), 131–167 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    McCarthy, J.: Situations, actions and causal laws. Technical report, Stanford University (1963)Google Scholar
  12. 12.
    Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence 94(1-2), 7–56 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Puterman, M.: Markov Decision Processes: Discrete Dynamic Programming. Wiley, New York (1994)zbMATHCrossRefGoogle Scholar
  14. 14.
    Reiter, R.: Knowledge in Action. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  15. 15.
    Shanahan, M.: The event calculus explained. In: Veloso, M.M., Wooldridge, M.J. (eds.) Artificial Intelligence Today. LNCS (LNAI), vol. 1600, pp. 409–430. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  16. 16.
    Soutchanski, M.: An on-line decision-theoretic golog interpreter. In: Proc. IJCAI 2001, Seattle, Washington (August 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alexander Ferrein
    • 1
  • Christian Fritz
    • 1
  • Gerhard Lakemeyer
    • 1
  1. 1.Computer Science DepartmentRWTH AachenAachen

Personalised recommendations