Location-Based Reasoning about Complex Multi-Agent Behavior

Abstract

Recent research has shown that surprisingly rich models of human activity can be learned from GPS (positional) data. However, most effort to date has concentrated on modeling single individuals or statistical properties of groups of people. Moreover, prior work focused solely on modeling actual successful executions (and not failed or attempted executions) of the activities of interest. We, in contrast, take on the task of understanding human interactions, attempted interactions, and intentions from noisy sensor data in a fully relational multi-agent setting. We use a real-world game of capture the flag to illustrate our approach in a well-defined domain that involves many distinct cooperative and competitive joint activities. We model the domain using Markov logic, a statistical-relational language, and learn a theory that jointly denoises the data and infers occurrences of high-level activities, such as a player capturing an enemy. Our unified model combines constraints imposed by the geometry of the game area, the motion model of the players, and by the rules and dynamics of the game in a probabilistically and logically sound fashion. We show that while it may be impossible to directly detect a multi-agent activity due to sensor noise or malfunction, the occurrence of the activity can still be inferred by considering both its impact on the future behaviors of the people involved as well as the events that could have preceded it. Further, we show that given a model of successfully performed multi-agent activities, along with a set of examples of failed attempts at the same activities, our system automatically learns an augmented model that is capable of recognizing success and failure, as well as goals of people's actions with high accuracy. We compare our approach with other alternatives and show that our unified model, which takes into account not only relationships among individual players, but also relationships among activities over the entire length of a game, although more computationally costly, is significantly more accurate. Finally, we demonstrate that explicitly modeling unsuccessful attempts boosts performance on other important recognition tasks.

Probabilistic Event Calculus for Event Recognition

“…Furthermore, we would like to address the problems that involve numerical constraints by adopting a hybrid-MLN (e.g. Sadilek and Kautz [2012]) or a similar approach. We also consider extending our formalism in order to support temporal interval relations, using preprocessing techniques (e.g.…”

Fast care – real-time sensor data analysis framework for intelligent assistance systems

“…These methods are capable of determining both the current situation as well as possible courses of action and goals, and are not dependent on direct and error-free observations, which cannot be provided by real-world sensor hardware. By the combination of complex descriptions of the environment and permitted courses of activities with probabilistic inference methods this gap could be overcome in some works [8,9,10] using position data. In [11] it was shown furthermore, that, using Computational Causal Behavior Models (CCBM), this is also possible with wearable sensors.…”

Hierarchical Goal Recognition

“…A number of projects in ubiquitous computing [2,25,29] have gathered raw data of a user's state over time (location and speed from GPS data), which they use to predict user activity. These represent very low-level data, however, that is not immediately compatible with the intentional action streams that most plan recognizers take as input.…”