Abstract
P4P is the pseudo-ranging 4-point problem as it appears as the basic configuration of satellite positioning with pseudo-ranges as observables. In order to determine the ground receiver/satellite receiver (LEO networks) position from four positions of satellite transmitters given, a system of four nonlinear (algebraic) equations has to be solved. The solution point is the intersection of four spherical cones if the ground receiver/satellite receiver clock bias is implemented as an unknown. Here we determine the critical configuration manifold (Determinantal Loci, Inverse Function Theorem, Jacobi map) where no solution of P4P exists. Four examples demonstrate the critical linear manifold. The algorithm GS solves in a closed form P4P in a manner similar to Groebner bases: The algebraic nonlinear observational equations are reduced in the forward step to one quadratic equation in the clock bias unknown. In the backward step two solutions of the position unknowns are generated in closed form. Prior information in P4P has to be implemented in order to decide which solution is acceptable. Finally, the main target of our contribution is formulated: Can we identify a special configuration of satellite transmitters and ground receiver/satellite receiver where the two solutions are reduced to one. A special geometric analysis of the discriminant solves this problem. © 2002 Wiley Periodicals, Inc.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
