Recursive method for optimum GPS satellite selection

The author addresses the problem of selecting an optimum n-satellite subset from m visible satellites (m>n). The optimality criteria is minimum geometric dilution of precision (GDOP) subject to the integrity constraint. To solve this problem an efficient algorithm is developed using a revolving d...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on aerospace and electronic systems Vol. 37; no. 2; pp. 751 - 754
Main Author Phatak, M.S.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9251
1557-9603
DOI10.1109/7.937488

Cover

More Information
Summary:The author addresses the problem of selecting an optimum n-satellite subset from m visible satellites (m>n). The optimality criteria is minimum geometric dilution of precision (GDOP) subject to the integrity constraint. To solve this problem an efficient algorithm is developed using a revolving door method and matrix inversion lemma. The revolving door method generates each n-subset from its immediate predecessor by deleting some single element and adjoining some other single element. Then using the matrix inversion lemma, the GDOP for each new n-subset is recursively calculated from the incoming and outgoing elements. The matrix inversion lemma is also used to check the satisfaction of the integrity constraint.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-9251
1557-9603
DOI:10.1109/7.937488