TY  - BOOK
AU  - Vázquez Álvarez,Antonio José
AU  - Erwin,Richard Scott
ED  - SpringerLink (Online service)
TI  - An Introduction to Optimal Satellite Range Scheduling
T2  - Springer Optimization and Its Applications,
SN  - 9783319254098
AV  - QA315-316 
U1  - 515.64 23
PY  - 2015///
CY  - Cham
PB  - Springer International Publishing, Imprint: Springer
KW  - mathematics
KW  - Computer science
KW  - Mathematics
KW  - Game theory
KW  - Computer mathematics
KW  - Algorithms
KW  - Calculus of variations
KW  - economic theory
KW  - Calculus of Variations and Optimal Control; Optimization
KW  - Economic Theory/Quantitative Economics/Mathematical Methods
KW  - Math Applications in Computer Science
KW  - Game Theory, Economics, Social and Behav. Sciences
KW  - Mathematical Applications in Computer Science
N2  - The satellite range scheduling (SRS) problem, an important operations research problem in the aerospace industry consisting of allocating tasks among satellites and Earth-bound objects, is examined in this book. SRS principles and solutions are applicable to many areas, including: Satellite communications, where tasks are communication intervals between sets of satellites and ground stations Earth observation, where tasks are observations of spots on the Earth by satellites Sensor scheduling, where tasks are observations of satellites by sensors on the Earth. This self-contained monograph begins with a structured compendium of the problem and moves on to explain the optimal approach to the solution, which includes aspects from graph theory, set theory, game theory and belief networks. This book is accessible to students, professionals and researchers in a variety of fields, including: operations research, optimization, scheduling theory, dynamic programming and game theory. Taking account of the distributed, stochastic and dynamic variants of the problem, this book presents the optimal solution to the fixed interval SRS problem and how to migrate results into more complex cases. Reference algorithms and traditional algorithms for solving the scheduling problems are provided and compared with examples and simulations in practical scenarios
UR  - http://dx.doi.org/10.1007/978-3-319-25409-8
ER  -