Adaptation of the Tandem Running Algorithm to Control a Robot Swarm

Abstract

In the work the prospects for using the tandem running algorithm to control a robot swarm is studied. The main advantages and disadvantages of the tandem running algorithm were highlighted, which determine the potential scope of its application. With the help of computer simulations, it was proved that the tandem running algorithm, although it is inferior in speed to the adaptive ant algorithm, allows information to be spread among all members of the swarm. It is shown that the algorithm of tandem running is most expedient to use in the case of the need to mobilize a small number of robots that have to carry out a small number of raids.