An algorithm for drawing general undirected graphs
Information Processing Letters
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Control of Minimally Persistent Formations in the Plane
SIAM Journal on Control and Optimization
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
IEEE Transactions on Robotics
Input-to-state stability for discrete-time nonlinear systems
Automatica (Journal of IFAC)
Formation control of mobile agents based on inter-agent distance dynamics
Automatica (Journal of IFAC)
Connectivity preservation for multi-agent rendezvous with link failure
Automatica (Journal of IFAC)
Hi-index | 22.15 |
This paper proposes a simple, distributed algorithm that achieves global stabilization of formations for relative sensing networks in arbitrary dimensions with fixed topology. Assuming the network runs an initialization procedure to equally orient all agent reference frames, convergence to the desired formation shape is guaranteed even in partially asynchronous settings. We characterize the algorithm robustness against several sources of errors: link failures, measurement errors, and frame initialization errors. The technical approach combines algebraic graph theory, multidimensional scaling, and distributed linear iterations.