Scheduling for single agile satellite, redundant targets problem using complex networks theory
From MaRDI portal
Publication:509214
Recommendations
- A branch and bound algorithm for agile earth observation satellite scheduling
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
- scientific article; zbMATH DE number 2084747
- Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A network analysis of the Italian overnight money market
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- A simple model of global cascades on random networks
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Adequate is better: particle swarm optimization with limited-information
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Cascading failure of interdependent networks with different coupling preference under targeted attack
- Complex systems analysis of series of blackouts: Cascading failure, critical points, and self-organization
- Effective usage of shortest paths promotes transportation efficiency on scale-free networks
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- Multi satellites scheduling algorithm based on task merging mechanism
- Multiple routes transmitted epidemics on multiplex networks
- On a routing problem
- On approximating the longest path in a graph
- On the tractability of satellite range scheduling
Cited in
(8)- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Multi satellites scheduling algorithm based on task merging mechanism
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- Approximate path searching method for single-satellite observation and transmission task planning problem
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- A novel evolutionary model using the \textit{Caputo} time-fractional derivative and noise estimator for image denoising and contrast enhancement
- Three multi-objective memetic algorithms for observation scheduling problem of active-imaging agile earth observation satellites
This page was built for publication: Scheduling for single agile satellite, redundant targets problem using complex networks theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509214)