Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s10514-016-9577-x
Accepted author manuscript, 6.04 MB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Avoiding target congestion on the navigation of robotic swarms
AU - Soriano Marcolino, Leandro
AU - Tavares Dos Passos, Yuri
AU - de Souza, Álvaro Antônio Fonseca
AU - Rodrigues, Andersoney dos Santos
AU - Chaimowicz, Luiz
N1 - The final publication is available at Springer via http://dx.doi.org/10.1007/s10514-016-9577-x
PY - 2017/8
Y1 - 2017/8
N2 - Robotic swarms are decentralized systems formed by a large number of robots. A common problem encountered in a swarm is congestion, as a great number of robots often must move towards the same region. This happens when robots have a common target, for example during foraging or waypoint navigation. We propose three algorithms to alleviate congestion: in the first, some robots stop moving towards the target for a random number of iterations; in the second, we divide the scenario in two regions: one for the robots that are moving towards the target, and another for the robots that are leaving the target; in the third, we combine the two previous algorithms. We evaluate our algorithms in simulation, where we show that all of them effectively improve navigation. Moreover, we perform an experimental analysis in the real world with ten robots, and show that all our approaches improve navigation with statistical significance.
AB - Robotic swarms are decentralized systems formed by a large number of robots. A common problem encountered in a swarm is congestion, as a great number of robots often must move towards the same region. This happens when robots have a common target, for example during foraging or waypoint navigation. We propose three algorithms to alleviate congestion: in the first, some robots stop moving towards the target for a random number of iterations; in the second, we divide the scenario in two regions: one for the robots that are moving towards the target, and another for the robots that are leaving the target; in the third, we combine the two previous algorithms. We evaluate our algorithms in simulation, where we show that all of them effectively improve navigation. Moreover, we perform an experimental analysis in the real world with ten robots, and show that all our approaches improve navigation with statistical significance.
KW - Robotic swarms
KW - Traffic control
KW - Navigation
KW - Distributed coordination
U2 - 10.1007/s10514-016-9577-x
DO - 10.1007/s10514-016-9577-x
M3 - Journal article
VL - 41
SP - 1297
EP - 1320
JO - Autonomous Robots
JF - Autonomous Robots
SN - 0929-5593
IS - 6
ER -