Algebraic Solution of GPS Pseudo-Ranging Equations

Abstract

Several procedures for solving, in a closed form the GPS pseudo-ranging four-point problem P4P in matrix form already exist. We present here alternative algebraic procedures using Multipolynomial resultant and Groebner basis to solve the same problem. The advantage is that these algebraic algorithms have already been implemented in algebraic software such as “Mathematica” and “Maple”. The procedures are straightforward and simple to apply. We illustrate here how the algebraic techniques of Multipolynomial resultant and Groebner basis explicitly solve the nonlinear GPS pseudo-ranging four-point equations once they have been converted into algebraic (polynomial) form and reduced to linear equations. In particular, the algebraic tools of Multipolynomial resultant and Groebner basis provide symbolic solutions to the GPS four-point pseudo-ranging problem. The various forward and backward substitution steps inherent in the clasical closed form solutions of the problem are avoided. Similar to the Gauss elimination techniques in linear systems of equations, the Multipolynomial resultant and Groebner basis approaches eliminate several variables in a multivariate system of nonlinear equations in such a manner that the end product normally consists of univariate polynomial equations (in this case quadratic equations for the range bias expressed algebraically using the given quantities) whose roots can be determined by existing programs (e. g., the roots command in MATLAB). © 2002 Wiley Periodicals, Inc.