Formation Maneuver Control Based on the Augmented Laplacian Method
Xinzhe Zhou, Xuyang Wang, Xiaoming Duan, Yuzhu Bai, Jianping He
TL;DR
The paper addresses the problem of formation maneuver control in 2-D and 3-D spaces, enabling simultaneous translation, scaling, and rotation with arbitrary orientation while preserving the formation's intrinsic configuration. It introduces an augmented Laplacian with matrix-valued edge weights that commute with rotation, along with rotation-axis adjustment and dynamic agent reconfiguration to achieve flexible, scalable maneuvers. Key contributions include a constructive weight design $w_{ij} = a_{ij} I_d + b_{ij} \zeta\zeta^T + c_{ij} \zeta^{\times}$, proofs that target formations remain in $\ker(W)$ during maneuvers, and leader/follower control laws with Lyapunov guarantees; plus a demonstrated link to the 2-D complex Laplacian as a special case. Practical impact lies in reduced neighbor requirements, applicability to arbitrary orientation rotations, and seamless joining of new agents, with validations via 2-D and 3-D simulations.
Abstract
This paper proposes a novel formation maneuver control method for both 2-D and 3-D space, which enables the formation to translate, scale, and rotate with arbitrary orientation. The core innovation is the novel design of weights in the proposed augmented Laplacian matrix. Instead of using scalars, we represent weights as matrices, which are designed based on a specified rotation axis and allow the formation to perform rotation in 3-D space. To further improve the flexibility and scalability of the formation, the rotational axis adjustment approach and dynamic agent reconfiguration method are developed, allowing formations to rotate around arbitrary axes in 3-D space and new agents to join the formation. Theoretical analysis is provided to show that the proposed approach preserves the original configuration of the formation. The proposed method maintains the advantages of the complex Laplacian-based method, including reduced neighbor requirements and no reliance on generic or convex nominal configurations, while achieving arbitrary orientation rotations via a more simplified implementation. Simulations in both 2-D and 3-D space validate the effectiveness of the proposed method.
