Judgement theorems and an approach for solving the constellation-to-ground coverage problem

DOI10.1155/2018/5097324zbMath1427.70059OpenAlexW2793263334WikidataQ130206239 ScholiaQ130206239MaRDI QIDQ1721028

Guangming Dai, Maocai Wang, Zhiming Song, Xiangyun Hu

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/5097324

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Orbital mechanics (70M20)

Cites Work

• Optimization-based scheduling for the single-satellite, multi-ground station communication problem
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites

This page was built for publication: Judgement theorems and an approach for solving the constellation-to-ground coverage problem