Loading web-font TeX/Math/Italic
Energy-Efficient Post-Failure Reconfiguration of Swarms of Unmanned Aerial Vehicles | IEEE Journals & Magazine | IEEE Xplore

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


2D Representation of proposed failure recovery procedure.

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 r...Show More

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 \lambda in thin plate spline is also investigated, and it is found that too large values on \lambda can lead to incorrect locations, including multiple nodes on the same location. In fact, it is found that using \lambda = 0 worked well in all cases.
2D Representation of proposed failure recovery procedure.
Published in: IEEE Access ( Volume: 11)
Page(s): 24768 - 24779
Date of Publication: 08 June 2022
Electronic ISSN: 2169-3536

Funding Agency:


References

References is not available for this document.