Type variables and/or temporal constraints in plan recognition

• US 20070226164A1
• Filed: 03/21/2006
• Published: 09/27/2007
• Est. Priority Date: 03/21/2006
• Status: Abandoned Application

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Phelps, John, Pelican, Michael, Geib, Christopher
• Application Number:
  US11/386,242
• Publication Number:
  US 20070226164A1
• Time in Patent Office: Days
• US Class Current: 706/52
• CPC Class Codes: G06N 7/01 Probabilistic graphical models, e.g. probabilistic networks

Abstract

In recognizing plans of agents, the actions of the agents are observed. Based on the observed actions and plans stored in a plan library, a pending set of actions that are pending execution by the agent are generated. Explanations for these pending actions are then generated. The plan library contains plans, the plans stored in the plan library include typed variables and/or temporal constraints, and the explanations depend on the typed variables and/or temporal constraints. Probabilities as to the likelihood that the explanations represent at least one actual plan of the agent may be computed, and at least one of the explanations may be recognized as the actual plan of the agent based on the computed probabilities.

Claims

1. A plan recognition method, implemented by a processing system, of recognizing a plan based on observed actions comprising:

reading the observed actions of at least one agent;

based on the observed actions and a plan library, generating a pending set of actions that are pending execution by the agent and generating explanations for the pending actions contained in the pending set, wherein the plan library contains plans, wherein the plans stored in the plan library include typed variables, and wherein the explanations depend on the typed variables;

computing probabilities as to the likelihood that the explanations represent at least one actual plan of the agent; and

,

recognizing at least one of the explanations as the actual plan of the agent based on the computed probabilities.

2. The method of claim 1 wherein the generating of a pending set of pending actions based on the observed actions includes:

comparing the observed actions with actions contained in the plans stored in a plan library; and

,

forming the pending sets based on yet-to-be-observed actions corresponding to the plans stored in the plan library that have actions enabled by the observed actions.

3. The method of claim 1 wherein the computing of probabilities comprises computing the probabilities as a function of (i) prior probabilities associated with root goals of plans corresponding to the generated explanations, (ii) the number of alternative courses of action available to the agent in the generated explanations, and (iii) the number of elements in the generated pending set.

4. The method of claim 1 wherein at least one of the typed variables has a type defined by negation.

5. The method of claim 1 wherein the generating of a pending set of pending actions based on the observed actions includes comparing the observed actions with actions contained in the plans stored in a plan library, and wherein the actions contained in the plans stored in the plan library include temporal constraints between actions.

6. The method of claim 1 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

7. A plan recognition method, implemented by a processing system, of recognizing a plan based on observed actions comprising:

reading the observed actions of at least one agent;

based on the observed actions and a plan library, generating a pending set of actions that are pending execution by the agent and generating explanations for the pending actions contained in the pending set, wherein the plan library stores plans, wherein the plans contain actions, wherein the actions contained in the plans stored in the plan library include temporal constraints between actions, and wherein the explanations depend on the temporal constraints;

computing probabilities as to the likelihood that the explanations represent at least one actual plan of the agent; and

,

recognizing at least one of the explanations as the actual plan of the agent based on the computed probabilities.

8. The method of claim 7 wherein the generating of a pending set of pending actions based on the observed actions includes:

comparing the observed actions with actions contained in the plans stored in a plan library; and

,

forming the pending sets based on yet-to-be-observed actions corresponding to the plans stored in the plan library that have actions enabled by the observed actions.

9. The method of claim 7 wherein the computing of probabilities comprises computing the probabilities as a function of (i) prior probabilities associated with root goals of plans corresponding to the generated explanations, (ii) the number of alternative courses of action available to the agent in the generated explanations, and (iii) the number of elements in the generated pending set.

10. The method of claim 7 wherein at least one of the typed variables has a type defined by negation.

11. The method of claim 7 wherein the generating of a pending set of pending actions based on the observed actions includes comparing the observed actions with actions contained in the plans stored in a plan library, and wherein the actions contained in the plans stored in the plan library include temporal constraints between actions.

12. The method of claim 7 wherein the temporal constraints contained in the plan library has the following form:

def-temporal relation operator x operator y z

wherein relation is greater than or less than indicating temporal precedence, wherein operator is either ;

begin or ;

end, wherein operator x is the beginning or end of action x in the plan library, wherein operator y is the beginning or end of action y in the plan library, and wherein z represents an offset.

13. A computer readable storage medium having program code stored thereon which, when executed, performs the following plan recognition functions:

reading the observed actions of at least one agent;

comparing the observed actions to plan actions contained in plans stored in a plan library;

generating explanations for the observed actions based on the comparison of the observed actions to plan actions, wherein the explanations must satisfy typed variables and temporal constraints stored in the plan library;

selecting at least one of the explanations as a best fit for the observed actions; and

,

providing an output based on the selected explanation.

14. The computer readable storage medium of claim 13 wherein the program code, when executed, performs the additional function of removing one of the explanations based on a failure to observe an action that is an element of the removed explanation.

15. The computer readable storage medium of claim 13 wherein the typed variable has a type defined by negation.

16. The computer readable storage medium of claim 13 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

17. The computer readable storage medium of claim 13 wherein the temporal constraints contained in the plan library has the following form:

def-temporal relation operator x operator y z

wherein relation is greater than or less than indicating temporal precedence, wherein operator is either ;

begin or ;

end, wherein operator x is the beginning or end of action x in the plan library, wherein operator y is the beginning or end of action y in the plan library, and wherein z represents an offset.

18. The computer readable storage medium of claim 17 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

19. A plan recognition method, implemented by a processing system, of recognizing a plan based on observed actions comprising:

reading the observed actions of at least one agent;

comparing the observed actions to a plan library contains possible plans of the agent, wherein the plans stored in the plan library include typed variables or temporal constraints relating to statements in the plans; and

,

recognizing a plan of the agent based on the comparing of the observed actions to the plan library and on the typed variables or temporal constraints.

20. The method of claim 19 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

21. The method of claim 19 wherein the temporal constraints contained in the plan library has the following form:

def-temporal relation operator x operator y z

wherein relation is greater than or less than indicating temporal precedence, wherein operator is either ;

begin or ;

end, wherein operator x is the beginning or end of action x in the plan library, wherein operator y is the beginning or end of action y in the plan library, and wherein z represents an offset.

22. The method of claim 21 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

23. The method of claim 19 wherein the plan library includes both typed variables and temporal constraints relating to statements in the plans.

24. The method of claim 23 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.

25. The method of claim 23 wherein the temporal constraints contained in the plan library has the following form:

def-temporal relation operator x operator y z

wherein relation is greater than or less than indicating temporal precedence, wherein operator is either ;

begin or ;

end, wherein operator x is the beginning or end of action x in the plan library, wherein operator y is the beginning or end of action y in the plan library, and wherein z represents an offset.

26. The method of claim 25 wherein the types variables contained in the plan library has the following form:

variable ;

type definition

wherein variable represents any variable in the plan library, wherein ;

type indicates that the preceding variable is a typed variable, and wherein definition is a definition of the type.