Approximate path searching method for single-satellite observation and transmission task planning problem
Summary: Satellite task planning not only plans the observation tasks to collect images of the earth surface, but also schedules the transmission tasks to download images to the ground station for users' using, which plays an important role in improving the efficiency of the satellite observation system. However, most of the work to our knowledge, scheduling the observation and transmission tasks separately, ignores the correlation between them in resource (e.g., energy and memory) consumption and acquisition. In this paper, we study the single-satellite observation and transmission task planning problem under a more accurate resource usage model. Two preprocessing strategies including graph partition and nondominated subpaths selection are used to decompose the problem, and an improved label-setting algorithm with the lower bound cutting strategy is proposed to maximize the total benefit. Finally, we compare the proposed method with other three algorithms based on three data sets, and the experimental result shows that our method can find the near-optimal solution in much less time.
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Multi satellites scheduling algorithm based on task merging mechanism
- A constraint-based approach to satellite scheduling
- scientific article; zbMATH DE number 2050786
- Planning the control of survey devices for a system of satellites
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A label-setting algorithm for finding a quickest path
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
- scientific article; zbMATH DE number 2050786 (Why is no real title available?)
- On the tractability of satellite range scheduling
- Optimization-based scheduling for the single-satellite, multi-ground station communication problem
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
- Scheduling space-ground communications for the air force satellite control network
- Three scheduling algorithms applied to the Earth observing systems domain
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Path planning for rapid large-angle maneuver of satellites based on the Gauss pseudospectral method
- Application of unified methodical approach to online planning of target operation of satellite monitoring and communication systems
- Scheduling of Earth observing satellites using distributed constraint optimization
This page was built for publication: Approximate path searching method for single-satellite observation and transmission task planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993086)
