Online Distributed Trajectory Planning for Quadrotor Swarm With Feasibility Guarantee Using Linear Safe Corridor
Top Cited Papers
- 22 February 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (2) , 4869-4876
Abstract
This letter presents a new online multi-agent trajectory planning algorithm that guarantees to generate safe, dynamically feasible trajectories in a cluttered environment. The proposed algorithm utilizes a linear safe corridor (LSC) to formulate the distributed trajectory optimization problem with only feasible constraints, so it does not resort to slack variables or soft constraints to avoid optimization failure. We adopt a priority-based goal planning method to prevent the deadlock without an additional procedure to decide which robot to yield. The proposed algorithm can compute the trajectories for 60 agents on average 15.5 ms per agent with an Intel i7 laptop and shows a similar flight distance and distance compared to the baselines based on soft constraints. We verified that the proposed method can reach the goal without deadlock in both the random forest and the indoor space, and we validated the safety and operability of the proposed algorithm through a real flight test with ten quadrotors in a maze-like environment.Keywords
All Related Versions
Funding Information
- Institute of Information & Communications Technology Planning & Evaluation
- Korea government (2019-0-00399)
This publication has 25 references indexed in Scilit:
- Fast, On-line Collision Avoidance for Dynamic Vehicles Using Buffered Voronoi CellsIEEE Robotics and Automation Letters, 2017
- Safe and complete trajectory generation for robot teams with higher-order dynamics2016
- Conflict-based search for optimal multi-agent pathfindingArtificial Intelligence, 2015
- OctoMap: an efficient probabilistic 3D mapping framework based on octreesAutonomous Robots, 2013
- Decentralized path planning for multi-agent teams with complex constraintsAutonomous Robots, 2012
- Minimum snap trajectory generation and control for quadrotors2011
- Reciprocal n-Body Collision Avoidance2011
- Decentralized collision avoidance, deadlock detection, and deadlock resolution for multiple mobile robots2002
- Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansionIEEE Transactions on Automatic Control, 1998
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988