Estamos realizando la búsqueda. Por favor, espere...

Solving positioning problems with minimal data

Abstract: Global and local positioning systems (LPS) make use of nonlinear equations systems to calculate coordinates of unknown points. There exist several methods, such as Sturmfels? resultant, Groebner bases and least squares, for dealing with this kind of equations. We introduce two methods for solving this problem with the aid of symbolic techniques relying on closed-form solutions for the solution set of a system of linear equations. We suppose the receiver just detects or chooses minimal data, i.e., four satellites in global positioning systems (GPS) or three stations in LPS. Both methods proceed by parameterizing the line joining two solution points to later solve a nonlinear univariate equation, either quadratic or with degree smaller than 6. The first one uses the Generalized Cramer Identities, which is a different presentation of the generalized Moore?Penrose inverse, and ends with a degree 6 univariate equation for GPS and a degree 4 univariate equation for LPS. The second one solves the system by dealing with a more geometric way, ending with a quadratic equation. Our approach covers all possible cases with a finite number of solutions, while Bancroft?s method cannot be applied when the four satellites, taking the clock bias as fourth coordinate, and the origin lay in the same hyperplane of R4R4 , and the method by Grafarend and Shan fails when the four satellites are in the same plane in R3R3 . The two proposed methods fail only when the pseudorange 4 point problem has infinite solutions.

 Fuente: GPS Solutions, 2017, 21(1), 149-161

 Editorial: Springer

 Fecha de publicación: 01/01/2017

 Nº de páginas: 12

 Tipo de publicación: Artículo de Revista

 DOI: 10.1007/s10291-015-0507-8

 ISSN: 1080-5370

 Proyecto español: MTM2014-54141-P

 Url de la publicación: https://doi.org/10.1007/s10291-015-0507-8