The conflict resolution problem in cooperative unmanned aerial vehicle (UAV) clusters sharing a three-dimensional airspace with increasing air traffic density is very important. This paper innovatively solves this problem by employing the complex network (CN) algorithm. The proposed approach allows a UAV to perform only one maneuver-that of the flight level change. The novel UAV conflict resolution is divided into two steps, corresponding to the key node selection (KS) algorithm based on the node contraction method and the sense selection (SS) algorithm based on an objective function. The efficiency of the cooperative multi-UAV collision avoidance (CA) system improved a lot due to the simple two-step collision avoidance logic. The paper compares the difference between random selection and the use of the node contraction method to select key nodes. Experiments showed that using the node contraction method to select key nodes can make the collision avoidance effect of UAVs better. The CA maneuver was validated with quantitative simulation experiments, demonstrating advantages such as minimal cost when considering the robustness of the global traffic situation, as well as significant real-time and high efficiency. The CN algorithm requires a relatively small computing time that renders the approach highly suitable for solving real-life operational situations.
CITATION STYLE
Huang, Y., Tang, J., & Lao, S. (2019). Cooperative multi-UAV collision avoidance based on a complex network. Applied Sciences (Switzerland), 9(19). https://doi.org/10.3390/app9193943
Mendeley helps you to discover research relevant for your work.