Pages that link to "Item:Q4569676"
From MaRDI portal
The following pages link to Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes (Q4569676):
Displaying 15 items.
- A distributed algorithm for efficiently solving linear equations and its applications (special issue JCW) (Q274283) (← links)
- Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions (Q286331) (← links)
- Reprint of ``A distributed algorithm for efficiently solving linear equations and its applications (Special issue JCW)'' (Q305624) (← links)
- Primal-dual algorithm for distributed constrained optimization (Q325079) (← links)
- Distributed localization with mixed measurements under switching topologies (Q503179) (← links)
- A new distributed Kalman filtering based on mean-square estimation upper bounds (Q1648031) (← links)
- Asynchronous distributed localization in networks with communication delays and packet losses (Q1716451) (← links)
- Neighborhood Kalman estimation for distributed localization in wireless sensor networks (Q1792852) (← links)
- Bearing-only distributed localization: a unified barycentric approach (Q2065169) (← links)
- Distributed weighted least-squares estimation with fast convergence for large-scale systems (Q2342507) (← links)
- Graph-balancing algorithms for average consensus over directed networks (Q2795120) (← links)
- Containment control of multi-agent systems by exploiting the control inputs of neighbors (Q2935235) (← links)
- A survey on distributed network localization from a graph Laplacian perspective (Q6130966) (← links)
- Distributed localization in dynamic networks via complex Laplacian (Q6164025) (← links)
- On the internal stability of diffusively coupled multi-agent systems and the dangers of cancel culture (Q6165334) (← links)