检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙兆伟[1] 刘雪奎[1] 吴限德[2] 邓泓[1]
机构地区:[1]哈尔滨工业大学卫星技术研究所,黑龙江哈尔滨150080 [2]哈尔滨工程大学航天与建筑工程学院,黑龙江哈尔滨150001
出 处:《光学精密工程》2013年第12期3308-3316,共9页Optics and Precision Engineering
基 金:长江学者和创新团队发展计划资助项目(No.IRT0520);中央高校基本科研业务费资助项目(No.HEUCFZ1126;No.HEUCF021318)
摘 要:为实现通信保障航天器的大范围轨道机动,提出了融合遗传和蚁群算法的通信保障航天器机动路径规划方法。首先,建立了空间飞行器的轨道运动模型,在此基础上研究了遗传算法和蚁群算法的融合策略,利用遗传算法在初期的快速收敛性以及蚁群算法在后期的高效性,分别设计了融合算法中的遗传算法和蚁群算法,并给出融合算法的运行过程。最后,对本文提出的路径规划进行了仿真验证。结果表明:融合算法完成100次迭代后,目标函数即可达到稳定区间;安全路径平均长度为4.055 3×104 m。结果验证了基于遗传-蚁群融合算法的机动轨道规划具有更快的收敛速度,能够在更短的时间内规划出到达故障航天器的飞行路径,显著提高了规划效率。To implement the orbit maneuvering of a communication supporting spacecraft in a large area,the path planning of the communication supporting spacecraft was proposed based on the fusion of ant colony and genetic algorithms.Firstly,the orbit dynamic model of spacecraft was established,and the fusion scheme of the genetic and ant colony algorithms was studied.On the basis of the fast convergence of genetic algorithm and the higher efficiency of colony algorithm,the genetic and ant colony algorithms were redesigned respectively under a fusion framework,and the operation process was presented.Finally,the path planning was simulated.The simulation results show that the fusion algorithm can reach the stabilization after 100 iterations,and the average safety path length is 4.055 3 × 104 m.These results prove that the convergence speed of maneuvering orbit planning based on genetic and ant colony fusion is fast,and the flight path to a fault of spacecraft can be obtained in a shorter time,which raises the efficiency of orbit planning remarkably.
关 键 词:路径规划 遗传算法 蚁群算法 轨道机动 通信保障航天器
分 类 号:V412.41[航空宇航科学与技术—航空宇航推进理论与工程] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.194