A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies
With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, espe...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Biomimetics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2313-7673/9/12/718 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850239611739045888 |
|---|---|
| author | Kaiyuan Zhang Bao-Lin Ye Xiaoyun Xia Zijia Wang Xianchao Zhang Hai Jiang |
| author_facet | Kaiyuan Zhang Bao-Lin Ye Xiaoyun Xia Zijia Wang Xianchao Zhang Hai Jiang |
| author_sort | Kaiyuan Zhang |
| collection | DOAJ |
| description | With the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem. In order to accelerate the solving speed of algorithms on large-scale problems, this paper combines the characteristics of the problem and partitions the large-scale problem into multiple sub-problems according to the observation time. In each sub-problem, a coding method based on the priority of the target going into the queue is proposed in combination with the actual observation data, and a decoding method matching the coding method is designed. In the solution process for each sub-problem, an adaptive variable neighborhood search is used to solve the space debris observation plan. When solving all sub-problems is completed, the observation plans obtained on all sub-problems are combined to obtain the observation plan of the original problem. |
| format | Article |
| id | doaj-art-bde2011dd39e4d8985d4bc7b59249398 |
| institution | OA Journals |
| issn | 2313-7673 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Biomimetics |
| spelling | doaj-art-bde2011dd39e4d8985d4bc7b592493982025-08-20T02:01:06ZengMDPI AGBiomimetics2313-76732024-11-0191271810.3390/biomimetics9120718A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition StrategiesKaiyuan Zhang0Bao-Lin Ye1Xiaoyun Xia2Zijia Wang3Xianchao Zhang4Hai Jiang5School of Information Science and Engineering, Jiaxing University, Jiaxing 314001, ChinaSchool of Information Science and Engineering, Jiaxing University, Jiaxing 314001, ChinaSchool of Information Science and Engineering, Jiaxing University, Jiaxing 314001, ChinaSchool of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, ChinaInstitute of Information Network and Artificial Intelligence, Jiaxing University, Jiaxing 314001, ChinaNational Astronomical Observatories, Chinese Academy of Sciences, Beijing 100012, ChinaWith the increasing number of space debris, the demand for telescopes to observe space debris is also constantly increasing. The telescope observation scheduling problem requires algorithms to schedule telescopes to maximize observation value within the visible time constraints of space debris, especially when dealing with large-scale problems. This paper proposes a practical heuristic algorithm to solve the telescope observation of space debris scheduling problem. In order to accelerate the solving speed of algorithms on large-scale problems, this paper combines the characteristics of the problem and partitions the large-scale problem into multiple sub-problems according to the observation time. In each sub-problem, a coding method based on the priority of the target going into the queue is proposed in combination with the actual observation data, and a decoding method matching the coding method is designed. In the solution process for each sub-problem, an adaptive variable neighborhood search is used to solve the space debris observation plan. When solving all sub-problems is completed, the observation plans obtained on all sub-problems are combined to obtain the observation plan of the original problem.https://www.mdpi.com/2313-7673/9/12/718telescope observation schedulingcoding methoddecoding methodneighborhood searchcombinatorial optimization |
| spellingShingle | Kaiyuan Zhang Bao-Lin Ye Xiaoyun Xia Zijia Wang Xianchao Zhang Hai Jiang A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies Biomimetics telescope observation scheduling coding method decoding method neighborhood search combinatorial optimization |
| title | A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies |
| title_full | A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies |
| title_fullStr | A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies |
| title_full_unstemmed | A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies |
| title_short | A Space Telescope Scheduling Approach Combining Observation Priority Coding with Problem Decomposition Strategies |
| title_sort | space telescope scheduling approach combining observation priority coding with problem decomposition strategies |
| topic | telescope observation scheduling coding method decoding method neighborhood search combinatorial optimization |
| url | https://www.mdpi.com/2313-7673/9/12/718 |
| work_keys_str_mv | AT kaiyuanzhang aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT baolinye aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT xiaoyunxia aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT zijiawang aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT xianchaozhang aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT haijiang aspacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT kaiyuanzhang spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT baolinye spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT xiaoyunxia spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT zijiawang spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT xianchaozhang spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies AT haijiang spacetelescopeschedulingapproachcombiningobservationprioritycodingwithproblemdecompositionstrategies |