Distributed Swarm Collision Avoidance Based on Angular Calculations
Not on the map. Why?
Abstract (arXiv)
Collision avoidance is one of the most important topics in the robotics field. The goal is to move the robots from initial locations to target locations such that they follow shortest non-colliding paths in the shortest time and with the least amount of energy. In this paper, a distributed and real-time algorithm for dense and complex 2D and 3D environments is proposed. 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 FMP and ORCA, two important algorithms in this field. The results show that the proposed approach is at least 25% faster than ORCA and at least 7% faster than FMP and also more reliable than both methods. The proposed method is shown to enable fully autonomous navigation of a swarm of crazyflies.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 30 references that are in the map. First posted on arXiv 29 Aug 2021.
Builds on
6 of 30 references.
References · 6
- 2017Towards Optimally Decentralized Multi-Robot Collision Avoidance via Deep Reinforcement Learningcited by 81
- 2018A Scalable Framework For Real-Time Multi-Robot, Multi-Human Collision Avoidancecited by 10
- 2018Trajectory Generation for Multiagent Point-To-Point Transitions via Distributed Model Predictive Controlcited by 4
- 2019Force-based Algorithm for Motion Planning of Large Agent Teamscited by 4
- 2020Realtime Collision Avoidance for Mobile Robots in Dense Crowds using Implicit Multi-sensor Fusion and Deep Reinforcement Learningcited by 4
- 2020Swarm Formation Morphing for Congestion Aware Collision Avoidancecited by 1
Built on by
Not cited yet.