Optimization of multi-robot sumo fight simulation by a genetic algorithm to identify dominant robot capabilities

Abstract

This paper analyzes the multirobot sumo fight simulation. This simulation is based on a computational model of several sumo fighters, which physically interact while trying to move the opponent out of the arena (lost fight). The problem is optimized using a genetic algorithm (GA), where the capabilities of not only one particular robot but of all robots simultaneously are improved. In this particular problem setup, the problem definition changes depending on the optimization path, because all robots also get better, competing against each other. The influence of different operators of the GA is investigated and compared. This paper raises the questions, which genetically controlled capabilities (e.g. size, speed) are dominant over time and how they can be identified by a sensitivity analysis using a GA. The results shed light on which parameters are dominant. This experiment typically opens up interesting fields of further research, especially about how to address optimization problems, where the optimization process influences the search space and how to eliminate the factor of randomness.