Change search
ReferencesLink to record
Permanent link

Direct link
A simplistic approach to keyhole plan recognition
Number of Authors: 2
1995 (English)Report (Refereed)
Abstract [en]

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

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1995, 1. , 16 p.
SICS Technical Report, ISSN 1100-3154 ; T95:01
Keyword [en]
Plan Recognition, Situated Reasoning
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-21454OAI: diva2:1041490
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(187 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 187 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link