When applying plan recognition to Human Computer Interaction, one must cope with users exhibiting a large amount of reactive behaviour: users that change tasks, or change strategies for achieving tasks. Most current approaches to keyhole plan recognition do not address this problem. We describe an application domain for plan recognition, where users exhibit reactive rather than plan-based behaviour, and where existing approaches to plan recognition do not perform well. In order to enable plan recognition in this domain, we have developed an extremely simplistic mechanism for keyhole plan recognition, ”intention guessing”, and applied it to this domain. The algorithm is based on descriptions of observable behaviour, and is able to recognize certain instances of plan failures, suboptimal plans and erroneous actions. At run-time, the algorithm only keeps track of a limited number of the most recent actions, which makes the algorithm ”forgetful”. This property makes the algorithm suitable for domains where users frequently change strategies.
[1]
Annika Waern,et al.
Adaptive help by navigation and explanation
,
1994
.
[2]
Lucy Suchman.
Plans and situated actions: the problem of human-machine communication
,
1987
.
[3]
Kristina Höök,et al.
The glass box user model for filtering
,
1994
.
[4]
James F. Allen,et al.
A Plan Recognition Model for Subdialogues in Conversations
,
1987,
Cogn. Sci..
[5]
Jana Koehler,et al.
Integrated Plan Generation and Recognition - A Logic-Based Approach
,
1991,
Wissensbasierte Systeme.
[6]
Robert Wilensky,et al.
Meta-Planning: Representing and Using Knowledge About Planning in Problem Solving and Natural Language Understanding
,
1981,
Cogn. Sci..
[7]
Henry A. Kautz.
A formal theory of plan recognition
,
1987
.
[8]
Ola Stenborgannika.
A Simplistic Approach to Keyhole Plan Recognition
,
1995
.