23 March 1993 Scheduling deep-space network data transmissions: a Lagrangian relaxation approach
Author Affiliations +
For various projects (satellites) one must schedule transmissions to receiving antennas on earth for a one week planning horizon. Periods of time in which any satellite is `in view' of any antenna are known in advance. The scheduling problem is formulated as an integer linear program. This formulation includes a large number of non-conflict constraints stating that an antenna must not receive data from two or more satellites simultaneously. There are also a smaller number of service level constraints specif)ed by project managers to assure appropriate levels of service. For example, service level constraints might specify for a particular project: a maximum allowable gap between the end of one transmission and the start of the next, a minimum total number of minutes of transmission during a week, a minimum number of transmissions on any day, etc. Lagrangian Relaxation allows service level constraints to be relaxed (temporarily ignored). These constraints are replaced by economic penalties for not satisfying them. The resulting modified scheduling problem is easily solved. The paper concentrates on formulation, solution by Lagrangian Relaxation, and performance on an example using real data for a week in 1996.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Colin E. Bell, Colin E. Bell, } "Scheduling deep-space network data transmissions: a Lagrangian relaxation approach", Proc. SPIE 1963, Applications of Artificial Intelligence 1993: Knowledge-Based Systems in Aerospace and Industry, (23 March 1993); doi: 10.1117/12.141750; https://doi.org/10.1117/12.141750


An accurate fixed point 8×8 IDCT algorithm based on 2D...
Proceedings of SPIE (October 07 2007)
Antenna-coupled rectifying diode for IR detection
Proceedings of SPIE (September 16 1996)
Planning Strategic Paths Through Variable Terrain Data
Proceedings of SPIE (June 13 1984)
Symbolic planning with metric time
Proceedings of SPIE (February 29 1992)
Problem Solving By Proving Satisfiability
Proceedings of SPIE (March 20 1989)

Back to Top