Geometry-Aware Set-Membership Multilateration: Directional Bounds and Anchor Selection
Giuseppe C. Calafiore

TL;DR
This paper introduces a geometry-aware approach for anchor selection in range-based localization, utilizing convex set structures and new scores to improve offline and online uncertainty assessment, with promising numerical results.
Contribution
It develops novel geometry-based scores for anchor selection and provides exact support-function formulas for uncertainty bounds in localization.
Findings
Geometry scores effectively guide anchor selection.
D-score slightly outperforms E-score for area metrics.
H-set-aware certificates closely track actual localization uncertainty.
Abstract
In this paper, we study anchor selection for range-based localization under unknown-but-bounded measurement errors. We start from the convex localization set recently introduced in \cite{CalafioreSIAM}, where is a polyhedron obtained from pairwise differences of squared-range equations between the unknown location and the anchors, and is the intersection of upper-range hyperspheres. Our first goal is \emph{offline} design: we derive geometry-only E- and D-type scores from the centered scatter matrix , where collects the anchor coordinates and is the centering projector, showing that controls worst-direction and diameter surrogates for the polyhedral certificate , while controls principal-axis volume surrogates. Our second goal is \emph{online} uncertainty…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Robotics and Sensor-Based Localization · Stochastic Gradient Optimization Techniques
