首页> 外文会议>IAF Astrodynamics Symposium;International Astronautical Congress >Artificial Neural Network For Preliminary Multiple NEA Rendezvous Mission Using Low Thrust
【24h】

Artificial Neural Network For Preliminary Multiple NEA Rendezvous Mission Using Low Thrust

机译:使用低推力的人工神经网络初步多NEA Rendezvous任务

获取原文
获取外文期刊封面目录资料

摘要

Since the 1960s the study of near-Earth asteroids (NEAs) has become extremely interesting for science, Earth protection, and future exploitation of their resources. The knowledge of these objects can be considerably improved by multiple NEA rendezvous missions with close-up observations of several asteroids. Given the enormous number of NEAs, which have been discovered until now, it becomes paramount to develop a method for quick identification of the transfer time and cost. This work develops a methodology based on Artificial Neural Networks (ANN) to identify a preliminary multiple NEA rendezvous trajectory using low-thrust propulsion. It takes advantage of the ANN capability to map the transfer time and cost starting from parameters that can describe the initial and final orbits and boundary conditions of the transfer. The ANN architecture and parameters are tuned to provide an optimal performance. The outcome of the network is used as input in a combinatorial problem to search for the asteroid sequence to visit, where a tree-search method is employed. Once the multiple rendezvous sequence is identified, the feasibility of the transfer with the given propulsion system is studied. Thus, an optimal control problem is solved for each leg by means of an optimisation solver based on pseudospectral method. The performance of the presented method is assessed by conducting analyses of sequences of asteroids of interest using different low-thrust options, such as solar electric propulsion and solar sailing.
机译:自20世纪60年代以来,对近地球小行星(猫鼬)的研究对于科学,地球保护和对资源的未来利用变得非常有趣。多个NEA Rendezvous任务可以显着改善对这些物体的知识,具有几个小行星的特写观测。鉴于直到现在发现的巨大的BEES,开发用于快速识别转移时间和成本的方法变得至高。该工作基于人工神经网络(ANN)的方法开发了一种使用低推力推进的初步多NEA Rendezvous轨迹。它利用ANN功能来映射从可以描述传输的初始和最终轨道和边界条件的参数开始的转移时间和成本。调整ANN架构和参数以提供最佳性能。网络的结果用作组合问题中的输入,以搜索用于访问的小行星序列,其中采用树搜索方法。一旦确定了多个Rendezvous序列,研究了与给定推进系统的转移的可行性。因此,通过基于假谱法的优化求解器来解决每个腿的最佳控制问题。通过使用不同的低推力选择的小行星序列进行分析来评估所提出的方法的性能,例如太阳能推进和太阳能帆船。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号