Task Scheduling Algorithm for the Communication, Ocean, and Meteorological Satellite

Lee, Soojeon; Jung, Wonjin; Kim, Jae-Hoon

doi:10.4218/etrij.08.0107.0120

Cited by 22 publications

(20 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2) We design an optimization formula and a genetic algorithm for solving such a problem. Generally, the satellite-scheduling problem is regarded as an NP-hard problem [34][35][36][37][38]. In this case, a deterministic formula cannot be applied, and every possible scheduling should be searched.…”

Section: Proposed Modelmentioning

confidence: 99%

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

Lee¹,

Kim²,

Chung³

et al. 2016

International Journal of Aeronautical and Space Sciences

View full text Add to dashboard Cite

Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

show abstract

Section: Proposed Modelmentioning

confidence: 99%

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

Lee¹,

Kim²,

Chung³

et al. 2016

International Journal of Aeronautical and Space Sciences

View full text Add to dashboard Cite

show abstract

“…(4) Acd It defines how many tasjs the resource can support up simultaneously. (5) (6) Capacity is not applicable to all resources,hust thos that have capacity that can be depleted or replenished.It can be defined as consumable or resilient and has three parameters as follows: min capacity ,max capacity and init capacity.…”

Section: Mission Decompositionmentioning

confidence: 99%

Application of Relay Satellite Scheduling based on STK/X

Li¹,

Fang²,

Jianbo³

2011

Proceedings of 2011 IEEE CIE International Conference on Radar

View full text Add to dashboard Cite

Tracking and Data Relay Satellite (TDRS) has been seen as bridge not only between user spacecrafts in LEO(Low Earth Orbit) or MEO(Middle Earth Orbit) but also between user spacecraft and groundstation. The paper firstly introduces the main function of STK and its components. Then based on the characteristics of Relay Satellite Scheduling, a scheduling system is designed with vc++/STK/X and validated by a set of typical operation datas.The result shows that the model can resolve small-scale relay satellite scheduling problems and reduce exploitative difficulty of application.

show abstract

“…Corrao et al (2012) integrate Genetic Algorithms, Graph Theory and Linear Programming in order to build conflict-free plans, and apply their approach to a case study obtained from a satellite service company. Lee et al (2008) study the scheduling of a single geostationary satellite. Marinelli et al (2011) formulates the problem as an ILP model, which is declared as infeasible.…”

Section: Introductionmentioning

confidence: 99%

Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming

Vázquez¹,

Perea²,

Vioque³

2014

Aerospace Science and Technology

View full text Add to dashboard Cite

Ground station operators have to assign different antennas in their ground stations network to passes of satellites from customers that have requested the use of the network. However, for operators that support a high number of satellites, in many cases these requests yield conflicts (which appear when more than one satellite requests the same time slot on the same antenna). If there are many conflicts, the process of deconflicting (i.e., moving passes to other antennas or sites or cancelling them so that conflicts are avoided) is not very efficient when done manually, due to the large number of interacting requests. Thus, there is a need for an automatic tool that is able to manage the Antenna-Satellite assignment problem for a large number of passes, by considering the problem globally for a given time-frame (for instance, a week). In this paper we propose to address the deconfliction process by means of Integer Linear Programming. Models that take into account the basic deconflicting operations (moving antenna, moving site, shortening, or cancelling), are proposed and tested on real data provided by the company that posed this problem, yielding better results than the solutions obtained by their previous system.

show abstract

Task Scheduling Algorithm for the Communication, Ocean, and Meteorological Satellite

Cited by 22 publications

References 5 publications

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

Genetic algorithm-based scheduling for ground support of multiple satellites and antennae considering operation modes

Application of Relay Satellite Scheduling based on STK/X

Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming

Contact Info

Product

Resources

About