A distributed continuous-time algorithm for network localization using angle-of-arrival information

DOI10.1016/j.automatica.2013.09.033zbMath1298.93047OpenAlexW2071083687MaRDI QIDQ463784

Guangwei Zhu, Jianghai Hu

Publication date: 17 October 2014

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.09.033

zbMATH Keywords

switching networksposition estimationgraph-theoretic modelssensor systems

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)

Related Items (8)

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) ⋮ Distributed bearing‐based formation control and network localization with exogenous disturbances ⋮ Distributed localization with mixed measurements under switching topologies ⋮ Collision avoidance cooperative attack with multiple pursuers based on bearing-only measurements ⋮ Distributed bearing vector estimation in multi-agent networks ⋮ Bearing-only distributed localization: a unified barycentric approach

Cites Work

• Unnamed Item
• Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
• Nonlinear systems. Analysis, stability, and control
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays

This page was built for publication: A distributed continuous-time algorithm for network localization using angle-of-arrival information