Change search
ReferencesLink to record
Permanent link

Direct link
Evaluating a plan-recognition framework using tree automata
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2012 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Plan recognition is the task of inferring the possible plans an independent agent might have in mind from observing and analyzing the agents actions. Plan recognition have, among other things, practical applications within the fields of signal analysis and artificial intelligence.In 2010 Johanna Bjorklund and Lisa Kaati developed a framework for plan recognition using weighted, unranked tree automata. This paper explains how their algorithm was implemented and evaluated in the context of StarCraft II a real-time strategy computer game.

Place, publisher, year, edition, pages
, UMNAD, 895
National Category
Engineering and Technology
URN: urn:nbn:se:umu:diva-52490OAI: diva2:505146
Educational program
Bachelor of Science Programme in Computing Science
Available from: 2012-02-23 Created: 2012-02-23 Last updated: 2012-02-23Bibliographically approved

Open Access in DiVA kB)266 downloads
File information
File name FULLTEXT01.pdfFile size 1985 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 266 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: 191 hits
ReferencesLink to record
Permanent link

Direct link