Evaluating a plan-recognition framework using tree automata
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
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
Engineering and Technology
IdentifiersURN: urn:nbn:se:umu:diva-52490OAI: oai:DiVA.org:umu-52490DiVA: diva2:505146
Bachelor of Science Programme in Computing Science