首页> 外文会议>International conference on hybrid artificial intelligent systems >Machine Learning of Optimal Low-Thrust Transfers Between Near-Earth Objects
【24h】

Machine Learning of Optimal Low-Thrust Transfers Between Near-Earth Objects

机译:近地物体之间最佳低推力传递的机器学习

获取原文

摘要

During the initial phase of space trajectory planning and optimization, it is common to have to solve large dimensional global optimization problems. In particular continuous low-thrust propulsion is computationally very intensive to obtain optimal solutions. In this work, we investigate the application of machine learning regressors to estimate the final spacecraft mass m_f after an optimal low-thrust transfer between two Near Earth Objects instead of solving the corresponding optimal control problem (OCP). Such low thrust transfers are of interest for several space missions currently being developed such as NASA's NEA Scout. Previous work has shown machine learning to greatly improve the estimation accuracy in the case of short transfers within the main asteroid belt. We extend this work to cover also the more complicated case of multiple-revolution transfers in the near Earth regime. In the process, we reduce the general OCP of solving for m_f to a much simpler OCP of determining the maximum initial spacecraft mass m* for which the transfer is feasible. This information, along with readily available information on the orbit geometries, is sufficient to learn the final mass m_f for the same transfer starting with any initial mass m_i. This results in a significant reduction of the computational cost compared to solving the full OCP.
机译:在空间轨迹规划和优化的初始阶段,通常必须解决大规模的全局优化问题。特别地,连续的低推力推进在计算上非常费力以获得最佳解决方案。在这项工作中,我们研究了机器学习回归器在估计两个近地天体之间的最佳低推力转换后的最终航天器质量m_f中的应用,而不是解决相应的最佳控制问题(OCP)。如此低的推力传递对于当前正在开发的若干太空任务(例如NASA的NEA侦察兵)很感兴趣。先前的研究表明,在主小行星带内进行短时传输的情况下,机器学习可以极大地提高估计精度。我们将这项工作扩展到还涵盖了近地政权中更复杂的多次革命转移的情况。在此过程中,我们将求解m_f的一般OCP简化为确定可行的最大初始航天器质量m *的简单得多的OCP。该信息以及有关轨道几何形状的容易获得的信息,足以了解从任何初始质量m_i开始的相同传递的最终质量m_f。与解决完整的OCP相比,这将显着降低计算成本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号