Optimal trajectory planning for multiple asteroid tour mission by means of an incremental bio-inspired tree search algorithm

Aram Vroom, M. D. Carlo, Juan Manuel Romero Martin, M. Vasile
{"title":"Optimal trajectory planning for multiple asteroid tour mission by means of an incremental bio-inspired tree search algorithm","authors":"Aram Vroom, M. D. Carlo, Juan Manuel Romero Martin, M. Vasile","doi":"10.1109/SSCI.2016.7850108","DOIUrl":null,"url":null,"abstract":"In this paper, a combinatorial optimisation algorithm inspired by the Physarum Polycephalum mould is presented and applied to the optimal trajectory planning of a multiple asteroid tour mission. The Automatic Incremental Decision Making And Planning (AIDMAP) algorithm is capable of solving complex discrete decision making problems with the use of the growth and exploration of the decision network. The stochastic AIDMAP algorithm has been tested on two discrete astrodynamic decision making problems of increased complexity and compared in terms of accuracy and computational cost to its deterministic counterpart. The results obtained for a mission to the Atira asteroids and to the Main Asteroid Belt show that this non-deterministic algorithm is a good alternative to the use of traditional deterministic combinatorial solvers, as the computational cost scales better with the complexity of the problem.","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":"3","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.7850108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, a combinatorial optimisation algorithm inspired by the Physarum Polycephalum mould is presented and applied to the optimal trajectory planning of a multiple asteroid tour mission. The Automatic Incremental Decision Making And Planning (AIDMAP) algorithm is capable of solving complex discrete decision making problems with the use of the growth and exploration of the decision network. The stochastic AIDMAP algorithm has been tested on two discrete astrodynamic decision making problems of increased complexity and compared in terms of accuracy and computational cost to its deterministic counterpart. The results obtained for a mission to the Atira asteroids and to the Main Asteroid Belt show that this non-deterministic algorithm is a good alternative to the use of traditional deterministic combinatorial solvers, as the computational cost scales better with the complexity of the problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于增量生物启发树搜索算法的多小行星漫游任务最优轨迹规划
本文提出了一种受多头绒泡菌模型启发的组合优化算法,并将其应用于多小行星漫游任务的最优轨迹规划。AIDMAP (Automatic Incremental Decision Making And Planning)算法利用决策网络的生长和探索来解决复杂的离散决策问题。在两个日益复杂的离散天体动力学决策问题上,对随机AIDMAP算法进行了测试,并在精度和计算成本方面与确定性算法进行了比较。对Atira小行星和主小行星带任务的结果表明,该非确定性算法是传统确定性组合求解方法的一个很好的替代方案,因为计算成本与问题的复杂性成比例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary dynamic optimisation of airport security lane schedules Variable Neighbourhood Search: A case study for a highly-constrained workforce scheduling problem Local modes-based free-shape data partitioning A dynamic truck dispatching problem in marine container terminal Spaceplane trajectory optimisation with evolutionary-based initialisation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1