Flexible Plan-Subplan Matching for Plan Recognition in Case-Based Agents
نویسندگان
چکیده
Plan-subplan matching is an important step in case-based plan recognition. We present RelaxedVF2, an algorithm for plan-subplan matching for plans encoded using the Action Sequence Graph representation. RelaxedVF2 is a subgraph monomorphism algorithm that affords flexibility and error tolerance for plan-subplan matching. We present a study comparing RelaxedVF2 with an alternate degreesequence matcher that we used in our prior work and found that RelaxedVF2 attains higher plan recognition accuracy on a paradigmatic domain.
منابع مشابه
IJCAI ’ 95 Workshop on the Next Generation of Plan Recognition Systems p . 72 - 77 Procedural Agent Model for Plan
We propose a formal procedure-based agent model for plan recognition as an alternative to the declarative proposition-based agent model. Our formalism, called the Procedural Agent Model (PAM) allows us to describe procedural plans of agents in a concise and abstract way. Plan recognition uses PAM as a library of plan schemas and applies a graph-based pattern-matching algorithm to the observed e...
متن کاملFast and Complete Symbolic Plan Recognition: Allowing for Duration, Interleaved Execution, and Lossy Observations
It is important for agents to model other agents’ unobserved plans and goals, based on their observable actions. This process of modeling others based on observations is known as plan-recognition. Plan recognition has been studied for many years. It often takes the form of matching observations of an agent’s actions to a plan-library, a model of possible plans selected by the agent. However, th...
متن کاملProcedural Agent Model for Plan Recognition
We propose a formal procedure-based agent model for plan recognition as an alternative to the declarative proposition-based agent model. Our formalism, called the Procedural Agent Model (PAM) allows us to describe procedural plans of agents in a concise and abstract way. Plan recognition uses PAM as a library of plan schemas and applies a graph-based pattern-matching algorithm to the observed e...
متن کاملEncapsulation of Actions and Plans in Conditional Planning Systems
We introduce a notion of macroaction for a given subplan. A macroaction is an action representing the given plan and it can be considered as an abstraction, neglecting the internal structure of the original plan. The description of the macroaction is sufficiently powerful to represent all the information needed for synchronization and clobbering detection of the given subplan. It is possible to...
متن کاملCase-based Local and Global Percept Processing for Rebel Agents
Rebel Agents are goal-reasoning agents capable of “refusing” a usergiven goal, plan, or subplan that conflicts with the agent’s own internal motivation. Rebel Agents are intended to enhance character believability, a key aspect of creating engaging narratives in any medium, among other possible uses. We propose to implement and expand upon a Rebel Agent prototype in eBotworks, a cognitive agent...
متن کامل