A Fast Generation Algorithm of Communication Topology for Three-dimensional Optimally Persistent Formation

To solve the communication topology generation problem of three-dimensional optimally persistent formation with leader constraint, a fast generation algorithm based on minimum cost arborescence, arc addition and path reverse operation is proposed. Compared with the existing algorithms, this algorithm has a shorter calculation time. Finally, the simulation results further verify the correctness and effectiveness of the algorithm.