Computer algebra solution of the GPS N-points problem
- 171 Downloads
A computer algebra solution is applied here to develop and evaluate algorithms for solving the basic GPS navigation problem: finding a point position using four or more pseudoranges at one epoch (the GPS N-points problem). Using Mathematica 5.2 software, the GPS N-points problem is solved numerically, symbolically, semi-symbolically, and with Gauss–Jacobi, on a work station. For the case of N > 4, two minimization approaches based on residuals and distance norms are evaluated for the direct numerical solution and their computational duration is compared. For N = 4, it is demonstrated that the symbolic computation is twice as fast as the iterative direct numerical method. For N = 6, the direct numerical solution is twice as fast as the semi-symbolic, with the residual minimization requiring less computation time compared to the minimization of the distance norm. Gauss–Jacobi requires eight times more computation time than the direct numerical solution. It does, however, have the advantage of diagnosing poor satellite geometry and outliers. Besides offering a complete evaluation of these algorithms, we have developed Mathematica 5.2 code (a notebook file) for these algorithms (i.e., Sturmfel’s resultant, Dixon’s resultants, Groebner basis, reduced Groebner basis and Gauss–Jacobi). These are accessible to any geodesist, geophysicist, or geoinformation scientist via the GPS Toolbox (http://www.ngs.noaa.gov/gps-toolbox/exist.htm) website or the Wolfram Information Center (http://library.wolfram.com/infocenter/MathSource/6629/).
KeywordsGPS CAS Positioning Algebra
The authors would like to thank Dr. Steve Hilla and the anonymous reviewer for their suggestions and corrections which helped in improving the manuscript. JLA thanks Curtin Research Fellowship.
- Awange JL, Grafarend EW (2005) Solving algebraic computational problems in geodesy and geoinformatics. Springer, Berlin, pp 1–333Google Scholar
- Bellomo N, Preziosi L, Romano A (2000) Mechanics and dynamical systems with Mathematica. Birkhäuser, Boston, pp 1–417Google Scholar
- Freeman JA (1994) Simulating neural networks with Mathematica. Addison-Wesley, New York, pp 1–341Google Scholar
- Grafarend EW, Shan J (1996) Closed-form solution of the nonlinear pseudoranging equations (GPS). Artif Satellites Planet Geod 31:133–147Google Scholar
- Haneberg WC (2004) Computational geosciences with mathematics. Springer, BerlinGoogle Scholar
- Helton JW, Merino O (1998) Classical control using H-infty methods: an introduction to design. SIAM pp 1–171Google Scholar
- Kleusberg A (1994) Die direkte Lösung des räumlichen Hyperbelschnitts. Zeitschrift für Vermessungswesen 119:188–192Google Scholar
- Kleusberg A (2003) Analytical GPS navigation solution. In: Grafarend EW, Krumm FW, Schwarze VS (eds) Geodesy—the challenge of the 3rd Millennium. Springer, Heidelberg, pp 93–96Google Scholar
- Lichtenegger H (1995) Eine direkte Lösung des räumlichen Bogenschnitts. Österreichische Zeitschrift für Vermessung und Geoinformation 83:224–226Google Scholar
- Romeny BM (2003) Front-end vision and multi-scale image analysis. Kluwer, Dordrecht, pp 1–464Google Scholar
- Singer P, Ströbel D, Hördt R, Bahndorf J, Linkwitz K (1993) Direkte Lösung des räumlichen Bogenschnitts. Zeitschrift für Vermessungswesen 124:295–297Google Scholar