Globally Optimal Data-Association-Free Landmark-Based Localization Using Semidefinite Relaxations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908477519036416 |
|---|---|
| author | Korotkine, Vassili Cohen, Mitchell Forbes, James Richard |
| author_facet | Korotkine, Vassili Cohen, Mitchell Forbes, James Richard |
| contents | This paper proposes a semidefinite relaxation for landmark-based localization with unknown data associations in planar environments. The proposed method simultaneously solves for the optimal robot states and data associations in a globally optimal fashion. Relative position measurements to known landmarks are used, but the data association is unknown in tha tthe robot does not know which landmark each measurement is generated from. The relaxation is shown to be tight in a majority of cases for moderate noise levels. The proposed algorithm is compared to local Gauss-Newton baselines initialized at the dead-reckoned trajectory, and is shown to significantly improve convergence to the problem's global optimum in simulation and experiment. Accompanying software and supplementary material may be found at https://github.com/decargroup/certifiable_uda_loc . |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_08547 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Globally Optimal Data-Association-Free Landmark-Based Localization Using Semidefinite Relaxations Korotkine, Vassili Cohen, Mitchell Forbes, James Richard Robotics This paper proposes a semidefinite relaxation for landmark-based localization with unknown data associations in planar environments. The proposed method simultaneously solves for the optimal robot states and data associations in a globally optimal fashion. Relative position measurements to known landmarks are used, but the data association is unknown in tha tthe robot does not know which landmark each measurement is generated from. The relaxation is shown to be tight in a majority of cases for moderate noise levels. The proposed algorithm is compared to local Gauss-Newton baselines initialized at the dead-reckoned trajectory, and is shown to significantly improve convergence to the problem's global optimum in simulation and experiment. Accompanying software and supplementary material may be found at https://github.com/decargroup/certifiable_uda_loc . |
| title | Globally Optimal Data-Association-Free Landmark-Based Localization Using Semidefinite Relaxations |
| topic | Robotics |
| url | https://arxiv.org/abs/2504.08547 |