An Interpolated Approach for Active Debris Removal

João Batista Rodrigues Neto, G. Ramos
{"title":"An Interpolated Approach for Active Debris Removal","authors":"João Batista Rodrigues Neto, G. Ramos","doi":"10.1109/CEC55065.2022.9870437","DOIUrl":null,"url":null,"abstract":"The continuous use of satellite networks in the Low Earth Orbit (LEO) has accumulated a large amount of space debris. Given the actual state of the orbit, these debris are a threat to the active systems and to the feasibility of future operations in LEO. Now, Active Debris Removal (ADR) missions must be conducted to mitigate the debris through forced deorbitation. The best documented approaches for the ADR mission planning made use of metaheuristics, modeling the ADR as a complex variant of the TSP. However, these approaches usually fail to deal some of the ADR problem dynamics, such as large instances, mission constraints or the debris motion. In this paper we propose heuristic of continuous improvement on a genetic-based solution. Our work advances the state of the art by dealing with large real world instances, modeling all the constraints and considering the problem time dependence (motion). Experiments were conducted to evidence the improvements over the literature. With the ability of generating time-dependent results for scenarios with thousands of debris in a feasible time, our approach yielded missions 96.33 % more effective at the cleaning job than the present ones on the literature.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The continuous use of satellite networks in the Low Earth Orbit (LEO) has accumulated a large amount of space debris. Given the actual state of the orbit, these debris are a threat to the active systems and to the feasibility of future operations in LEO. Now, Active Debris Removal (ADR) missions must be conducted to mitigate the debris through forced deorbitation. The best documented approaches for the ADR mission planning made use of metaheuristics, modeling the ADR as a complex variant of the TSP. However, these approaches usually fail to deal some of the ADR problem dynamics, such as large instances, mission constraints or the debris motion. In this paper we propose heuristic of continuous improvement on a genetic-based solution. Our work advances the state of the art by dealing with large real world instances, modeling all the constraints and considering the problem time dependence (motion). Experiments were conducted to evidence the improvements over the literature. With the ability of generating time-dependent results for scenarios with thousands of debris in a feasible time, our approach yielded missions 96.33 % more effective at the cleaning job than the present ones on the literature.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
主动碎片去除的插值方法
近地轨道卫星网络的持续使用积累了大量的空间碎片。考虑到轨道的实际状态,这些碎片对主动系统和未来低轨道运行的可行性构成威胁。现在,主动碎片清除(ADR)任务必须通过强制离轨来减轻碎片。ADR任务规划的最佳记录方法是使用元启发式方法,将ADR建模为TSP的复杂变体。然而,这些方法通常不能处理一些ADR动力学问题,如大型实例、任务约束或碎片运动。在本文中,我们提出了启发式的持续改进的遗传为基础的解决方案。我们的工作通过处理大型现实世界实例,建模所有约束并考虑问题时间依赖性(运动)来推进艺术状态。进行了实验来证明文献的改进。由于能够在可行的时间内为具有数千个碎片的场景生成与时间相关的结果,我们的方法在清理工作中产生的任务效率比文献中现有的任务高96.33%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impacts of Single-objective Landscapes on Multi-objective Optimization Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling Global and Local Area Coverage Path Planner for a Reconfigurable Robot A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem Test Case Prioritization and Reduction Using Hybrid Quantum-behaved Particle Swarm Optimization
×
引用
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