Resources Scheduling Algorithm for Multi-relay-Satellite System with Multi-restriction

2019 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)(2019)

引用 1|浏览0
暂无评分
摘要
According to the multi-restriction in the relay resource scheduling of multi-satellite, a constraint satisfaction model is established. A scheduling algorithm based on ant genetic algorithm is proposed, which optimizes missions scheduling sequence and choices of resources by double-layer coding. Considering the multi-mission, multi-satellite, multi-window and missions PRI, the available time-window is dynamically refreshed according to the conflicts between scheduling missions. The missions scheduling sequence is optimized by ant algorithm with different sizes of windows. The choices of relay satellites resources are optimized by adaptive niche genetic algorithm to achieve optimal scheduling scheme. The simulation result reveals that the double-layer optimization algorithm is better than single-layer optimization algorithm, and the algorithm obtains satisfactory results in both time and optimization, which is suitable for resources scheduling problem with multi-restriction, multi-mission and multi-satellite.
更多
查看译文
关键词
Task analysis,Satellites,Relays,Scheduling,Optimal scheduling,Mathematical model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要