A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations (original) (raw)
Related papers
Planning and scheduling for fleets of earth observing satellites
Proceedings of the 6th …, 2002
We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the EOS scheduling problem, and proposes a stochastic heuristic search method for solving it.
A new hybrid genetic algorithm for the collection scheduling problem for a satellite constellation
Journal of the Operational Research Society, 2019
Many heuristics and meta-heuristics problem-solving methods have been proposed so far to solve the NP-hard multi-satellite collection scheduling problem (m-SatCSP). In particular, genetic algorithms (GAs), well-suited for large scale problems, its simplicity and low cost implementation have been pervasive. However, most contributions largely emphasise simple variant or basic GA principles promotion, overlooking prior problem structure exploitation or potential problem-solving benefits that may be conveyed from similar combinatorial optimisation problems such as the vehicle routing problem with time windows (VRPTW). In fact, despite some recognised similarity with VRPTW and early investigation on limited exact methods, few efforts have been successfully reported to adapt efficient advanced specialpurpose problem-solving techniques to m-SatCSP. In this paper, a VRPTW-based hybrid genetic algorithm is proposed to tackle the single objective static m-SatCSP. The advocated approach combines and adapts well-known routing heuristics knowledge with standard genetic operator principles to efficiently explore promising search regions, manage constraint handling and improve solution quality. The hybrid strategy co-evolves two populations of solution plan individuals, maximising expected collection value while concurrently densifying collection paths to minimise orbit demand. Computational results show the approach to be cost-effective and competitive in comparison to some recent methods inspired from the best reported m-SatCSP heuristics.
7th International Conference on Operations Research and Enterprise Systems (ICORES 2018), 2018
The operational use of satellite systems has been increasing due to technological advances and the reduced costs of satellites and their launching. As such it has become more relevant to determine how to better use these new capabilities which is reflected in an increase in application studies in this area. This work focuses on the problem of developing the scheduling of a constellation of satellites and associated ground stations to monitor different types of locations (targets) with different priorities for a given planning horizon. In order to address this problem we will propose a new model that considers explicitly the operational requirements of Brazilian relevant scenarios for a given planning horizon and target priority list. The methodology to be developed to solve this model will also be discussed.
Mission planning and scheduling for Earth observation space system
Mission planning and scheduling for Earth observation space system, 2020
Planning and scheduling systems are needed to manage Earth-observing satellites for satisfying the optimum usage of the constellation's resources. This is a combinatorial optimization NP-hard problem that is solved in this paper using the constraint programming technique. The proposed system can deal with a heterogeneous constellation that consists of satellites with different maneuverability, placed in different orbits, and loaded with different payloads. The system's user can choose one of six optimization objectives, three of them were not used before, for constructing the satellites' mission plan. Searching within the system is performed using one of five different search algorithms. The system produces plans with different planning horizons ranging from one track to more than one month. The obtained results depict that the proposed system behaves, comparatively, in a perfect manner even when dealing with a complicated case study consisting of three satellites, 2,500 targets, and a one-month planning horizon.
2007
Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the request of users. This article is concerned with the management of several satellites performing multiple orbits over a given planning horizon. It describes a tabu search heuristic for the problem of selecting and scheduling the requests to be satisfied, under operational constraints. An upper bounding procedure based on column generation is used to evaluate the quality of the solutions. The results of extensive computational experiments performed on data provided by the French Centre National d'Études Spatiales are reported.
A Constraint-Based Approach to Satellite Scheduling
2001
Satellite scheduling, like all scheduling, is the problem of mapping tasks (observation, communication, downlink, control maneuvers, etc.) to resources (sensor satellites, relay satellites, ground stations, etc.). Through our work on satellite scheduling problems, we have encountered many different constraints that are particular to the satellite-scheduling domain. In this paper, we will introduce the satellite mission-operation scheduling problem, describing the problem constraints that are particular to satellite scheduling, and then present the constraint-based techniques that we have used to address these problems.
Heuristic Scheduling Algorithm Oriented Dynamic Tasks for Imaging Satellites
Mathematical Problems in Engineering, 2014
Imaging satellite scheduling is an NP-hard problem with many complex constraints. This paper researches the scheduling problem for dynamic tasks oriented to some emergency cases. After the dynamic properties of satellite scheduling were analyzed, the optimization model is proposed in this paper. Based on the model, two heuristic algorithms are proposed to solve the problem. The first heuristic algorithm arranges new tasks by inserting or deleting them, then inserting them repeatedly according to the priority from low to high, which is named IDI algorithm. The second one called ISDR adopts four steps: insert directly, insert by shifting, insert by deleting, and reinsert the tasks deleted. Moreover, two heuristic factors, congestion degree of a time window and the overlapping degree of a task, are employed to improve the algorithm’s performance. Finally, a case is given to test the algorithms. The results show that the IDI algorithm is better than ISDR from the running time point of v...
A Heuristic Algorithm for the Resource Assignment Problem in Satellite Telecommunication Networks
This paper proposes a heuristic algorithm for solving the scheduling of capacity requests and the periodic assignment of radio re-sources in a geostationary satellite network with a star topology. The network uses the Demand Assigned Multiple Access protocol in the link layer, and the Multi-Frequency Time Division Multiple Access (MF-TDMA) as well as the Adaptive Coding and Modulation protocols in the physical layer. The proposed algorithm allows processing a given traffic profile with message expiration time as delay constrains and a maximum packet-loss rate. The processing is completed using the minimum possible spectrum bandwidth. When there is not any structure imposed to the MF-TDMA super-frame, the resource-assignment problem becomes a combinatorial optimization problem which can be seen as a two-dimension (2D) oriented strip packing problem with additional constrains. The well-known Best Fit Decreasing heuristic for 2D packing is used as a basis for the proposed allocation al...
Optimal approach for building scheduling algorithm in satellite communication
International Journal of Engineering & Technology, 2018
Building scheduling algorithms in satellite communication links became a necessity according to the typical problems that satellite networks suffers from, such as congestions, jamming, mobility, atmospheric impairment, and achieving the quality of service (QoS) requirements. However, building efficient algorithms needs several considerations that should be taken into account. Such as satellite and earth station node(s), link parameters and specifications, along with the service requirements and limitations. This paper presents efficient approach for accumulating the effective considerations that the designer should employ as a framework for building proper and efficient scheduling algorithm. The proposed approach provides proper solutions to the satellite communications impairments and satisfies the quality of service requirements in satellite communication networks.