| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910300249303321 |
|
|
Autore |
Vazquez Alvarez Antonio Jose |
|
|
Titolo |
An Introduction to Optimal Satellite Range Scheduling [[electronic resource] /] / by Antonio Jose Vazquez Alvarez, Richard Scott Erwin |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2015.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (180 p.) |
|
|
|
|
|
|
Collana |
|
Springer Optimization and Its Applications, , 1931-6828 ; ; 106 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Calculus of variations |
Economic theory |
Computer science—Mathematics |
Algorithms |
Game theory |
Computer mathematics |
Calculus of Variations and Optimal Control; Optimization |
Economic Theory/Quantitative Economics/Mathematical Methods |
Math Applications in Computer Science |
Game Theory, Economics, Social and Behav. Sciences |
Mathematical Applications in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Preface; Acknowledgments; Contents; Acronyms; Symbols; List of Figures; List of Tables; Part I Introduction; 1 Motivation; 1.1 Motivation; 1.2 Why Optimal Scheduling?; 1.3 Why this Book?; 1.4 Structure of the Book; 1.5 Main Contributions; References; 2 Scheduling Process; 2.1 Scheduling Process; 2.2 Scheduler Characteristics; 2.3 Satellite Range Scheduling Problems; 2.4 Issues Beyond the Scope of this Text; References; Part II Satellite Range Scheduling; 3 The Satellite Range Scheduling Problem; 3.1 Problem Formulation; 3.1.1 Model for the Scenario; 3.1.2 Model for the Requests |
3.1.3 Problem Constraints3.1.3.1 Preemption; 3.1.3.2 Number of Entities; 3.1.3.3 Duration of the Requests; 3.1.3.4 Redundancy; 3.1.3.5 |
|
|
|
|
|
|
|
|
|
|
|
Precedence; 3.1.3.6 Priority; 3.1.4 Schedule Metrics; 3.2 Complexity of SRS; 3.2.1 Introduction to Complexity Theory; 3.2.2 Complexity of the SRS Problem; 3.3 General Scheduling Problems; 3.3.1 Problem Classification; 3.3.2 Problem Reducibility; 3.4 Relating Satellite and General Scheduling Problems; 3.4.1 One Machine Problems; 3.4.1.1 1 rj,pij Uj; 3.4.1.2 1 rj,pij, prec Uj; 3.4.1.3 1 rj,pij wj Uj; 3.4.1.4 1 rj wj Uj; 3.4.1.5 1 rj,pij pij pij wj Uj |
3.4.2 Several Identical Machines Problems3.4.2.1 P rj,pij,CΣ Uj; 3.4.3 Several Unrelated Machines Problems; 3.4.3.1 R rj, pij,CΣ wj Uj; 3.4.3.2 R rj, pij,Cx wj Uj; 3.4.3.3 R rj, pij,CΣ, prec wj Uj; 3.4.3.4 R rj, CΣ wj Uj; 3.4.3.5 R rj, CΣ, prec wj Uj; 3.4.3.6 R rj,pij pij pij,CΣ wj Uj; 3.5 Summary; References; 4 Optimal Satellite Range Scheduling; 4.1 Scenario Model for Fixed Interval SRS; 4.2 Optimal Solution for Fixed Interval SRS; 4.2.1 Description of the Algorithm; 4.2.1.1 Event Generation; 4.2.1.2 Graph Creation; 4.2.1.3 Longest Path Calculation |
4.2.2 Optimality of the Solution and Complexityof the Algorithm4.3 Extension of the Algorithm; 4.3.1 Optimal Discretized Variable Slack SRS; 4.3.2 Optimal Fixed Interval SRS with Redundancy; 4.4 Remarks on the Complexity; 4.4.1 Greedy Earliest Deadline Algorithm; 4.4.2 Greedy Maximum Priority Algorithm; 4.4.3 About the Topology of the Scenario; 4.4.4 About the Number of Passes; 4.4.5 About Partial Results; 4.5 Graph Generation Example; Event Generation; Stage Z0; Stage Z1; Stage Z2; Stage Z3; Stage Z4; Rest of Stages; 4.6 Simulations; 4.6.1 Simulation: Practical Case |
4.6.2 Simulation: Worst Case4.6.3 Simulation: Number of Passes; 4.6.4 Simulation: Partial Results; 4.7 Summary; References; Part III Variants of Satellite Range Scheduling; 5 Noncooperative Satellite Range Scheduling; 5.1 Scenario Model for the SRS Game; 5.2 Elements of the SRS Game; 5.2.1 Players; 5.2.2 Sequential Decisions; 5.2.3 Actions; 5.2.4 Shared Information; 5.2.5 Payoffs; 5.2.6 Rationality; 5.2.7 Extensive Form; 5.3 SRS Game with Perfect Information; 5.3.1 Description of the Algorithm; 5.3.1.1 Event Generation; 5.3.1.2 Graph Elements; 5.3.1.3 Graph Creation |
5.3.2 Stackelberg Equilibrium Solution |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
| |