An introduction to optimal satellite range scheduling. ([2015])
- Record Type:
- Book
- Title:
- An introduction to optimal satellite range scheduling. ([2015])
- Main Title:
- An introduction to optimal satellite range scheduling
- Further Information:
- Note: Antonio José Vázquez Álvarez, Richard Scott Erwin.
- Authors:
- Vázquez Álvarez, Antonio Jose
Erwin, Richard Scott - Contents:
- 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. 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 thePreface; 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. 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. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2015
- Copyright Date:
- 2015
- Extent:
- 1 online resource, illustrations (some color)
- Subjects:
- 621.382
Mathematics
Artificial satellites
Aeronautics -- Communication systems
TECHNOLOGY & ENGINEERING -- Mechanical
Aeronautics -- Communication systems
Artificial satellites
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 Science
Business & Economics -- Economics -- Theory
Computers -- Data Processing
Computers -- Programming -- Algorithms
Mathematics -- Game Theory
Mathematics -- Applied
Economic theory & philosophy
Maths for computer scientists
Numerical analysis
Game theory
Mathematical modelling
Mathematical optimization
Economic theory
Computer science
Algorithms
Mathematics -- Calculus
Calculus of variations
Electronic books - Languages:
- English
- ISBNs:
- 9783319254098
3319254073
9783319254074 - Related ISBNs:
- 331925409X
9783319254074 - Notes:
- Note: Includes bibliographical references and index.
Note: Online resource; title from PDF title page (EBSCO, viewed December 16, 2015). - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.372126
- Ingest File:
- 01_357.xml