论文部分内容阅读
通过引入基函数的概念,提出了采用遗传编程求解有限推力航天器逼近非合作目标最终逼近段轨迹规划问题的方法。该方法将推力器开关状态定义为基函数,以多个基函数分别乘以开关状态持续时间再求和作为推力器开关的历程函数;将历程函数转换为遗传编程的树型结构,将消耗燃料的质量作为适应度函数,并将规避障碍物和终端逼近精度等约束条件以罚函数的形式添加到适应度函数中;利用遗传编程的模拟自然进化理论的全局寻优机制求解,最终得到最优逼近轨迹方案。某航天器在有限推力下逼近非合作目标的轨迹规划结果表明:整个逼近过程推力器仅开关5次,大大降低了对开关频率的要求,同时,规划结果比采用高斯伪谱法时逼近时间降低了30.09%,燃料消耗降低了4.18%。
By introducing the concept of basis function, a genetic programming method is proposed to solve the trajectory planning problem of the final approximation segment of a finite thrust spacecraft approaching a non-cooperative target. In the method, the state of the thruster switch is defined as the base function, and the multiplication of the base functions by the switch state duration and the summation respectively as the course functions of the thruster switch; the course function is converted into a genetic programming tree structure, As a function of fitness and constraints such as obstacle avoidance and terminal approximation accuracy are added to the fitness function in the form of a penalty function. Finally, the optimal optimal solution is obtained by using the genetic programming to simulate the global optimization mechanism of natural evolutionary theory Approaching the trajectory program. The trajectory planning of a spacecraft approaching a non-cooperative target under a finite thrust force shows that the thruster only switches on and off five times during the entire approaching process, greatly reducing the switching frequency requirement, and reducing the approaching time of the planning result over the Gaussian pseudospectral method 30.09%, fuel consumption decreased 4.18%.