A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. This work proposes two measures for evaluating the access efficiency of a common target area as the number of robots in the swarm rises: the maximum target area throughput and its maximum asymptotic throughput. Both are always finite as the number of robots grows, in contrast to the arrival time at the target per number of robots that tends to infinity. Using them, one can analytically compare the effectiveness of different algorithms. In particular, three different theoretical strategies proposed and formally evaluated for reaching a circular target area: (i) forming parallel queues towards the target area, (ii) forming a hexagonal packing through a corridor going to the target, and (iii) making multiple curved trajectories towards the boundary of the target area. The maximum throughput and the maximum asymptotic throughput (or bounds for it) for these strategies are calculated, and these results are corroborated by simulations. The key contribution is not the proposal of new algorithms to alleviate congestion but a fundamental theoretical study of the congestion problem in swarm robotics when the target area is shared.
A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. For solving that efficiently, robots must execute decentralised traffic control algorithms. In this work, we propose a measure for evaluating the access efficiency of a common target area as the number of robots in the swarm rises: the common target area throughput. We also employ here the target area asymptotic throughput — that is, the throughput of a target region with a limited area as the time tends to infinity — because it is always finite as the number of robots grows, opposed to the relation arrival time at the target per number of robots that tends to infinity. Using this measure, we can analytically compare the effectiveness of different algorithms. In particular, we propose and formally evaluate three different theoretical strategies for getting to a circular target area: (i) forming parallel queues towards the target area, (ii) forming a hexagonal packing through a corridor going to the target, and (iii) making multiple curved trajectories towards the boundary of the target area. We calculate the throughput for a fixed time and the asymptotic throughput for these strategies. Additionally, we corroborate these results by simulations, showing that when a strategy has higher throughput, its arrival time per number of robots is lower. Thus, we conclude that using throughput is well suited for comparing congestion algorithms for a common target area in robotic swarms even if we do not have their closed asymptotic equation.
Coordination algorithms are required to minimise congestion when every robot in a robotic swarm has a common target area to visit. Some of these algorithms use artificial potential fields to enable path planning to become distributed and local. An efficiency measure for comparing them is the time to complete a task in relation to the number of individuals in the swarm. To compare distinct solutions as the swarm grows, experiments with different numbers of robots must be simulated to form a plot of the function of the task completion time versus the number of robots or other parameters. Nevertheless, plotting it for many robots through simulation is time-consuming. Additionally, the inference of a global swarm behaviour as the task completion time from the local individual robot motion controller based on potential fields and other dynamical variables is intractable and requires experimental analysis. Based on that, equations are presented and compared with simulation data for estimating the expected task completion time of state-of-the-art algorithms, robots using only attractive and repulsive force fields and mixed teams for the common target area problem in robotic swarms with not only the number of robots as input but also environment- and algorithm-related global variables, such as the size of the common target area and the working area, average speed and average distance between the robots. This paper is a fundamental first step to start a discussion on how better approximations can be achieved and which mathematical theories about local-to-global analysis are better suited to this problem.