首页> 外文会议>AAS/AIAA astrodynamics specialist conference >OPTIMAL FINITE-THRUST RENDEZVOUS TRAJECTORIES FOUND VIA PARTICLE SWARM ALGORITHM
【24h】

OPTIMAL FINITE-THRUST RENDEZVOUS TRAJECTORIES FOUND VIA PARTICLE SWARM ALGORITHM

机译:通过粒子群算法找到最优的有限推力交会轨迹

获取原文

摘要

The particle swarm optimization technique is a population-based stochasticmethod developed in recent years and successfully applied in several fields ofresearch. It represents a very intuitive (and easy to program) methodology forglobal optimization, inspired by the behavior of bird flocks while searching forfood. The particle swarm optimization technique attempts to take advantage ofthe mechanism of information sharing that affects the overall behavior of aswarm, with the intent of determining the optimal values of the unknown parametersof the problem under consideration. This research applies the techniqueto determining optimal continuous-thrust rendezvous trajectories in a rotatingEuler-Hill frame. Hamiltonian methods are employed to translate the relatedoptimal control problems into parameter optimization problems. Thus theparameters sought by the swarming algorithm are primarily the initial values ofthe costates and the final time. The algorithm at hand is extremely easy to program.Nevertheless, it proves to be effective, reliable, and numerically accuratein solving the rendezvous optimization problems considered in this work.
机译:粒子群优化技术是一种基于种群的随机算法 近年来开发的方法已成功应用于以下领域 研究。它代表了一种非常直观(且易于编程)的方法 全局优化,灵感来自鸟群在搜索过程中的行为 食物。粒子群优化技术试图利用 信息共享的机制会影响一个人的整体行为 为了确定未知参数的最佳值而蜂拥而至 正在考虑的问题。本研究应用技术 确定旋转中的最佳连续推力交会轨迹 欧拉山框架。哈密​​顿方法被用来翻译相关的 将最优控制问题转化为参数优化问题。就这样 群算法寻求的参数主要是的初始值 服装和最后的时间。手头的算法非常容易编程。 但是,它被证明是有效,可靠且在数值上准确的 解决这项工作中考虑的集合优化问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号