Fast approximators for optimal low-thrust hops between main belt asteroids

Daniel Hennes, D. Izzo, D. Landau
{"title":"Fast approximators for optimal low-thrust hops between main belt asteroids","authors":"Daniel Hennes, D. Izzo, D. Landau","doi":"10.1109/SSCI.2016.7850107","DOIUrl":null,"url":null,"abstract":"We consider the problem of optimally transferring a spacecraft from a starting to a target asteroid. We introduce novel approximations for important quantities characterizing the optimal transfer in case of short transfer times (asteroid hops). We propose and study in detail approximations for the phasing value φ, for the maximum initial mass m* and for the arrival mass mf. The new approximations require orders of magnitude less computational effort with respect to state-of-the-art algorithms able to compute their ground-truth value. The accuracy of the introduced approximations is also found to be orders of magnitude superior with respect to other, commonly used, approximations based, for example, on Lambert models. Our results are obtained modelling the physics of the problem as well as employing computational intelligence techniques including the multi-objective evolutionary algorithm by decomposition framework, the hypervolume indicator and state of the art machine learning regressors.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2016.7850107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

We consider the problem of optimally transferring a spacecraft from a starting to a target asteroid. We introduce novel approximations for important quantities characterizing the optimal transfer in case of short transfer times (asteroid hops). We propose and study in detail approximations for the phasing value φ, for the maximum initial mass m* and for the arrival mass mf. The new approximations require orders of magnitude less computational effort with respect to state-of-the-art algorithms able to compute their ground-truth value. The accuracy of the introduced approximations is also found to be orders of magnitude superior with respect to other, commonly used, approximations based, for example, on Lambert models. Our results are obtained modelling the physics of the problem as well as employing computational intelligence techniques including the multi-objective evolutionary algorithm by decomposition framework, the hypervolume indicator and state of the art machine learning regressors.
主带小行星间最佳低推力跳跃的快速逼近器
我们考虑了航天器从起点到目标小行星的最佳转移问题。我们引入了新的近似的重要数量表征最优转移在短转移时间(小行星跳)的情况下。我们提出并研究了相位值φ、最大初始质量m*和到达质量mf的详细近似值。与能够计算其真值的最先进算法相比,新的近似值需要的计算工作量要少几个数量级。所引入的近似值的精度也被发现优于其他常用的近似值,例如基于兰伯特模型的近似值。我们的结果是通过对问题的物理建模以及采用计算智能技术获得的,包括通过分解框架的多目标进化算法,hypervolume指示器和最先进的机器学习回归器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信