...
首页> 外文期刊>Acta astronautica >Time-optimal trajectory planning for underactuated spacecraft using a hybrid particle swarm optimization algorithm
【24h】

Time-optimal trajectory planning for underactuated spacecraft using a hybrid particle swarm optimization algorithm

机译:基于混合粒子群算法的欠驱动航天器时间最优轨迹规划

获取原文
获取原文并翻译 | 示例
           

摘要

A hybrid algorithm combining particle swarm optimization (PSO) algorithm with the Legendre pseudospectral method (LPM) is proposed for solving time-optimal trajectory planning problem of underactuated spacecrafts. At the beginning phase of the searching process, an initialization generator is constructed by the PSO algorithm due to its strong global searching ability and robustness to random initial values, however, PSO algorithm has a disadvantage that its convergence rate around the global optimum is slow. Then, when the change in fitness function is smaller than a predefined value, the searching algorithm is switched to the LPM to accelerate the searching process. Thus, with the obtained solutions by the PSO algorithm as a set of proper initial guesses, the hybrid algorithm can find a global optimum more quickly and accurately. 200 Monte Carlo simulations results demonstrate that the proposed hybrid PSO-LPM algorithm has greater advantages in terms of global searching capability and convergence rate than both single PSO algorithm and LPM algorithm. Moreover, the PSO-LPM algorithm is also robust to random initial values.
机译:提出了一种结合粒子群算法(PSO)和勒让德伪谱法(LPM)的混合算法来解决欠驱动航天器的时间最优轨迹规划问题。在搜索过程的开始阶段,由于PSO算法具有强大的全局搜索能力和对随机初始值的鲁棒性,因此使用PSO算法构造了初始化生成器,但是PSO算法的缺点是收敛于全局最优值的速度较慢。然后,当适应度函数的变化小于预定值时,将搜索算法切换到LPM以加速搜索过程。因此,利用PSO算法获得的解作为一组适当的初始猜测,混合算法可以更快,更准确地找到全局最优值。 200个蒙特卡洛仿真结果表明,与单个PSO算法和LPM算法相比,提出的混合PSO-LPM算法在全局搜索能力和收敛速度方面具有更大的优势。此外,PSO-LPM算法对于随机初始值也很健壮。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号