Abstract:
In this paper, we introduce a method for finding a tight formation of unmanned air vehicles (UAVs) via the classical sphere packing scheme. We first translate the tight f...Show MoreMetadata
Abstract:
In this paper, we introduce a method for finding a tight formation of unmanned air vehicles (UAVs) via the classical sphere packing scheme. We first translate the tight formation finding problem to the problem of maximizing the second smallest eigenvalue λ2(G) of the graph Laplacian LG. We then show how close the formation Gs obtained from the sphere packing scheme is to the optimal formation G* that maximizes λ2(G). We show that λ2(G*)/λ2(Gs) is relatively small when the communication strength between two UAVs decays slowly with the distance between the two UAVs. This result implies that Gs can serve as a certificate that allows every graph to be quantitatively compared to G*. In the light of this tight formation result, a modelling technique is given for the optimal airborne refuelling of multiple UAVs.
Published in: 2007 American Control Conference
Date of Conference: 09-13 July 2007
Date Added to IEEE Xplore: 30 July 2007
ISBN Information: