Effective adversarial plan recognition requires information about how the adversary is planning his actions and vice versa, the way the adversary is planning his actions is affected by how those actions are going to be detected. In this paper, we develop a game-theoretic model that integrates adversarial planning with adversarial plan recognition. The model considers planning and plan recogniti...

This paper presents a new algorithm for plan recognition using an action grammar formalism based on Combinatory Catagorial Grammar, that requires a significant shift in thinking about the problem of plan recognition. This approach makes significant use of the concepts of lexicalization and headedness from natural language parsing. It argues that lexicalization of action grammars can help plan r...

In this paper, the creation of ontology of manufacturing features for the development of a feature library is described. The designer’s intention described in functional data of the feature constructing face elements is considered for the creation of the ontology. The creation of the manufacturing feature ontology is intended to make the feature library be useful for the extraction of manufactu...

For the generation of process plans of a part type based on the manufacturing features recognized from the product design information, a feature library where manufacturing features can refer to their corresponding manufacturing information is needed. In this paper, we describe the creation of ontology of manufacturing features for the development of a feature library. The creation of manufactu...

This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to parse lexicalized grammars, and demonstrate its effectiveness empirically. To do this, the paper first shows how encoding plan libraries as context free grammars permits the application of standard rewriting techniques to ...

Plan recognition is the process of observing another agent's behavior(s) and inferring what, and possibly why, the agent is acting as it is. Plan recognition becomes a very important means of acquiring such information about other agents in situations and domains where explicit communication is either very costly, dangerous, or impossible. Performing plan recognition in a physical domain (i.e. ...

To coordinate with other agents in its an environment, an agent needs models of what the other agents are trying to do. When communication is impossible or expensive, this information must be acquired indirectly via plan recognition. Typical approaches to plan recognition start with specification of the possible plans the other agents may be following and develop special techniques for discrimi...

In a manufacturing feature-based process planning system, for the generation of process plans, it is necessary to develop a feature library that consists of pre-defined manufacturing features and the manufacturing information to create the shape of the features. This paper describes the development of a feature library for a process planning system. The feature library is developed to enable th...

Plan recognition is the process of inferring other agents’ plans and goals based on their observable actions. Essentially all previous work in plan recognition has focused on the recognition process itself, with no regard to the use of the information in the recognizing agent. As a result, low-likelihood recognition hypotheses that may imply significant meaning to the observer, are ignored in e...

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 m...