Subtended angle-based network localization via distributed bearing vector estimation
From MaRDI portal
Cites work
- A bijective proof of a theorem of Knuth
- A distributed continuous-time algorithm for network localization using angle-of-arrival information
- Angle-based shape determination theory of planar graphs with application to formation stabilization
- Bearing Rigidity and Almost Global Bearing-Only Formation Stabilization
- Bearing Rigidity Theory and Its Applications for Control and Estimation of Network Systems: Life Beyond Distance Rigidity
- Bearing-Based Formation Control of A Group of Agents with Leader-First Follower Structure
- Bearing-based reliable cooperative localization for multiagent networks in the presence of malicious measurements
- Distributed bearing vector estimation in multi-agent networks
- Distributed target tracking based on localization with linear time-difference-of-arrival measurements: a delay-tolerant networked estimation approach
- Enclosing a target by nonholonomic mobile robots with bearing-only measurements
- Generalized weak rigidity: theory, and local and global convergence of formations
- Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions
- Planar minimally rigid graphs and pseudo-triangulations
- Rigid graph control architectures for autonomous formations
- Sensor network localization with imprecise distances
- Visually guided ranging from observations of points, lines and curves via an identifier based nonlinear observer
- Wireless sensor network localization techniques
This page was built for publication: Subtended angle-based network localization via distributed bearing vector estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7311923)