Premium
Dynamic Policies for Optimal LEO Satellite Launches
Author(s) -
Gavish Bezalel,
Kalvenes Joakim
Publication year - 2004
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.2004.tb00225.x
Subject(s) - computer science , dynamic programming , markov decision process , operations research , satellite , low earth orbit , process (computing) , stochastic programming , state space , quasi zenith satellite system , mathematical optimization , markov process , satellite system , telecommunications , global positioning system , aerospace engineering , algorithm , mathematics , engineering , statistics , gnss applications , operating system
Low‐earth orbit satellite (LEO) systems continue to provide mobile communication services. The issue of cost containment in system maintenance is a critical factor for continued operation. Satellite finite life‐times follow a stochastic process, and since satellite replenishment cost is the most significant on‐going cost of operation, finding optimal launch policies is of paramount importance. This paper formulates the satellite launch problem as a Markovian decision model that can be solved using dynamic programming. The policy space of the system is enormous and traditional action space dominance rules do not apply. In order to solve the dynamic program for realistic problem sizes, a novel procedure for limiting the state space considered in the dynamic program is developed. The viability of the proposed solution procedure is demonstrated in example problems using realistic system data. The policies derived by the proposed solution procedure are superior to those currently considered by LEO system operators, and result in substantial annual cost savings.