Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes
From MaRDI portal
Publication:4569676
DOI10.1109/TSP.2009.2014812zbMath1391.94268arXiv0802.3563MaRDI QIDQ4569676
Usman A. Khan, José M. F. Moura, Soummya Kar
Publication date: 9 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.3563
Related Items (15)
A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW) ⋮ Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions ⋮ Reprint of ``A distributed algorithm for efficiently solving linear equations and its applications (Special issue JCW) ⋮ Primal-dual algorithm for distributed constrained optimization ⋮ A new distributed Kalman filtering based on mean-square estimation upper bounds ⋮ Containment control of multi-agent systems by exploiting the control inputs of neighbors ⋮ A survey on distributed network localization from a graph Laplacian perspective ⋮ Distributed localization in dynamic networks via complex Laplacian ⋮ On the internal stability of diffusively coupled multi-agent systems and the dangers of cancel culture ⋮ Asynchronous distributed localization in networks with communication delays and packet losses ⋮ Distributed localization with mixed measurements under switching topologies ⋮ Graph-balancing algorithms for average consensus over directed networks ⋮ Neighborhood Kalman estimation for distributed localization in wireless sensor networks ⋮ Bearing-only distributed localization: a unified barycentric approach ⋮ Distributed weighted least-squares estimation with fast convergence for large-scale systems
This page was built for publication: Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes
