Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Distributed swarm collision avoidance based on angular calculations

Distributed swarm collision avoidance based on angular calculations Collision avoidance is one of the most important topics in the robotics field. In this problem, the goal is to move the robots from initial locations to target locations such that they follow the shortest non-colliding paths in the shortest time and with the least amount of energy. Robot navigation among pedestrians is an example application of this problem which is the focus of this paper. This paper presents a distributed and real-time algorithm for solving collision avoidance problems in dense and complex 2D and 3D environments. This algorithm uses angular calculations to select the optimal direction for the movement of each robot and it has been shown that these separate calculations lead to a form of cooperative behavior among agents. We evaluated the proposed approach on various simulation and experimental scenarios and compared the results with ORCA one of the most important algorithms in this field. The results show that the proposed approach is at least 25% faster than ORCA while is also more reliable. The proposed method is shown to enable fully autonomous navigation of a swarm of Crazyflies. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Autonomous Robots Springer Journals

Distributed swarm collision avoidance based on angular calculations

Download PDF
10 pages

Loading next page...
 
/lp/springer-journals/distributed-swarm-collision-avoidance-based-on-angular-calculations-KQvx1Ws1CP

References (30)

Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
ISSN
0929-5593
eISSN
1573-7527
DOI
10.1007/s10514-022-10081-6
Publisher site
See Article on Publisher Site

Abstract

Collision avoidance is one of the most important topics in the robotics field. In this problem, the goal is to move the robots from initial locations to target locations such that they follow the shortest non-colliding paths in the shortest time and with the least amount of energy. Robot navigation among pedestrians is an example application of this problem which is the focus of this paper. This paper presents a distributed and real-time algorithm for solving collision avoidance problems in dense and complex 2D and 3D environments. This algorithm uses angular calculations to select the optimal direction for the movement of each robot and it has been shown that these separate calculations lead to a form of cooperative behavior among agents. We evaluated the proposed approach on various simulation and experimental scenarios and compared the results with ORCA one of the most important algorithms in this field. The results show that the proposed approach is at least 25% faster than ORCA while is also more reliable. The proposed method is shown to enable fully autonomous navigation of a swarm of Crazyflies.

Journal

Autonomous Robots – Springer Journals

Published: Apr 1, 2023

Keywords: Collision avoidance; Motion planning; Multi-robot systems; Swarm intelligence; Distributed algorithms

There are no references for this article.