Bisson, Francis
Using a Recursive Neural Network to Learn an Agent's Decision Model for Plan Recognition
Bisson, Francis (Université de Sherbrooke) | Larochelle, Hugo (Université de Sherbrooke) | Kabanza, Froduald (Université de Sherbrooke)
Plan recognition, the problem of inferring the goals or plans of an observed agent, is a key element of situation awareness in human-machine and machine-machine interactions for many applications. Some plan recognition algorithms require knowledge about the potential behaviours of the observed agent in the form of a plan library, together with a decision model about how the observed agent uses the plan library to make decisions. It is however difficult to elicit and specify the decision model a priori . In this paper, we present a recursive neural network model that learns such a decision model automatically. We discuss promising experimental results of the approach with comparisons to selected state-of-the-art plan recognition algorithms on three benchmark domains.
Provoking Opponents to Facilitate the Recognition of their Intentions
Bisson, Francis (Université) | Kabanza, Froduald (de Sherbrooke) | Benaskeur, Abder Rezak (Université) | Irandoust, Hengameh (de Sherbrooke)
Possessing a sufficient level of situation awareness is essential for effective decision making in dynamic environments. In video games, this includes being aware to some extent of the intentions of the opponents. Such high-level awareness hinges upon inferences over the lower-level situation awareness provided by the game state. Traditional plan recognizers are completely passive processes that leave all the initiative to the observed agent. In a situation where the opponent's intentions are unclear, the observer is forced to wait until further observations of the opponent's actions are made to disambiguate the pending goal hypotheses. With the plan recognizer we propose, in contrast, the observer would take the initiative and provoke the opponent, with the expectation that his reaction will give cues as to what his true intentions actually are.
Opponent Behaviour Recognition for Real-Time Strategy Games
Kabanza, Froduald (Universite de Sherbrooke) | Bellefeuille, Philipe (Universite de Sherbrooke) | Bisson, Francis (Universite de Sherbrooke) | Benaskeur, Abder Rezak (Defence R&D Canada - Valcartier) | Irandoust, Hengameh (Defence R&D Canada &ndash)
In Real-Time Strategy (RTS) video games, players (controlled by humans or computers) build structures and recruit armies, fight for space and resources in order to control strategic points, destroy the opposing force and ultimately win the game. Players need to predict where and how the opponents will strike in order to best defend themselves. Conversely, assessing how the opponents will defend themselves is crucial to mounting a successful attack while exploiting the vulnerabilities in the opponent's defence strategy. In this context, to be truly adaptable, computer-controlled players need to recognize their opponents' behaviour, their goals, and their plans to achieve those goals. In this paper we analyze the algorithmic challenges behind behaviour recognition in RTS games and discuss a generic RTS behaviour recognition system that we are developing to address those challenges. The application domain is that of RTS games, but many of the key points we discuss also apply to other video game genres such as multiplayer first person shooter (FPS) games.