An Introduction to Optimal Satellite Range Scheduling by Antonio Jose Vazquez Alvarez, Richard Scott Erwin

By Antonio Jose Vazquez Alvarez, Richard Scott Erwin

The satellite tv for pc diversity scheduling (SRS) challenge, a big operations examine challenge within the aerospace which include allocating initiatives between satellites and Earth-bound items, is tested during this ebook. SRS rules and recommendations are appropriate to many parts, including:

  • Satellite communications, the place projects are verbal exchange durations among units of satellites and floor stations
  • Earth remark, the place initiatives are observations of spots in the world by way of satellites
  • Sensor scheduling, the place initiatives are observations of satellites through sensors at the Earth.

This self-contained monograph starts with a established compendium of the matter and strikes directly to clarify the optimum method of the answer, consisting of features from graph thought, set conception, video game concept and trust networks. This e-book is on the market to scholars, pros and researchers in quite a few fields, together with: operations study, optimization, scheduling concept, dynamic programming and video game thought. Taking account of the dispensed, stochastic and dynamic variants of the matter, this booklet offers the optimum approach to the fastened period SRS challenge and the way emigrate effects into extra complicated situations. Reference algorithms and conventional algorithms for fixing the scheduling difficulties are supplied and in comparison with examples and simulations in useful scenarios.

Show description

Read Online or Download An Introduction to Optimal Satellite Range Scheduling (Springer Optimization and Its Applications) PDF

Similar machine theory books

Theoretische Informatik: Eine kompakte Einführung (Springer-Lehrbuch) (German Edition)

Diese kompakte Einführung in die Theoretische Informatik stellt die wichtigsten Modelle für zentrale Probleme der Informatik vor. Dabei werden u. a. folgende Fragestellungen behandelt: Welche Probleme sind algorithmisch lösbar? (Theorie der Berechenbarkeit und Entscheidbarkeit) Wie schwierig ist es algorithmische Probleme zu lösen?

Web Reasoning and Rule Systems: 8th International Conference, RR 2014, Athens, Greece, September 15-17, 2014. Proceedings (Lecture Notes in Computer Science)

This ebook constitutes the refereed complaints of the eighth foreign convention on internet Reasoning and Rule structures, RR 2014, held in Athens, Greece in September 2014. The nine complete papers, nine technical communications and five poster shows offered including three invited talks, three doctoral consortial papers have been rigorously reviewed and chosen from 33 submissions.

Advances in Computational Complexity Theory

This number of fresh papers on computational complexity idea grew out of actions in the course of a different yr at DIMACS. With contributions by way of the various prime specialists within the box, this e-book is of lasting price during this fast-moving box, offering expositions now not discovered somewhere else. even if aimed basically at researchers in complexity thought and graduate scholars in arithmetic or desktop technology, the ebook is available to somebody with an undergraduate schooling in arithmetic or computing device technological know-how.

Additional info for An Introduction to Optimal Satellite Range Scheduling (Springer Optimization and Its Applications)

Sample text

Constraints The second parameter ˇ covers the constraints on the jobs. Terms grouped in the same bullet are mutually exclusive: Release times Durations The term rj indicates different release times for every job, which is generally assumed for SRS, due to the association among requests and visibility windows. We introduce pj , for indicating that the processing time extends from the release date to the due date (no-slack case), pj D dj rj ; and another notation is introduced (for the variable-slack case), pj 6 pj 6 pj (existing notation p 6 pj 6 p assumes constant bounds for all the jobs) for indicating that the processing times are allowed to be within lower and upper bounds.

3). 1). 2). 3). 5). Strongly based on [5]. 1). 1). 1). 2). 4). 5). 6). 3). 4). 7). Strongly based on [6]. 1). 1). 2). 5). 6). 8). 8). Strongly based on [7]. 1). 2). 3). 1). 2). 5). 8). 8). New chapter. 1). 2). 3). 4). 5). New chapter. 1). 2). Acknowledgements This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL). References 9 References 1. W. Heinen, M. Unal, Scheduling tool for ESTRACK ground station management, in SpaceOps 2010 (American Institute of Aeronautics and Astronautics, Reston, VA, 2010) 2.

These fixed interval requests are generally known as passes, which we define as follows: Definition 4. 8) The term wk characterizes the weight or priority associated to this pass, normalized between 0 and 1. We present a transformation which generates a set of passes from the initial set of requests (which is a generalization of the one presented in [1]), to build a common framework for the three slack cases. Let t be the discretization step, and t 1 the inverse of t. j Transformation 1. Every request jj will be associated with a set Pj D fpk gj of passes.

Download PDF sample

Rated 4.65 of 5 – based on 5 votes