Aspects of plan operators in a tree automata framework
2012 (English)In: 2012 15th International Conference on Information Fusion (FUSION), IEEE , 2012, 1462-1467 p.Conference paper (Refereed)
Plan recognition addresses the problem of inferring an agents goals from its action. Applications range from anticipating care-takers’ needs to predicting volatile situations. In this contribution, we describe a prototype plan recognition system that is based on the well-researched theory of (weighted) finite tree automata. To illustrate the system’s capabilities, we use data gathered from matches in the real-time strategy game StarCraft II. Finally, we discuss how more advanced plan operators can be accommodated for in this framework while retaining computational efficiency by taking after the field of formal model checking and over-approximating the target language.
Place, publisher, year, edition, pages
IEEE , 2012. 1462-1467 p.
Plan recognition, tree automata
Computer and Information Science
Research subject Computer and Information Science
IdentifiersURN: urn:nbn:se:umu:diva-80730ISBN: 978-0-9824438-4-2ISBN: 978-1-4673-0417-7OAI: oai:DiVA.org:umu-80730DiVA: diva2:651275
15th International Conference on Information Fusion, FUSION 2012, Singapore, July 9-12, 2012