Genetic algorithms for satellite scheduling problems

Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency) and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.Peer ReviewedPostprint (published version

Mission control communications interface requirements study, space transportation system, volume 1

Communications traffic models required by the STS Operator to satisfy the operational requirements and concepts were developed. Detailed requirements for the ground system required for flight control of the STS and interface with Payload Operations Control Centers were constructed

A human factors approach to range scheduling for satellite control

Range scheduling for satellite control presents a classical problem: supervisory control of a large-scale dynamic system, with unwieldy amounts of interrelated data used as inputs to the decision process. Increased automation of the task, with the appropriate human-computer interface, is highly desirable. The development and user evaluation of a semi-automated network range scheduling system is described. The system incorporates a synergistic human-computer interface consisting of a large screen color display, voice input/output, a 'sonic pen' pointing device, a touchscreen color CRT, and a standard keyboard. From a human factors standpoint, this development represents the first major improvement in almost 30 years to the satellite control network scheduling task

Artificial intelligence applications in space and SDI: A survey

The purpose of this paper is to survey existing and planned Artificial Intelligence (AI) applications to show that they are sufficiently advanced for 32 percent of all space applications and SDI (Space Defense Initiative) software to be AI-based software. To best define the needs that AI can fill in space and SDI programs, this paper enumerates primary areas of research and lists generic application areas. Current and planned NASA and military space projects in AI will be reviewed. This review will be largely in the selected area of expert systems. Finally, direct applications of AI to SDI will be treated. The conclusion covers the importance of AI to space and SDI applications, and conversely, their importance to AI

A Tabu Search algorithm for ground station scheduling problem

(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Mission planning plays an important role in satellite control systems. Satellites are not autonomously operated in many cases but are controlled by tele-commands transmitted from ground stations. Therefore, mission scheduling is crucial to efficient satellite control systems, especially with increase of number of satellites and more complex missions to be planned. In a general setting, the satellite mission scheduling consists in allocating tasks such as observation, communication, etc. to resources (spacecrafts (SCs), satellites, ground stations). One common version of this problem is that of ground station scheduling, in which the aim is to compute an optimal planning of communications between satellites and operations teams of Ground Station (GS). Because the communication between SCs and GSs can be done during specific window times, this problem can also be seen as a window time scheduling problem. The required communication time is usually quite smaller than the window of visibility of SCs to GSs, however, clashes are produced, making the problem highly constrained. In this paper we present a Tabu Search (TS) algorithm for the problem, while considering several objective functions, namely, windows fitness, clashes fitness, time requirement fitness, and resource usage fitness. The proposed algorithm is evaluated by a set of problem instances of varying size and complexity generated with the STK simulation toolkit. The computational results showed the efficacy of TS for solving the problem on all considered objectives.Peer ReviewedPostprint (author's final draft

Understanding Algorithm Performance on an Oversubscribed Scheduling Application

The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet, through careful experimentation and modeling of performance in real problem instances, we can relate characteristics of the best algorithms to characteristics of the application. In particular, we find that plateaus dominate the search spaces (thus favoring algorithms that make larger changes to solutions) and that some randomization in exploration is critical to good performance (due to the lack of gradient information on the plateaus). Based on our explanations of algorithm performance, we develop a new algorithm that combines characteristics of the best performers; the new algorithms performance is better than the previous best. We show how hypothesis driven experimentation and search modeling can both explain algorithm performance and motivate the design of a new algorithm

Interference problems for nongeostationary satellites

The interference problems faced by nongeostationary satellites may be of major significance. A general discussion indicates the scope of the problems and describes several configurations of importance. Computer programs are described, which are employed by NASA/JPL and the U.S. Air Force Satellite Control Facility to provide interference-free scheduling of commands and data transmission. Satellite system mission planners are not concerned with the precise prediction of interference episodes, but rather with the expected total amount of interference, the mean and maximum duration of events, and the mean spacing between episodes. The procedures in the theory of probability developed by the author which permit calculation of such quantities are described and applied to several real cases. It may be anticipated that the problems will become steadily worse in the future as more and more data transmissions attempt to occupy the same frequency band

Communications satellite technology

Communications satellite technology - echo, relay, and syncom project