Ant Algorithm with Mutual Exclusion

This work investigates the possibility of using the ant algorithm to control the work of a swarm of robots in the conditions of the need for their close interaction and coordination of the movement of robots in the absence of communication between them. The main limitations for the implementation of the adapted ant algorithm were shown and ways to overcome them were proposed. By computer simulation, it has been shown that the proposed ant algorithm with mutual exclusion can be successfully used to control a swarm of robots. It is shown that in the absence of a large number of collisions, instead of the ant algorithm with mutual exclusion for modeling the behavior of a swarm of robots, in the conditions of the need for close interaction and coordination of the movement of robots in the absence of communication between them, the original adapted ant algorithm can be used.