Learning of cooperative behaviour in robot populations

Abstract

This paper addresses convergence and equilibrium properties of game theoretic learning algorithms in robot populations using simple and broadly applicable reward/cost models of cooperation between robotic agents. New models for robot cooperation are proposed by combining regret based learning methods and network evolution models. Results of mean-field game theory are employed in order to show the asymptotic second moment boundedness in the variation of cooperative behaviour. The behaviour of the proposed models are tested in simulation results, which are based on sample networks and a single lane traffic flow case study.