Distributed Localization in Dynamic Networks via Complex Laplacian
Different from most existing distributed localization approaches in static networks where the agents in a network are static, this paper addresses the distributed localization problem in dynamic networks where the positions of the agents are time-varying. Firstly, complex constraints for the positions of the agents are constructed based on local relative position (distance and local bearing) measurements. Secondly, both algebraic condition and graph condition of network localizability in dynamic networks are given. Thirdly, a distributed localization protocol is proposed such that all the agents can cooperatively find their positions by solving the complex constraints in dynamic networks. Fourthly, the proposed method is extended to address the problem of integrated distributed localization and formation control. It is worth mentioning that the proposed algorithm can also be applied in the case that only distance and sign of direction measurements are available, where the sign of direction measurement is a kind of one bit local relative measurement and has less information than local bearing.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Localization Phenomena in Large-Scale Networked Systems: Robustness and Fragility of Dynamics
We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics …
Distributed Formation Maneuver Control Using Complex Laplacian
This paper studies the problem of distributed formation maneuver control of multi-agent systems via complex Laplacian. We will show how to change the translation, scaling, rotation, and also the shape of formation contin…
Distributed Non-Uniform Scaling Control of Multi-Agent Formation with Dynamic Agent Joining
Non-uniform scaling control of formation enables multi-agent systems to adjust their shape by scaling with different ratios along different coordinate axes, offering enhanced flexibility in complex environments. However,…
Graph Laplacian Diffusion Localization of Connected and Automated Vehicles
In this paper, we design distributed multi-modal localization approaches for Connected and Automated vehicles. We utilize information diffusion on graphs formed by moving vehicles, based on Adapt-then-Combine strategies …
Autonomous DrivingImproved large-scale graph learning through ridge spectral sparsification
Graph-based techniques and spectral graph theory have enriched the field of machine learning with a variety of critical advances. A central object in the analysis is the graph Laplacian L, which encodes the structure of …
Graph Learning