Song B. F. and Cohen, R., "Temporal Reasoning during Plan Recognition", Proceedings of the Eleventh National Conference on Artificial Intelligence, pp 247-252, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... language, or inexpressivity of the common communication language; creating a need for an agent tracking capability for effective collaboration[14] This agent tracking capability is closely related to plan recognition, which involves recognizing agents plans based on observations of their actions[15, 2, 23]. One key difference is that plan recognition efforts typically focus on tracking a narrower (planbased) class of agent behaviors, as seen in static, single agent domains. In particular, they assume that agents rigidly follow plans step by step. Agent tracking, in contrast, can involve tracking a ....

F. Song and R. Cohen. Temporal reasoning during plan recognition. In Proceedings of the National Conference on Artificial Intelligence. Menlo Park, Calif.: AAAI press, 1991.

....have been applied in the BACK terminological representation system; Lambrix and Ronnquist, 1993 ] study the combination of the temporal logic LITE, where the notion of object is revised from being an indivisible entity into being a temporal structure of versions, and a terminological logic. In [ Song and Cohen, 1991 ] temporal constraints between actions and its decomposed subactions in the context of hierarchical planning are made explicit from the structure of the plan, in order to improve the results of plan recognition. Our proposal reduces the expressivity of [ Schmiedel, 1990 ] in the direction ....

Fei Song and Robin Cohen. Temporal reasoning during plan recognition. In Proc. of AAAI-91, pages 247--252, Anaheim, CA, 1991.

....for local and global program explanations. Chapter 3 Plan Recognition In Artificial Intelligence research, the problem of program understanding has been approached indirectly from the perspective of plan recognition [Kautz and Allen, 1986, Carberry, 1988, Carberry, 1990a, van Beek et al. 1993, Song and Cohen, 1991, Song, 1990] In this work, existing human knowledge in a particular domain is represented in hierarchies (of varying types) of plans that describe relevant actions and goals. Program understanding research has taken similar representational approaches. For example, my own hierarchical program ....

Fei Song and Robin Cohen. Temporal reasoning during plan recognition. Proceedings of the 9th AAAI, pages 247--252, 1991.

....Fill Array Sum Array Calc Avg Divide Figure 1: An Example Action Hierarchy 2. 1 The AI Approach to Plan Recognition Kautz and Allen [4, 5] formalized an approach to plan recognition that has served as a primary building block for many subsequent plan recognition methodologies, including [19, 20]. They provide a general algorithm by which a set of observed or described actions is explained by constructing a plan that contains them . In particular, as actions are observed, hypothetical explanations are proposed for them. This process involves uncertainty, as at any time there are a number ....

Fei Song and Robin Cohen. Temporal Reasoning during Plan Recognition, Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI91), pages 247-252, July 1991.

.... language, or inexpressivity of the common communication language; creating a need for an agent tracking capability for effective collaboration[14] This agent tracking capability is closely related to plan recognition, which involves recognizing agents plans based on observations of their actions[15, 2, 23]. One key difference is that plan recognition efforts typically focus on tracking a narrower (planbased) class of agent behaviors, as seen in static, single agent domains. In particular, they assume that agents rigidly follow plans step by step. Agent tracking, in contrast, can involve tracking a ....

F. Song and R. Cohen. Temporal reasoning during plan recognition. In Proceedings of the National Conference on Artificial Intelligence. Menlo Park, Calif.: AAAI press, 1991.

....is a key capability required for intelligent interaction [38, 36, 40, 22, 4] It involves monitoring other agents observable actions and inferring their mental state their goals, beliefs, intentions and tracking this over time. This capability is closely related to plan recognition [10, 31], which involves recognizing agents plans based on observations of their actions. One key difference is that plan recognition efforts generally assume that agents are executing plans that rigidly prescribe the actions to be performed. Agent tracking, in contrast, involves recognizing a broader ....

F. Song and R. Cohen. Temporal reasoning during plan recognition. In Proceedings of the National Conference on Artificial Intelligence. Menlo Park, Calif.: AAAI press, 1991.

.... as macro actions within other plans (but not within themselves) Any temporal constraint on a step with a macro action can be propagated to each substep within that macro by appropriate use of a constraint propagation algorithm such as in [Allen, 1983] Song and Cohen have show how to do this [Song, 1991, Song and Cohen, 1991] Following precedent, e.g. Kautz, 1991, Song, 1991, Song and Cohen, 1991, van Beek and Cohen, 1991] we draw examples from the cooking domain. By convention, generic concept names are prefixed by c . Names of instances are formed by concatenating a concept name with a ....

