Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners

By Miquel Ramírez, Hector Geffner. 2010

379 citations recorded by the source corpus.

Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently, without the need of a plan library, using slightly modified planning algorithms. In this work, we extend this approach to the more general problem of probabilistic plan recognition where a probability distribution over the set of goals is sought under the assumptions that actions have deterministic effects and both agent and observer have complete information about the initial state. We show that this problem can be solved efficiently using classical planners provided that the probability of a partially observed execution given a goal is defined in terms of the cost difference of achieving the goal under two conditions: complying with the observations, and not complying with them. This cost, and hence the posterior goal probabilities, are computed by means of two calls to a classical planner that no longer has to be modified in any way. A number of examples is considered to illustrate the quality, flexibility, and scalability of the approach.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Subbarao Kambhampati
  2. Josh Tenenbaum
  3. Sarath Sreedharan
  4. Tathagata Chakraborti
  5. Stefano V. Albrecht
  6. Sergey Levine
  7. Peter Stone
  8. Leslie Pack Kaelbling

In Computer Vision and Pattern Recognition

  1. Josh Tenenbaum
  2. Tim Miller
  3. Leslie Pack Kaelbling
  4. Tomas Lozano-Perez
  5. Malik Ghallab
  6. Peter Stone
  7. Subbarao Kambhampati
  8. Tathagata Chakraborti

Citations in the corpus