Approximate path searching method for single-satellite observation and transmission task planning problem

DOI10.1155/2017/7304506zbMath1426.90272OpenAlexW2779658427MaRDI QIDQ1993086

Shuang Peng, Ning Jing, Jun Li, Hao Chen

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/7304506

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
• Optimization-based scheduling for the single-satellite, multi-ground station communication problem
• Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
• Scheduling for single agile satellite, redundant targets problem using complex networks theory
• Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• A label-setting algorithm for finding a quickest path
• On the tractability of satellite range scheduling
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• Scheduling space-ground communications for the air force satellite control network
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite

This page was built for publication: Approximate path searching method for single-satellite observation and transmission task planning problem