Realizability of Planar Point Embeddings from Angle Measurements

Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor locations are known.Inspired by Euclidean distance matrices, we investigate when a set of inner angles corresponds to a realizable point set. In particular, we find linear and non-linear constraints that are provably necessary, and we conjecture also sufficient for characterizing realizable angle sets. We confirm this in extensive numerical simulations, and we illustrate the use of these constraints for denoising angle measurements along with the reconstruction of a valid point set.

[1]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[2]  Leo Liberti,et al.  Realizing Euclidean distance matrices by sphere intersection , 2019, Discret. Appl. Math..

[3]  Martin Vetterli,et al.  Combining Range and Direction for Improved Localization , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[4]  Y. Ye,et al.  Semidefinite Programming Algorithms for Sensor Network Localization using Angle Information , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[5]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2009, TOSN.

[6]  Petar M. Djuric,et al.  Joint Indoor Localization and Navigation of UAVs for Network Formation Control , 2018, 2018 52nd Asilomar Conference on Signals, Systems, and Computers.

[7]  Ivan Dokmanic,et al.  Euclidean Distance Matrices: A Short Walk Through Theory, Algorithms and Applications. , 2015 .

[8]  Giuseppe Thadeu Freitas de Abreu,et al.  Algebraic Approach for Robust Localization with Heterogeneous Information , 2013, IEEE Transactions on Wireless Communications.

[9]  J. Gower.  Euclidean Distance Geometry , 1982 .

[10]  Antonio Mucherino,et al.  Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures , 2018, Ann. Oper. Res..

[11]  Carlos Silvestre,et al.  A globally exponentially stable filter for bearing-only simultaneous localization and mapping with monocular vision , 2018, Robotics Auton. Syst..

[12]  K. V. S. Hari,et al.  Accurate indoor positioning of firefighters using dual foot-mounted inertial sensors and inter-agent ranging , 2014, 2014 IEEE/ION Position, Location and Navigation Symposium - PLANS 2014.

[13]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Jie Gao,et al.  Distributed localization using noisy distance and angle information , 2006, MobiHoc '06.

[15]  Giuseppe Di Battista,et al.  Angles of planar triangular graphs , 1993, STOC '93.

[16]  Danda B. Rawat,et al.  Advances on localization techniques for wireless sensor networks: A survey , 2016, Comput. Networks.

[17]  Jon C. Dattorro,et al.  Convex Optimization & Euclidean Distance Geometry , 2004 .

[18]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[19]  Joel Nothman,et al.  SciPy 1.0-Fundamental Algorithms for Scientific Computing in Python , 2019, ArXiv.

[20]  Marko Beko,et al.  A Linear Estimator for Network Localization Using Integrated RSS and AOA Measurements , 2019, IEEE Signal Processing Letters.

[21]  Stephen Lin,et al.  Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Martial Hebert,et al.  Bearings-only localization and mapping , 2005 .

[23]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..