Energy-Efficient Post-Failure Reconfiguration of Swarms of Unmanned Aerial Vehicles

15Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, the reconfiguration of swarms of unmanned aerial vehicles after simultaneous failures of multiple nodes is considered. The objectives of the post-failure reconfiguration are to provide collision avoidance and smooth energy-efficient movement. To incorporate such a mechanism, three different failure recovery algorithms are proposed namely thin plate spline, distance- and time-optimal algorithms. These methods are tested on six swarms, with two variations on failing nodes for each swarm. Simulation results of reconfiguration show that the execution of such algorithms maintains the desired formations with respect to avoiding collisions at run-time. Also, the results show the effectiveness concerning the distance travelled, kinetic energy, and energy efficiency. As expected, the distance-optimal algorithm gives the shortest movements, and the time-optimal algorithm gives the most energy-efficient movements. The thin plate spline is also found to be energy-efficient and has less computational cost than the other two proposed methods. Despite the suggested heuristics, these are combinatorial in nature and might be hard to use in practice. Furthermore, the use of the regularization parameter λ in thin plate spline is also investigated, and it is found that too large values on λ can lead to incorrect locations, including multiple nodes on the same location. In fact, it is found that using λ = 0 worked well in all cases.

Cite

CITATION STYLE

APA

Tahir, A., Haghbayan, H., Boling, J. M., & Plosila, J. (2023). Energy-Efficient Post-Failure Reconfiguration of Swarms of Unmanned Aerial Vehicles. IEEE Access, 11, 24768–24779. https://doi.org/10.1109/ACCESS.2022.3181244

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free