.... actions within other plans (but not within themselves) Any temporal constraint on a step with a macro action can be propagated to each substep within that macro by appropriate use of a constraint propagation algorithm such as in [Allen, 1983] Song and Cohen have show how to do this [Song, 1991, Song and Cohen, 1991] Following precedent, e.g. Kautz, 1991, Song, 1991, Song and Cohen, 1991, van Beek and Cohen, 1991] we draw examples from the cooking domain. By convention, generic concept names are prefixed by c . Names of instances are formed by concatenating a concept name with a unique number and ....

[Article contains additional citation context not shown here]

F. Song and R. Cohen. Temporal reasoning during plan recognition. In Proceedings of AAAI-91, pages 247--252, Anaheim, CA, 1991.

.... with Macro Steps 115 Any temporal constraint on a step with a macro action can be propagated to each substep within that macro by appropriate use of constraint propagation algorithms such as those in [Kautz and Ladkin, 1991] Song and Cohen have shown how to do this for qualitative constraints [Song, 1991; Song and Cohen, 1991] Their algorithm is sound, but not complete. The incompleteness stems from their decision to avoid case reasoning with disjunctive temporal networks. trex uses Song and Cohen s algorithm as part of its plan completion process. An analogous algorithm could be devised to ....

.... Steps 115 Any temporal constraint on a step with a macro action can be propagated to each substep within that macro by appropriate use of constraint propagation algorithms such as those in [Kautz and Ladkin, 1991] Song and Cohen have shown how to do this for qualitative constraints [Song, 1991; Song and Cohen, 1991]. Their algorithm is sound, but not complete. The incompleteness stems from their decision to avoid case reasoning with disjunctive temporal networks. trex uses Song and Cohen s algorithm as part of its plan completion process. An analogous algorithm could be devised to propagate metric ....

[Article contains additional citation context not shown here]

F. Song and R. Cohen. Temporal reasoning during plan recognition. In Proceedings of AAAI-91, pages 247--252, Anaheim, CA, 1991. 268

....the types and combinations of events that may be expected to occur. Kautz and Allen (Kautz, 1987; Kautz and Allen, 1986) formalized an approach to plan recognition that has served as a primary building block for many subsequent plan recognition methodologies, including (van Beek et al. 1984; Song and Cohen, 1991). They provide a general algorithm by which a set of observed or described actions is explained by constructing a plan that contains them . In particular, as actions are observed, hypothetical explanations are proposed for them. This process involves uncertainty, as at any time there are a number ....

Song, F. and Cohen R. (1991). Temporal Reasoning during Plan Recognition, Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, pp. 247--252.

....multiple agents: a) two opponents attacking the automated pilot s aircraft; b) opponents stay close; c) opponents stage a coordinated pincer . this maneuver if it fired its missile first) Event tracking is closely related to the problem of plan or situation recognition (Kautz Allen 1986; Song Cohen 1991; Dousson, Gaborit, Ghallab 1993) the process of inferring an agent s plan (or a situation) based on observations of the agent s actions and the temporal relationships among those actions. The term event tracking is preferred in this investigation, since it also involves events other than ....

....domain raises a challenging combination of issues for event tracking. 6 Computational Intelligence Except for the issue of ambiguity, all of the issues presented are novel ones. In particular, in previous investigations in the related areas of plan situation recognition (Kautz Allen 1986; Song Cohen 1991; Dousson, Gaborit, Ghallab 1993; Van Beek Cohen 1991; Carberry 1990a) including one investigation focused on plan recognition in airborne tactical decision making(Azarewicz et al. 1986) these issues have not been addressed. With regard to the first two issues, plan recognition models ....

[Article contains additional citation context not shown here]

Song, F. and R. Cohen 1991. Temporal reasoning during plan recognition. In Proceedings of the National Conference on Artificial Intelligence. Menlo Park, Calif.: AAAI press.

....represented as a specialization and decomposition structure of events and actions. 2. 1 The AI Approach to Plan Recognition Kautz and Allen [3, 4] formalized an approach to plan recognition that has served as a primary building block for many subsequent plan recognition methodologies, including [17, 18]. They provide a general algorithm by which a set of observed or described actions is explained by constructing a plan that contains them . In particular, as actions are observed, hypothetical explanations are proposed for them. This process involves uncertainty, as at any time there are a number ....

Fei Song and Robin Cohen. Temporal Reasoning during Plan Recognition, Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI91), pages 247-252, July 1991.

No context found.

Song B. F. and Cohen, R., "Temporal Reasoning during Plan Recognition", Proceedings of the Eleventh National Conference on Artificial Intelligence, pp 247-252, 1991.

No context found.

Song B. F. and Cohen, R., "Temporal Reasoning during Plan Recognition", Proceedings of the Eleventh National Conference on Artificial Intelligence, pp 247-252, 1991.

No context found.

Song B. F. and Cohen, R., "Temporal Reasoning during Plan Recognition", Proceedings of the Eleventh National Conference on Artificial Intelligence, pp 247-252, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC