A Space Telescope Scheduling Approach for Space Debris Observation
Author Information
Author(s): Zhang Kaiyuan, Ye Bao-Lin, Xia Xiaoyun, Wang Zijia, Zhang Xianchao, Jiang Hai
Primary Institution: School of Information Science and Engineering, Jiaxing University, Jiaxing, China
Hypothesis
Can a heuristic algorithm effectively schedule telescope observations of space debris to maximize observation value?
Conclusion
The proposed heuristic algorithm significantly improves the scheduling efficiency for observing space debris.
Supporting Evidence
- The algorithm effectively reduces the dimensionality of the scheduling problem.
- Simulation experiments showed improved scheduling efficiency compared to traditional methods.
- The proposed coding and decoding methods help in managing the observation queue effectively.
Takeaway
This study created a smart way to schedule when telescopes look at space junk, helping to see more of it faster.
Methodology
The study used a heuristic algorithm that combines problem decomposition and adaptive variable neighborhood search to optimize telescope scheduling.
Limitations
The problem decomposition strategy may discard some observable periods of targets, which could affect the overall observation value.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website