Skip to main content
main-content

Über dieses Buch

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 stationsEarth observation, where tasks are observations of spots on the Earth by satellitesSensor 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.

Inhaltsverzeichnis

Frontmatter

Introduction

Frontmatter

Chapter 1. Motivation

This is the first chapter of a monograph on optimal Satellite Range Scheduling, defined as the problem of allocating communication intervals between satellites and ground stations. This problem has been studied for decades, but only suboptimal solutions to it had been discovered. The optimal solution to the problem has been found by the authors. The authors also provide a list of the contributions introduced in this monograph compared to previous publications, which include several generalizations to more complicated scenarios, optimal solutions for these variants, and the characterization of the relations among the presented problems. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Chapter 2. Scheduling Process

The authors describe the process of Satellite Range Scheduling in the context of satellite mission planning in detail, justifying the selection of the basic elements for the mathematical problem. Based on this description, the authors provide a classification for Satellite Range Scheduling problems which covers most of the scenarios studied in existing literature. This chapter completes the introduction to a monograph on optimal Satellite Range Scheduling, linking the different problems presented in the classification with the rest of the chapters of the book. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Satellite Range Scheduling

Frontmatter

Chapter 3. The Satellite Range Scheduling Problem

Existing literature has provided several different suboptimal algorithms for the Satellite Range Scheduling problem. The authors present a precise mathematical definition of the problem, and provide a detailed classification of different variants of the problem. Compared to previous publications by the authors, this chapter provides better definitions of a number of the classification terms, additional examples for illustrating the mathematical model, and new results on the complexity of some of the variants of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Chapter 4. Optimal Satellite Range Scheduling

In previous work the authors have presented an algorithm providing the optimal allocation of fixed interval communication intervals among satellites and ground stations. This chapter includes the generalization of this algorithm for solving the problem where the durations of these communication intervals are variable with preference to longer durations, provides more insight on the complexity of the algorithm and includes new results on the availability of partial results along execution. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Variants of Satellite Range Scheduling

Frontmatter

Chapter 5. Noncooperative Satellite Range Scheduling

In previous work the authors have provided the first game-theoretic approach to the Satellite Range Scheduling problem, modeling the problem as a Stackelberg game and computing its equilibrium in polynomial time. Compared to previous work which focused on the perfect information case, this chapter introduces several variants of this problem with limited information, sheds some light on alternative models, and provides further insight on the relations with the centralized version of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Chapter 6. Robust Satellite Range Scheduling

The introduction of uncertainty in Satellite Range Scheduling scenarios has been tackled by existing literature through different suboptimal approaches. The authors have provided a schedule with maximal expected metric (performance) for the case where communication intervals may fail with a certain probability. This chapter extends this model to more complicated cases including those with uncertainty on the priorities and on the duration of these intervals. One of the presented algorithms is also shown to be applicable to deterministic single-satellite scheduling, outperforming existing algorithms. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Chapter 7. Reactive Satellite Range Scheduling

In practical scenarios of Satellite Range Scheduling, an alternative approach to that of the previous chapter in dealing with dynamic or uncertain parameters is developed. Rather than assuming that parameter change statistics are known a priori (as in the robust scheduling problem), in the dynamic problem it is assumed there is no a priori knowledge of parameter changes, and reactive approaches are considered, where the schedule needs to be recomputed every time these parameters change. The authors present an algorithm which introduces a preprocessing stage performed while the parameters remain unchanged, which allows to minimize the time of recomputation of the optimal schedule for the case where only one pass changes at a time. The authors also provide a generalization of this algorithm for reducing the recomputation time in more complex cases. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Chapter 8. Summary

The authors provide in this chapter the whole picture describing all the relations, and also the conclusions and future lines of work on optimal Satellite Range Scheduling. This chapter complements those in the introduction, linking each of the presented problems with its applicable chapter, serving as a graphical table of contents. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Antonio José Vázquez Álvarez, Richard Scott Erwin

Backmatter

Weitere Informationen

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.

Whitepaper

- ANZEIGE -

Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!

Bildnachweise