• Corpus ID: 8856865

Plan Recognition as Planning Revisited

@inproceedings{Sohrabi2016PlanRA,
  title={Plan Recognition as Planning Revisited},
  author={Shirin Sohrabi and Anton Riabov and O. Udrea},
  booktitle={IJCAI},
  year={2016}
}
Recent work on plan recognition as planning has shown great promise in the use of a domain theory and general planning algorithms for the plan recognition problem. [] Key Method That is, in addition to the original costs of the plan, we define two objectives that account for missing and noisy observations, and optimize for a linear combination of all objectives.

Figures and Tables from this paper

Partial-Order, Partially-Seen Observations of Fluents or Actions for Plan Recognition as Planning
TLDR
This work aims to make plan recognition as planning more ready for real-world scenarios by adapting previous compilations to work with partial-order, half-seen observations of both fluents and actions, and provides a compilation from plan recognition problem to classical planning problem, similar to original work by Ramirez and Geffner.
Landmark-Based Approaches for Goal Recognition as Planning
An LP-Based Approach for Goal Recognition as Planning
TLDR
This approach uses additional operator-counting constraints derived from the observations to efficiently infer the correct goal, and serves as basis for a number of further methods with additional constraints.
Plan-Recognition as Planning in Continuous and Discrete Domains
TLDR
This work provides a formalization of recognition problems which admits continuous environments, as well as discrete domains, and shows that through mirroring— generalizing plan-recognition by planning—the authors can apply continuous-world motion planners in plan recognition.
Plan and Goal Recognition as HTN Planning
TLDR
The evaluation shows that current planning systems are able to handle large models with thousands of possible goals, that the approach results in high recognition rates, and that it works even when the environment is partially observable, i.e., if the observer might miss observations.
Recognition of Navigation Goals through Goal Mirroring
TLDR
This paper advocates goal mirroring, a PRP approach that directly tackles the efficiency of online goal recognition, and makes (|O| + 1)|G| calls in the worst case, and identifies two independent decision points within the goal Mirroring algorithm where heuristics may be used to further improve run-time.
Plan Recognition in Continuous Domains
TLDR
This work provides a formalization of recognition problems which admits continuous environments, as well as discrete domains, and shows that through mirroring— generalizing plan-recognition by planning—the authors can apply continuous-world motion planners in plan recognition.
Landmark-Based Heuristics for Goal Recognition
TLDR
This paper proposes goal recognition heuristics that rely on information from planning landmarks — facts or actions that must occur if a plan is to achieve a goal when starting from some initial state that can recognize goals more accurately, and run orders of magnitude faster, than the current state of the art.
Model Recognition as Planning
TLDR
A novel method is introduced that estimates the probability of a STRIPS model to produce an observation of a plan execution and it is robust to missing actions and intermediate states in the observation.
Top-Quality Planning: Finding Practically Useful Sets of Best Plans
TLDR
A new family of computational problems called top-quality planning is proposed, where solution validity is defined through plan quality bound rather than an arbitrary number of plans, and the first planner is presented, shown to be competitive with a top-k planner based baseline.
...
...

References

SHOWING 1-10 OF 46 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
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.
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective.
Action-Model Based Multi-agent Plan Recognition
TLDR
This paper proposes a novel approach for recognizing multi-agent team plans based on such action models rather than libraries of team plans, and encode the resulting MAPR problem as a satisfiability problem and solve the problem using a state-of-the-art weighted MAX-SAT solver.
Evaluating Diversity in Classical Planning
TLDR
It is shown that planners searching for plan sets must consider a third metric, parsimony, that prefers shorter plans while maximizing diversity, and three existing approaches for generating diverse plans are evaluated and two new algorithms are evaluated designed to explicitly manage diversity and interaction between the diversity and quality metrics.
Landmark-Based Plan Distance Measures for Diverse Planning
TLDR
Landmark-based plan distance overcomes some of the weaknesses of syntactic plan distance measures and can be used to find plan sets that are both landmark diverse and action set diverse.
Domain Independent Approaches for Finding Diverse Plans
TLDR
It is described how two representative state-of-the-art domain independent planning approaches - one based on compilation to CSP, and the other based on heuristic local search - can be adapted to produce diverse plans.
Preferred Explanations: Theory and Generation via Planning
TLDR
This paper provides a logical characterization of the notion of an explanation and identifies and exploits a correspondence between explanation generation and planning, and illustrates the feasibility of generating (preferred) explanations via planning.
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut
Optimal plans of delete-free planning tasks are interesting both in domains that have no delete effects and as the relaxation heuristic h+ in general planning. Many heuristics for optimal and
...
...