A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem
The constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid-point approach (GPA) is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve o...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8432404/ |
| _version_ | 1818415944687419392 |
|---|---|
| author | Zhiming Song Guangming Dai Maocai Wang Xiaoyu Chen |
| author_facet | Zhiming Song Guangming Dai Maocai Wang Xiaoyu Chen |
| author_sort | Zhiming Song |
| collection | DOAJ |
| description | The constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid-point approach (GPA) is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve or overcome the drawbacks of this approach are proposed. The spatial and temporal characteristics of the GPA were analyzed, and a strategy that can compute the upper and lower bounds of the result was given. This strategy can not only acquire the result but can also yield the error range of the result. In addition, a strategy that uses low-precision results to compute a high-precision result is proposed. Simulation experiments of different types of coverage problems were conducted, and the results show that these strategies are effective. |
| first_indexed | 2024-12-14T11:43:02Z |
| format | Article |
| id | doaj.art-c55f41d2d46d44a79dfd556f7c0718d0 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T11:43:02Z |
| publishDate | 2018-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-c55f41d2d46d44a79dfd556f7c0718d02022-12-21T23:02:44ZengIEEEIEEE Access2169-35362018-01-016444454445810.1109/ACCESS.2018.28641818432404A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage ProblemZhiming Song0https://orcid.org/0000-0002-9045-8933Guangming Dai1Maocai Wang2https://orcid.org/0000-0002-6736-1711Xiaoyu Chen3https://orcid.org/0000-0002-4588-8475School of Computer, China University of Geosciences, Wuhan, ChinaSchool of Computer, China University of Geosciences, Wuhan, ChinaSchool of Computer, China University of Geosciences, Wuhan, ChinaSchool of Computer, China University of Geosciences, Wuhan, ChinaThe constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid-point approach (GPA) is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve or overcome the drawbacks of this approach are proposed. The spatial and temporal characteristics of the GPA were analyzed, and a strategy that can compute the upper and lower bounds of the result was given. This strategy can not only acquire the result but can also yield the error range of the result. In addition, a strategy that uses low-precision results to compute a high-precision result is proposed. Simulation experiments of different types of coverage problems were conducted, and the results show that these strategies are effective.https://ieeexplore.ieee.org/document/8432404/Satellite ConstellationCoverage ProblemGrid Point ApproachSolution Algorithm |
| spellingShingle | Zhiming Song Guangming Dai Maocai Wang Xiaoyu Chen A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem IEEE Access Satellite Constellation Coverage Problem Grid Point Approach Solution Algorithm |
| title | A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem |
| title_full | A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem |
| title_fullStr | A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem |
| title_full_unstemmed | A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem |
| title_short | A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional Coverage Problem |
| title_sort | novel grid point approach for efficiently solving the constellation to ground regional coverage problem |
| topic | Satellite Constellation Coverage Problem Grid Point Approach Solution Algorithm |
| url | https://ieeexplore.ieee.org/document/8432404/ |
| work_keys_str_mv | AT zhimingsong anovelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT guangmingdai anovelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT maocaiwang anovelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT xiaoyuchen anovelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT zhimingsong novelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT guangmingdai novelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT maocaiwang novelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem AT xiaoyuchen novelgridpointapproachforefficientlysolvingtheconstellationtogroundregionalcoverageproblem |