面向深空探测任务的实数遗传编码多星任务规划算法

针对面向深空探测任务的多星任务规划问题,综合考虑卫星对目标时间窗口、卫星姿态机动以及工作能耗等约束条件,建立了面向深空探测任务的多星任务规划问题模型,针对常规01编码在进行大规模卫星任务规划时,存在的编码长度过长等问题,提出了一种基于实数编码方式的遗传算法,以求解面向深空探测的多星任务规划问题.该算法采用了一种以目标为染色体的实数编码方式,相比传统的以时间窗口为染色体的01编码方式,缩短了染色体长度,可有效提高算法的求解效率.通过仿真算例分析,验证了基于实数编码的遗传算法对求解多星任务规划问题的正确性、合理性和有效性,并将其与基于传统01编码方式的遗传算法进行对比分析,其结果表明基于实数编码方式的遗传算法在寻优能力和计算速度上具有明显优势,这为求解面向深空探测任务的多星任务规划问题提供了一种新的思路和方法.

Real genetic coding multi-star task planning algorithm for deep space exploration mission

For the multi-star mission planning problem, considering the constraint conditions of satellites on target time window, satellite attitude maneuvering, and satellite work energy consumption, a multi-star mission planning model is established. When the conventional 01 code is used for large-scale satellite mission planning, there are problems such as excessive code length, etc. So a real-coded genetic algorithm is proposed to solve multi-star mission planning problem. The algorithm uses a real number encoding method with the target as a chromosome. Compared with the traditional 01 encoding method in which the time window is a chromosome, the length of the chromosome is shortened, and the efficiency of the algorithm can be effectively improved. Through simulation example analysis, the correctness, rationality and effectiveness of the real-coded genetic algorithm for solving multi-star task planning problems are verified. The genetic algorithm based on the traditional 01-coded method is compared and analyzed. The results show that The genetic algorithm based on the real number coding method has obvious advantages both in the optimization ability and the calculation speed, which provides a new idea and method for solving multi-star task planning problems.