On Modelling of Autonomous Cooperative Robotics in Monoidal Category of Binary Relations

The game theoretical approach is applied to cooperative robotics simulation. Robots’ team is regarded as a multiagent system. Robots are universal intellectual players that might maximize their preferences and relations. Acting autonomously, they are to service the given set of requirements submitted to some precedence relation. To achieve this, robots use information exchange to build optimal communications networks on the base of natural coalitions. The latter is the result of their rational strategies application. The agents’ activity leans on a distributed algorithm to find an optimal scheduling. Relational Bellman’s method contributes to the search for an equilibrium of the game. The approach to cooperative robotics admits scalable realization due to the polynomial complexity of the algorithm.