Benchmarking robot cooperation without pre-coordination in the RoboCup Standard Platform League drop-in player competition

Abstract — The Standard Platform League is one of the main competitions of the annual RoboCup world championships. In this competition, teams of five humanoid robots play soccer against each other. In 2014, the league added a new sub-competition which serves as a testbed for cooperation without pre-coordination: the Drop-in Player Competition. Instead of homogeneous robot teams that are each programmed by the same people and hence implicitly pre-coordinated, this competition features ad hoc teams, i. e. teams that consist of robots originating from different RoboCup teams and that are each running different software. In this paper, we provide an overview of this competition, including its motivation and rules. We then present and analyze the results of the 2014 competition, which gathered robots from 23 teams, involved at least 50 human participants, and consisted of fifteen 20-minute games for a total playing time of 300 minutes. We also suggest improvements for future iterations, many of which will be evaluated at RoboCup 2015. I

Modeling Mutual Capabilities in Heterogeneous Teams for Role Assignment

The performance of a heterogeneous team depends critically on the composition of its members, and switching out one member for another can make a drastic difference. The capabilities of an agent depends not only on its individual characteristics, but also the interactions with its teammates. Roles are typically assigned to individual agents in such a team, where each role is responsible for a certain aspect of the joint team goal. In this paper, we focus on role assignment in a heterogeneous team, where an agent's capability depends on its teammate and their mutual state, i.e., the agent's state and its teammate's state. The capabilities of an agent are represented by a mean and variance, to capture the uncertainty in the agent's actions and in the world. We present a formal framework for representing this problem, and illustrate our framework using a robot soccer example. We formally describe how to compute the value of a role assignment policy, as well as the computation of the optimal role assignment policy, using a notion of risk. Further, we show that finding the optimal role assignment can be difficult, and describe approximation algorithms that can be used to solve this problem. We provide an analysis of these algorithms in our model and empirically show that they perform well in general problems of this domain, compared to market-based techniques. Lastly, we describe an extension to our proposed model that captures mutual interactions between more than two agents</p

Modeling Mutual Capabilities in Heterogeneous Teams for Role Assignment

Abstract — The performance of a heterogeneous team depends critically on the composition of its members, and switching out one member for another can make a drastic difference. The capabilities of an agent depends not only on its individual characteristics, but also the interactions with its teammates. Roles are typically assigned to individual agents in such a team, where each role is responsible for a certain aspect of the joint team goal. In this paper, we focus on role assignment in a heterogeneous team, where an agent’s capability depends on its teammate and their mutual state, i.e., the agent’s state and its teammate’s state. The capabilities of an agent are represented by a mean and variance, to capture the uncertainty in the agent’s actions and in the world. We present a formal framework for representing this problem, and illustrate our framework using a robot soccer example. We formally describe how to compute the value of a role assignment policy, as well as the computation of the optimal role assignment policy, using a notion of risk. Further, we show that finding the optimal role assignment can be difficult, and describe approximation algorithms that can be used to solve this problem. We provide an analysis of these algorithms in our model and empirically show that they perform well in general problems of this domain, compared to market-based techniques. Lastly, we describe an extension to our proposed model that captures mutual interactions between more than two agents. I