Collection Planning and Scheduling for Multiple Heterogeneous Satellite Missions: Survey, Optimization Problem, and Mathematical Programming Formulation

5Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter introduces novel integrated management of multiple heterogeneous satellite missions for the purpose of intelligence collection. The focus is on optimization of acquisition planning and scheduling for various missions including single satellites and satellite constellations. The relevant optimization problem and its mathematical programming formulation that allow multiple area coverage plans for each acquisition request, as well as consideration of the quality measures of coverage plan, strip, and imaging opportunity, are presented. The chapter consists of a multi-mission planning system overview, a survey of relevant literature, a definition of the integrated acquisition scheduling optimization problem and its mathematical programming formulation.

Cite

CITATION STYLE

APA

Mitrovic-Minic, S., Thomson, D., Berger, J., & Secker, J. (2019). Collection Planning and Scheduling for Multiple Heterogeneous Satellite Missions: Survey, Optimization Problem, and Mathematical Programming Formulation. In Springer Optimization and Its Applications (Vol. 144, pp. 271–305). Springer International Publishing. https://doi.org/10.1007/978-3-030-10501-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free