2007
DOI: 10.1007/s10291-007-0066-8
|View full text |Cite
|
Sign up to set email alerts
|

Computer algebra solution of the GPS N-points problem

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 10 publications
(7 reference statements)
0
1
0
Order By: Relevance
“…To obtain the complete configuration, it is enough to choose one member as the axes' origin and obtain the relative positions in space of three or (better) four or more of the other members as a constellation. At a later date, any other member will be able to localize from its distance from the constellation, using algorithms commonly used in GPS calculations [69, 70]; in this manner, the initial members are used like a constellation of satellites. Therefore, we now need to localize some members, with respect to one [69].…”
Section: The Localization Problem: Our First Proposalmentioning
confidence: 99%
“…To obtain the complete configuration, it is enough to choose one member as the axes' origin and obtain the relative positions in space of three or (better) four or more of the other members as a constellation. At a later date, any other member will be able to localize from its distance from the constellation, using algorithms commonly used in GPS calculations [69, 70]; in this manner, the initial members are used like a constellation of satellites. Therefore, we now need to localize some members, with respect to one [69].…”
Section: The Localization Problem: Our First Proposalmentioning
confidence: 99%