DeepAI AI Chat
Log In Sign Up

Predicting opponent team activity in a RoboCup environment

by   Selene Baez, et al.

The goal of this project is to predict the opponent's configuration in a RoboCup SSL environment. For simplicity, a Markov model assumption is made such that the predicted formation of the opponent team only depends on its current formation. The field is divided into a grid and a robot state per player is created with information about its position and its velocity. To gather a more general sense of what the opposing team is doing, the state also incorporates the team's average position (centroid). All possible state transitions are stored in a hash table that requires minimum storage space. The table is populated with transition probabilities that are learned by reading vision packages and counting the state transitions regardless of the specific robot player. Therefore, the computation during the game is reduced to interpreting a given vision package to assign each player to a state, and looking for the most likely state it will transition to. The confidence of the predicted team's formation is the product of each individual player's probability. The project is noteworthy in that it minimizes the time and space complexity requirements for opponent's moves prediction.


page 4

page 13

page 14

page 15


A Rotating Proposer Mechanism for Team Formation

We present a rotating proposer mechanism for team formation, which imple...

Robust 3D Distributed Formation Control with Application to Quadrotors

We present a distributed control strategy for a team of quadrotors to au...

Individual and Collective Performance Deteriorate in a New Team: A Case Study of CS:GO Tournaments

How does the team formation relates to team performance in professional ...

Using Machine Learning to Predict the Outcome of English County twenty over Cricket Matches

Cricket betting is a multi-billion dollar market. Therefore, there is a ...

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard

We prove PSPACE-completeness of two classic types of Chess problems when...

A Local Approach to Forward Model Learning: Results on the Game of Life Game

This paper investigates the effect of learning a forward model on the pe...

Prediction with directed transitions: complex eigenstructure, grid cells and phase coding

Markovian tasks can be characterised by a state space and a transition m...