Robust Multi-robot Team Formations Using Weighted Voting Games
نویسندگان
چکیده
We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without explicit knowledge of global features such as the presence of obstacles in the environment or the number and location of all other robots in the system. It uses the locally computed metrics of each robot in the team to determine whether a team needs to split or two teams need to merge during reconfiguration. We have tested team reconfiguration using the DYN-REFORM algorithm experimentally within the Webots simulator using teams of e-puck robots of different sizes and with different obstacle geometries. We have also shown that using robots coordinated with the DYN-REFORM algorithm for a distributed area-coverage application improves the coverage performance.1
منابع مشابه
Task Decomposition and Dynamic Role Assignment for Real-Time Strategic Teamwork
Multi-agent domains consisting of teams of agents that need to collaborate in an adversarial environment offer challenging research opportunities. In this paper, we introduce periodic team synchronization domains, as time-critical environments in which agents act autonomously with limited communication, but they can periodically synchronize in a full-communication setting. We present a team age...
متن کاملAlgorithmic Foundation of the Clockwork Orange Robot Soccer Team
The Dutch robot soccer team Clockwork Orange is a research project of the Delft University of Technology and the University of Amsterdam. In this project we study multi-robot collaboration, robot vision and robot control. Our research focus, overviewed in this paper, is on automatic calibration for robust colour segmentation, behaviour based robotics, reinforcement trained dribbling with the ba...
متن کاملSome Advances in the Theory of Voting Systems Based on Experimental Algorithms
In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades among voters in sets of coalitions. The fundamental theorem by Taylor and Zwicker [8] establishes the equivalence between weighted voting games and k-trade robust games for each ...
متن کاملA Search-based Approach to Annexation and Merging in Weighted Voting Games
Weighted voting games are classic cooperative games which provide a compact representation for coalition formation models in multiagent systems. We consider manipulation in weighted voting games via annexation and merging, which involves an agent or some agents misrepresenting their identities in anticipation of gaining more power at the expense of other agents in a game. We show that annexatio...
متن کاملComplexity of comparison of influence of players in simple games
Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The possible representations of simple games considered are simple games represented by winning coalitions, minimal winning coalitions, weighted voting game or a multip...
متن کامل