改进遗传算法的在轨组装路径规划
|
摘要
大规模航天器以在轨组装的方式进行空间部署时,常采用交会对接与辅助机构结合工作的方式完成组装,因此组装过程必须为装配过程规划安全的接近路径和工作区域,以避免组装过程中的碰撞风险。在组装卫星的相对轨道运动模型基础上,建立了组装过程中的动态环境模型,针对在轨组装的位置、时间精度的同时优化改进了传统遗传算法,设计了基于改进遗传算法的在轨组装路径寻优方法。仿真结果表明,提出的算法寻求的最优路径能够较好地满足在轨组装的有效性、安全性以及高精度的要求,并且算法收敛性和稳定性好。
For the space deployment of large-scale spacecraft assembly on orbit,the vehicle is generally operated by rendezvous and docking,as well as auxiliary devices.A secure plan for approaching the trajectory and operation area is necessary to avoid collision risk during assembly.To assemble the relative track motion model of satellite,a dynamic environment model was established in the assembly process.A traditional genetic algorithm was improved by focusing on the on-orbit assembly location and time precision,and an on-orbit assembly path optimization method was designed on the basis of the improved genetic algorithm.The simulation result shows that the optimal path sought by the proposed algorithm can properly meet the effectiveness,safety,and high-precision requirement of onorbit assembly.In addition,the convergence and stability of the algorithm are excellent.
For the space deployment of large-scale spacecraft assembly on orbit,the vehicle is generally operated by rendezvous and docking,as well as auxiliary devices.A secure plan for approaching the trajectory and operation area is necessary to avoid collision risk during assembly.To assemble the relative track motion model of satellite,a dynamic environment model was established in the assembly process.A traditional genetic algorithm was improved by focusing on the on-orbit assembly location and time precision,and an on-orbit assembly path optimization method was designed on the basis of the improved genetic algorithm.The simulation result shows that the optimal path sought by the proposed algorithm can properly meet the effectiveness,safety,and high-precision requirement of onorbit assembly.In addition,the convergence and stability of the algorithm are excellent.
引文
[1]ZHANG S,FRISWELL M I,WAGG D J,et al.Rapid path planning for zero-propellant maneuvers[J].Journal of aerospace engineering,2015,29(3):04015078.
[2]郭铁丁.深空探测小推力轨迹优化的间接法与伪谱法研究[D].北京:清华大学,2012:4-7.GUO Tieding.Study of indirect and pseudospectral methods for low thrust trajectory optimization in deep space exploration[D].Beijing:Tsinghua University,2012:4-7.
[3]VINH N.Optimal trajectories in atmospheric flight[M].Amsterdam:Elsevier Scientific Publishing Company,2012:78-100.
[4]ISTRATIE V.Optimal entry into atmosphere with minimum heat and constraints[C]∥Atmospheric Flight Mechanics Conference and Exhibit.Austin,Texas,USA,2013:1-3.
[5]PING L U,VINH N X.Optimal control problems with maximum functional[J].Journal of guidance control&dynamics,1991,14(6):1215-1223.
[6]HUANG G Q,LU Y P,NAN Y.A survey of numerical algorithms for trajectory optimization of flight vehicles[J].Science China technological sciences,2012,55(9):2538-2560.
[7]SIMS J A,FINLAYSON P A,RINDERLE E A,et al.Implementation of a low-thrust trajectory optimization algorithm for preliminary design[M].Pasadena:CA,Jet propulsion laboratory,national aeronautics and space administration,2006:1-8.
[8]康炳南,唐硕.基于非线性规划的高超声速滑翔轨迹优化[J].飞行力学,2008,26(3):49-52.KANG Bingnan,TANG Shuo.Optimization of hypersonic glide trajectory based on nonlinear planning[J].Flight dynamics,2008,26(3):49-52.
[9]KANG W,BEDROSSIAN N.Pseudospectral optimal control theory makes debut flight,saves NASA$1 M in under three hours[J].SIAM news,2007,40(7):1-3.
[10]MUELLER J B,GRIESEMER P R,THOMAS S J.Avoidance maneuver planning incorporating station-keeping constraints and automatic relaxation[J].Journal of aerospace information systems,2015,10(10):306-322.
[11]SCHAUB H,VADALI S R,ALFRIEND K T.Initial condition and fuel optimal control for formation flying satellites[C]//AIAA Guidance,Navigation and Control Conference.Portland,USA:1999:1-10.
[12]MANOLESCU S.Optimal symmetric trajectories over a fixed-time domain[J].AIAA Paper,1993:93,3848.
[13]TOGAN V,DALO GLU A T.An improved genetic algorithm with initial population strategy and self-adaptive member grouping[J].Computers&structures,2008,86(11):1204-1218.
[2]郭铁丁.深空探测小推力轨迹优化的间接法与伪谱法研究[D].北京:清华大学,2012:4-7.GUO Tieding.Study of indirect and pseudospectral methods for low thrust trajectory optimization in deep space exploration[D].Beijing:Tsinghua University,2012:4-7.
[3]VINH N.Optimal trajectories in atmospheric flight[M].Amsterdam:Elsevier Scientific Publishing Company,2012:78-100.
[4]ISTRATIE V.Optimal entry into atmosphere with minimum heat and constraints[C]∥Atmospheric Flight Mechanics Conference and Exhibit.Austin,Texas,USA,2013:1-3.
[5]PING L U,VINH N X.Optimal control problems with maximum functional[J].Journal of guidance control&dynamics,1991,14(6):1215-1223.
[6]HUANG G Q,LU Y P,NAN Y.A survey of numerical algorithms for trajectory optimization of flight vehicles[J].Science China technological sciences,2012,55(9):2538-2560.
[7]SIMS J A,FINLAYSON P A,RINDERLE E A,et al.Implementation of a low-thrust trajectory optimization algorithm for preliminary design[M].Pasadena:CA,Jet propulsion laboratory,national aeronautics and space administration,2006:1-8.
[8]康炳南,唐硕.基于非线性规划的高超声速滑翔轨迹优化[J].飞行力学,2008,26(3):49-52.KANG Bingnan,TANG Shuo.Optimization of hypersonic glide trajectory based on nonlinear planning[J].Flight dynamics,2008,26(3):49-52.
[9]KANG W,BEDROSSIAN N.Pseudospectral optimal control theory makes debut flight,saves NASA$1 M in under three hours[J].SIAM news,2007,40(7):1-3.
[10]MUELLER J B,GRIESEMER P R,THOMAS S J.Avoidance maneuver planning incorporating station-keeping constraints and automatic relaxation[J].Journal of aerospace information systems,2015,10(10):306-322.
[11]SCHAUB H,VADALI S R,ALFRIEND K T.Initial condition and fuel optimal control for formation flying satellites[C]//AIAA Guidance,Navigation and Control Conference.Portland,USA:1999:1-10.
[12]MANOLESCU S.Optimal symmetric trajectories over a fixed-time domain[J].AIAA Paper,1993:93,3848.
[13]TOGAN V,DALO GLU A T.An improved genetic algorithm with initial population strategy and self-adaptive member grouping[J].Computers&structures,2008,86(11):1204-1218.