An Introduction to Optimal Satellite Range Scheduling [electronic resource] / by Antonio José Vázquez Álvarez, Richard Scott Erwin.

By: Vázquez Álvarez, Antonio José [author.]
Contributor(s): Erwin, Richard Scott [author.] | SpringerLink (Online service)
Material type: TextTextSeries: Springer Optimization and Its Applications: 106Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015Description: XXVII, 162 p. 69 illus., 49 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319254098Subject(s): Mathematics | Computer science -- Mathematics | Game theory | Computer mathematics | Algorithms | Calculus of variations | Economic theory | Mathematics | Calculus of Variations and Optimal Control; Optimization | Economic Theory/Quantitative Economics/Mathematical Methods | Math Applications in Computer Science | Algorithms | Game Theory, Economics, Social and Behav. Sciences | Mathematical Applications in Computer ScienceAdditional physical formats: Printed edition:: No titleDDC classification: 515.64 LOC classification: QA315-316QA402.3QA402.5-QA402.6Online resources: Click here to access online In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

There are no comments for this item.

to post a comment.

Powered by Koha