Satellite Constellation Image Acquisition Problem: A Case Study

This chapter deals with the image acquisition scheduling of Earth observing satellites that revolve around the Earth in specific orbits and take images of prescribed areas requested by the clients. Often a satellite cannot acquire the images of a requested area in a single pass and it is necessary to divide the area into multiple strips each of which can be acquired in one satellite pass. Each satellite might have several image acquisition opportunities for each strip as the satellites can take images using different incidence angles. Then the Satellite Image Acquisition Scheduling Problem (SIASP) is to select the opportunities to acquire as many images as possible, without repetition, within a planning horizon while considering the image priorities and energy constraints. The proposed SIASP model employs a piecewise linear objective function to favor completion of an image acquisition request over partial acquisition of many requests. Extensive experimental study has been carried out using realistic randomly generated instances based on the forecasted statistics provided by MDA, Richmond, Canada. These experiments are intended as a preliminary investigation of the image acquisition scheduling for the Canadian RADARSAT Constellation Mission (RCM), a constellation of three satellites to be launched in 2018.

[1]  Vincenzo Cutello,et al.  Parallel Problem Solving from Nature - PPSN XII , 2012, Lecture Notes in Computer Science.

[2]  G. Verfaillie,et al.  METHODS FOR THE DAILY MANAGEMENT OF AN EARTH OBSERVATION SATELLITE , 1996 .

[3]  Gilbert Laporte,et al.  A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites , 2007, Eur. J. Oper. Res..

[4]  Nicolas Jozefowiez,et al.  Multi-objective Optimization for Selecting and Scheduling Observations by Agile Earth Observing Satellites , 2012, PPSN.

[5]  Jufang Li,et al.  A Decomposition-Based Algorithm for Imaging Satellites Scheduling Problem , 2009, 2009 International Conference on Information Engineering and Computer Science.

[6]  Gilbert Laporte,et al.  Maximizing the value of an Earth observation satellite orbit , 2005, J. Oper. Res. Soc..

[7]  Krishna Teja Malladi Cluster Restricted Maximum Weight Clique Problem and Linkages with Satellite Image Acquisition Scheduling , 2014 .

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[9]  Chia-Hui Huang,et al.  A Superior Representation Method for Piecewise Linear Functions , 2009, INFORMS J. Comput..

[10]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2011, Math. Program..

[11]  Gérard Verfaillie,et al.  Selecting and scheduling observations of agile satellites , 2002 .

[12]  George L. Nemhauser,et al.  A Note on "A Superior Representation Method for Piecewise Linear Functions" , 2010, INFORMS J. Comput..

[13]  Vangelis Th. Paschos,et al.  A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts , 1997, Ann. Oper. Res..

[14]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[15]  Marco Budinich,et al.  The Maximum Clique Problem in Spinorial Form , 2007 .

[16]  A. Mcguire,et al.  What is it to be a model? , 2000, HEPAC Health Economics in Prevention and Care.

[17]  Peng Gao,et al.  A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation , 2011, Comput. Ind. Eng..

[18]  Hamid Reza Karimi,et al.  Observer-Based Stabilization of Spacecraft Rendezvous with Variable Sampling and Sensor Nonlinearity , 2013 .

[19]  Dongdong Ge,et al.  A Review of Piecewise Linearization Methods , 2013 .

[20]  Abraham P. Punnen,et al.  Satellite downlink scheduling problem: A case study , 2015 .