Set-Membership Localization and Robust Detection-Point Selection for Interference Sources under Bounded Bearing Errors
DOI:
https://doi.org/10.54691/qme7s978Keywords:
Set-membership Localization; Bearing-only Triangulation; Minimax Robustness; Minimum Enclosing Circle; Detection-point Selection.Abstract
Radio interference degrades spectrum access, and locating the emitter is the geometric core of its removal. This paper treats the bearing error as a known bound and develops a set-membership framework for the first two stages of that task: describing the set of admissible source positions from several bearings, measuring its size by the worst-case localisation diameter, and choosing the next detection point before the source position is known. Each bearing is represented by an angular domain of half-width ε, and the localisation region is the intersection of those domains with the circular target region. That intersection is unbounded exactly when the bearing intervals share a common direction, which for two observations reduces to the analytic test Δθ ≤ 2ε; this replaces the finite bounding box that misclassifies near-degenerate configurations. Closed-form vertices and a rotating-calipers diameter give the region and its diameter in linear time, and the smallest disk containing the region is obtained exactly. The disk spanning the diameter does not always cover the region; Jung's theorem bounds the ratio by 2/√3 = 1.1547, and the bound is attained by an equilateral configuration. The second detection point is chosen by minimax optimisation over both the unknown source position and the unknown sign of the second bearing error, subject to worst-case reception feasibility. The recommended point is S2* = (−399.66, 1484.27) m; it lies on the reception boundary and gives a worst-case diameter of 131.36 m. The candidate region is an annular sector of half-width 40.2° whose 5 % accuracy band extends from 987 to 1016 m in radius. A Monte-Carlo study on 3000 admissible sources gives a mean diameter of 56.3 m at this point, against 95.0 m for a naive perpendicular placement.
Downloads
References
[1] Langley, R. B. (1999). Dilution of precision. GPS World, 10(5), 52–59.
[2] Nardone, S. C., Lindgren, A. G., & Gong, K. F. (1984). Fundamental properties and performance of conventional bearings-only target motion analysis. IEEE Transactions on Automatic Control, 29(9), 775–787. https://doi.org/10.1109/TAC.1984.1103671.
[3] Torrieri, D. J. (1984). Statistical theory of passive location systems. IEEE Transactions on Aerospace and Electronic Systems, 20(2), 183–198. https://doi.org/10.1109/TAES.1984.310435.
[4] Dogancay, K. (2005). Bearings-only target localization using total least squares. Signal Processing, 85(9), 1695–1710. https://doi.org/10.1016/j.sigpro.2005.01.012.
[5] Bishop, A. N., Fidan, B., Anderson, B. D. O., Dogancay, K., & Pathirana, P. N. (2010). Optimality analysis of sensor-target localization geometries. Automatica, 46(3), 479–492. https://doi.org/10.1016/j.automatica.2009.12.003.
[6] Jiang, H., Cai, Y., & Yu, Z. (2022). Observability metrics for single-target tracking with bearings-only measurements. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52(2), 1065–1077. https://doi.org/10.1109/TSMC.2020.3044040.
[7] Jaulin, L., Kieffer, M., Didrit, O., & Walter, É. (2001). Applied interval analysis. Springer.
[8] Zhu, Y., Fang, X., & Li, C. (2025). Multi-sensor information fusion for mobile robot indoor-outdoor localization: A zonotopic set-membership estimation approach. Electronics, 14(5), 867. https://doi.org/10.3390/electronics14050867.
[9] Jung, H. (1901). Über die kleinste Kugel, die eine räumliche Figur einschließt. Journal für die reine und angewandte Mathematik, 123, 241–257.
[10] Toussaint, G. T. (1983). Solving geometric problems with the rotating calipers. In Proceedings of the IEEE MELECON (pp. A10.02/1–4). Athens, Greece.
[11] Welzl, E. (1991). Smallest enclosing disks (balls and ellipsoids). In H. Maurer (Ed.), New results and new trends in computer science (pp. 359–370). Springer. https://doi.org/10.1007/BFb0038194.
[12] Tan, C. S., Mohd-Mokhtar, R., & Arshad, M. R. (2021). A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms. IEEE Access, 9, 119310–119342. https://doi.org/10.1109/ACCESS.2021.3107568.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Scientific Journal of Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.






