Distributed Localization in Dynamic Networks via Complex Laplacian

Abstract

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.

References in corpus (5)

• Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes
• Angle-Displacement Rigidity Theory with Application to Distributed Network Localization
• Graph Optimization Approach to Range-based Localization
• 3-D Distributed Localization with Mixed Local Relative Measurements
• Distributed formation maneuver control by manipulating the complex Laplacian

Cited by in corpus (4)

• Distributed Formation Maneuver Control Using Complex Laplacian
• Integrated Relative-Measurement-Based Network Localization and Formation Maneuver Control (Extended Version)
• Angle-Constrained Formation Control under Directed Non-Triangulated Sensing Graphs (Extended Version)
• Distance-based Multiple Non-cooperative Ground Target Encirclement for Complex Environments