Plan recognition by program execution in continuous temporal domains

  • Authors:

  • Christoph Schwering;Daniel Beck;Stefan Schiffer;Gerhard Lakemeyer

  • Affiliations:

  • Knowledge-based Systems Group, RWTH Aachen University, Aachen, Germany;Knowledge-based Systems Group, RWTH Aachen University, Aachen, Germany;Knowledge-based Systems Group, RWTH Aachen University, Aachen, Germany;Knowledge-based Systems Group, RWTH Aachen University, Aachen, Germany

  • Venue:
  • KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Much of the existing work on plan recognition assumes that actions of other agents can be observed directly. In continuous temporal domains such as traffic scenarios this assumption is typically not warranted. Instead, one is only able to observe facts about the world such as vehicle positions at different points in time, from which the agents' plans need to be inferred. In this paper we show how this problem can be addressed in the situation calculus and a new variant of the action programming language Golog, which includes features such as continuous time and change, stochastic actions, nondeterminism, and concurrency. In our approach we match observations against a set of candidate plans in the form of Golog programs. We turn the observations into actions which are then executed concurrently with the given programs. Using decision-theoretic optimization techniques those programs are preferred which bring about the observations at the appropriate times. Besides defining this new variant of Golog we also discuss an implementation and experimental results using driving maneuvers as an example.