Judgement theorems and an approach for solving the constellation-to-ground coverage problem (Q1721028): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130206239, #quickstatements; #temporary_batch_1725407685744
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2018/5097324 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793263334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization-based scheduling for the single-satellite, multi-ground station communication problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian heuristic for satellite range scheduling with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130206239 / rank
 
Normal rank

Latest revision as of 00:59, 4 September 2024

scientific article
Language Label Description Also known as
English
Judgement theorems and an approach for solving the constellation-to-ground coverage problem
scientific article

    Statements

    Judgement theorems and an approach for solving the constellation-to-ground coverage problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: The satellite constellation-to-ground coverage problem is a basic and important problem in satellite applications. A group of judgement theorems is given, and a novel approach based on these judgement theorems for judging whether a constellation can offer complete single or multiple coverage of a ground region is proposed. From the point view of mathematics, the constellation-to-ground coverage problem can be regarded as a problem entailing the intersection of spherical regions. Four judgement theorems that can translate the coverage problem into a judgement about the state of a group of ground points are proposed, thus allowing the problem to be efficiently solved. Single- and multiple-coverage problems are simulated, and the results show that this approach is correct and effective.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references