Landmark-Based Plan Recognition

@inproceedings{Pereira2016LandmarkBasedPR,
  title={Landmark-Based Plan Recognition},
  author={R. Pereira and Felipe Meneguzzi},
  booktitle={ECAI},
  year={2016}
}
Recognition of goals and plans using incomplete evidence from action execution can be done efficiently by using planning techniques. In many applications it is important to recognize goals and plans not only accurately, but also quickly. In this paper, we develop a heuristic approach for recognizing plans based on planning techniques that rely on ordering constraints to filter candidate goals from observations. These ordering constraints are called landmarks in the planning literature, which… 

Figures and Tables from this paper

Landmark-Based Approaches for Goal Recognition as Planning
Landmark-Based Heuristics for Goal Recognition
TLDR
This paper develops two goal recognition heuristics that rely on information from planning landmarks that can recognize goals more accurately, and run orders of magnitude faster, than the current state-of-the-art.
The More the Merrier?! Evaluating the Effect of Landmark Extraction Algorithms on Landmark-Based Goal Recognition
TLDR
Results show that having more landmarks does not necessarily mean achieving higher accuracy and lower spread, as the additional extracted landmarks may not necessarily increase be helpful towards the goal recognition task.
Online Goal Recognition Combining Landmarks and Planning
TLDR
This paper develops an online approach to recognize goals in both continuous and discrete domains using a combination of goal mirroring and a generalized notion of landmarks adapted from the planning literature.
Goal Recognition Combining Landmarks and Planning
TLDR
This paper develops an online approach to recognize goals in both continuous and discrete domains using a combination of goal mirroring and a generalized notion of landmarks adapted from the planning literature.
Online Goal Recognition as Reasoning over Landmarks
TLDR
This work develops an online approach to recognize goals in both continuous and discrete domains using a combination of goal mirroring and a generalized notion of landmarks adapted from the planning literature.
Evaluating the SBR Algorithm Using Automatically Generated Plan Libraries
TLDR
This work develops a mechanism to automatically generate arbitrarily complex plan libraries which can be directed through a number of parameters, in order to create plan libraries representing different domains and so allowing systematic experimentation and comparison among the several plan recognition algorithms.
Landmark-Enhanced Heuristics for Goal Recognition in Incomplete Domain Models
TLDR
Goal recognition techniques that are capable of recognizing goals using incomplete domain theories by considering different notions of planning landmarks in such domains are developed.
Heuristic Goal Recognition in Incomplete Domain Models
TLDR
This dissertation develops heuristic goal recognition techniques that are capable of recognizing goals using incomplete (and possibly incorrect) domain theories using new notions of planning landmarks.
Inferring Agents Preferences as Priors for Probabilistic Goal Recognition
TLDR
A model to both extend landmark-based goal recognition with a probabilistic interpretation and allow the estimation of such prior probability and its usage to compute posterior probabilities after repeated interactions of observed agents is provided.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Plan Recognition as Planning
In this work we aim to narrow the gap between plan recognition and planning by exploiting the power and generality of recent planning algorithms for recognizing the set G* of goals G that explain a
Domain Independent Goal Recognition
TLDR
This work addresses the problem of goal recognition directly, without assuming a plan library, with a domain description, just as is used for plan construction, and a sequence of action observations, and presents a formalisation of the problem and motivate its interest.
Ordered Landmarks in Planning
TLDR
This work extends Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks and shows how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks.
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
TLDR
This work shows that the problem of probabilistic plan recognition 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.
Extending landmarks analysis to reason about resources and repetition
TLDR
Work in progress to extend some features of domain analysis using landmarks, including the extraction of resource abstracted landmarks; and the identification of landmark repetition along with a count of the minimum number of times a landmark will need to be repeated.
Fast Planning Through Planning Graph Analysis
Fast and Complete Symbolic Plan Recognition
TLDR
This work shows a novel application of machine-learning decision-tree to efficiently map multi-featured observations to matching plan steps and provides efficient lazy-commitment recognition algorithms that avoid enumerating hypotheses with every observation.
A Fast Goal Recognition Technique Based on Interaction Estimates
TLDR
This paper introduces an approach that propagates cost and interaction information in a plan graph, and uses this information to estimate goal probabilities, and shows that this approach is much faster, but still yields high quality results.
Goal Recognition Design
TLDR
A way to reduce the wcd of a model by limiting the set of available actions an agent can perform and provide a method for calculating the optimal set of actions to be removed from the model is proposed.
Temporal Landmarks: What Must Happen, and When
TLDR
It is shown how to derive temporal landmarks and constraints on their associated time points from planning problems, and how exploiting them, in a planner-independent way, can improve planner performance.
...
...