Fast Determination of Satellite-to-Moon Visibility Using an Adaptive Interpolation Method Based on Vertex Protection

Fast determination of satellite visibility with respect to a target area is important for satellite navigation and positioning. In this paper, we propose an adaptive interpolation algorithm based on vertex protection to solve the satellite visibility period problem more accurately and quickly, where...

Full description

Saved in:
Bibliographic Details
Published in:Sensors (Basel, Switzerland) Vol. 22; no. 12; p. 4451
Main Authors: Li, Xiaowan, Cheng, Fang, Shen, Pengli, Liu, Dongliang
Format: Journal Article
Language:English
Published: Basel MDPI AG 12.06.2022
MDPI
Subjects:
Accuracy
adaptive interpolation
Algorithms
Approximation
Artificial satellites
lunar navigation
Moon
rapid determination
satellite-to-Moon visibility
vertex protection
ISSN:1424-8220, 1424-8220
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fast determination of satellite visibility with respect to a target area is important for satellite navigation and positioning. In this paper, we propose an adaptive interpolation algorithm based on vertex protection to solve the satellite visibility period problem more accurately and quickly, where “vertex” refers to the local extremum point. The algorithm can avoid the error in the visibility period calculation caused by skimming the vertices when fitting the multi-hump visibility function under certain fitting accuracy requirements with the traditional adaptive interpolation method. The algorithm does not need to construct a cubic polynomial in each subinterval to determine whether the satellite is visible or not; it only constructs a cubic polynomial to solve the problem if the visibility function of that subinterval is judged to have a solution from the existence theorem of zero points, which can improve the computational efficiency. For the lunar navigation problem, a solution to satellite–Moon visibility calculations based on a vertex-protected adaptive interpolation is given, and the experimental results show that the computation time of the algorithm can be reduced by approximately 98% compared with the brute force method and by approximately 30% compared with the traditional adaptive interpolation algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1424-8220
1424-8220
DOI:10.3390/s22124451