Optimization-Based Scheduling Method for Agile Earth-Observing Satellite Constellation
- 1 November 2018
- journal article
- research article
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Aerospace Information Systems
- Vol. 15 (11), 611-626
- https://doi.org/10.2514/1.i010620
Abstract
This Paper proposes a two-step binary linear programming formulation for task scheduling of a constellation of low-Earth-orbit satellites and demonstrates its applicability and scalability to obtain high-quality solutions using a standard mixed-integer linear programming solver. In this instance, the goal of satellite constellation task scheduling is to allocate each task for the satellites and to determine the task starting times in order to maximize the overall mission performance metric. The scheduling problem is formulated to find the solution by first finding a set of candidate communication time intervals for each satellite/ground-station pair as one of the key constraints and time tabling the observation task to acquire the user-requested data, with the incorporation of key constraints for satellite constellation operation. Numerical experiments are designed for investigating the trends, sensitivity, and characteristics of scheduling outputs based on multiple representative instances. The performance of the scheduling solutions by the proposed two-step binary linear programming method exhibits significant improvement of up to 35% in the number of assignments and the sum of profits over the general greedy algorithm.Keywords
Funding Information
- National Research Foundation of Korea (NRF-2016M1A3A3A02017919)
This publication has 39 references indexed in Scilit:
- On the Normed Space of Equivalence Classes of Fuzzy NumbersThe Scientific World Journal, 2013
- A Lagrangian heuristic for satellite range scheduling with resource constraintsComputers & Operations Research, 2011
- How to model planning and scheduling problems using constraint networks on timelinesThe Knowledge Engineering Review, 2010
- A Comparison of Scheduling Optimization Algorithm for the Efficient Satellite Mission Scheduling OperationJournal of the Korean Society for Aeronautical & Space Sciences, 2010
- Dual Constrained Single Machine Sequencing to Minimize Total Weighted Completion TimeIEEE Transactions on Automation Science and Engineering, 2005
- Maximizing the value of an Earth observation satellite orbitJournal of the Operational Research Society, 2005
- Daily Imaging Scheduling of an Earth Observation SatelliteIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2005
- An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion timeOperations Research Letters, 2003
- Satellite Attitude Control and Power Tracking with Energy/Momentum WheelsJournal of Guidance, Control, and Dynamics, 2001
- An exact approach to minimizing total weighted tardiness with release datesIIE Transactions, 2000