Tandem Running Algorithm with Route Selection

Abstract

This article examines the problem of choosing the optimal route by a swarm of robots controlled by the tandem running algorithm. It is proven that in the case of using the tandem running algorithm, only a partial selection of the optimal route can be made by a swarm of robots, which is due to the impossibility of spreading new information among experienced robots. To ensure the possibility of effective selection of the optimal route by a swarm of robots, a tandem running algorithm with route selection was proposed. During computer simulation, it was shown that the proposed tandem running algorithm with route selection is efficient and does not depend either on the time interval between the appearance of alternative routes, or on the presence of a significant difference in the duration of alternative routes.