Continual Planning in Golog

Authors

  • Till Hofmann RWTH Aachen University
  • Tim Niemueller RWTH Aachen University
  • Jens Claßen RWTH Aachen University
  • Gerhard Lakemeyer RWTH Aachen University

DOI:

https://doi.org/10.1609/aaai.v30i1.10414

Keywords:

Golog, Situation Calculus, PDDL, Classical Planning, Continual Planning

Abstract

To solve ever more complex and longer tasks, mobile robots need to generate more elaborate plans and must handle dynamic environments and incomplete knowledge. We address this challenge by integrating two seemingly different approaches — PDDL-based planning for efficient plan generation and Golog for highly expressive behavior specification — in a coherent framework that supports continual planning. The latter allows to interleave plan generation and execution through assertions, which are placeholder actions that are dynamically expanded into conditional sub-plans (using classical planners) once a replanning condition is satisfied. We formalize and implement continual planning in Golog which was so far only supported in PDDL-based systems. This enables combining the execution of generated plans with regular Golog programs and execution monitoring. Experiments on autonomous mobile robots show that the approach supports expressive behavior specification combined with efficient sub-plan generation to handle dynamic environments and incomplete knowledge in a unified way.

Downloads

Published

2016-03-05

How to Cite

Hofmann, T., Niemueller, T., Claßen, J., & Lakemeyer, G. (2016). Continual Planning in Golog. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10414