Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.18135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909510515294208 |
|---|---|
| author | Larsson, Martin Larsson, Viktor Åström, Kalle Oskarsson, Magnus |
| author_facet | Larsson, Martin Larsson, Viktor Åström, Kalle Oskarsson, Magnus |
| contents | This paper introduces a novel method for solving the single-source localization problem, specifically addressing the case of trilateration. We formulate the problem as a weighted least-squares problem in the squared distances and demonstrate how suitable weights are chosen to accommodate different noise distributions. By transforming this formulation into an eigenvalue problem, we leverage existing eigensolvers to achieve a fast, numerically stable, and easily implemented solver. Furthermore, our theoretical analysis establishes that the globally optimal solution corresponds to the largest real eigenvalue, drawing parallels to the existing literature on the trust-region subproblem. Unlike previous works, we give special treatment to degenerate cases, where multiple and possibly infinitely many solutions exist. We provide a geometric interpretation of the solution sets and design the proposed method to handle these cases gracefully. Finally, we validate against a range of state-of-the-art methods using synthetic and real data, demonstrating how the proposed method is among the fastest and most numerically stable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_18135 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Single-Source Localization as an Eigenvalue Problem Larsson, Martin Larsson, Viktor Åström, Kalle Oskarsson, Magnus Optimization and Control 51K05 This paper introduces a novel method for solving the single-source localization problem, specifically addressing the case of trilateration. We formulate the problem as a weighted least-squares problem in the squared distances and demonstrate how suitable weights are chosen to accommodate different noise distributions. By transforming this formulation into an eigenvalue problem, we leverage existing eigensolvers to achieve a fast, numerically stable, and easily implemented solver. Furthermore, our theoretical analysis establishes that the globally optimal solution corresponds to the largest real eigenvalue, drawing parallels to the existing literature on the trust-region subproblem. Unlike previous works, we give special treatment to degenerate cases, where multiple and possibly infinitely many solutions exist. We provide a geometric interpretation of the solution sets and design the proposed method to handle these cases gracefully. Finally, we validate against a range of state-of-the-art methods using synthetic and real data, demonstrating how the proposed method is among the fastest and most numerically stable. |
| title | Single-Source Localization as an Eigenvalue Problem |
| topic | Optimization and Control 51K05 |
| url | https://arxiv.org/abs/2502.18135 |