A dimension reduction guidance method for orbital pursuit-evasion games

Cheng-ming Zhang, Yanwei Zhu, Le-ping Yang, Weiwei Cai
{"title":"A dimension reduction guidance method for orbital pursuit-evasion games","authors":"Cheng-ming Zhang, Yanwei Zhu, Le-ping Yang, Weiwei Cai","doi":"10.1109/CCDC52312.2021.9602556","DOIUrl":null,"url":null,"abstract":"Improving on-orbit service techniques with non-cooperative spacecraft is attracting more and more scholars' attention. The free time orbital pursuit-evasion problem is a typical problem in this field. Generally, solving the orbital pursuit-evasion game results in solving a 24-dimension two points boundary value problem which is really complicated with such high dimension and the numerical methods used to obtain the solution is sensitive to the initial estimate of the costates. To overcome the weaknesses, this paper presents a dimension reduction guidance method to transform the free-time orbital pursuit-evasion game into a 3-dimension parameters optimization problem based on the costate normalization technique where each of the parameters needs to be optimized has a strict boundary. Comparing to the previous methods, the decrease of the dimension and the boundary of the parameters reduce the searching space together. The simulation results and the statistical analysis demonstrate that this method is efficient and it improves the computation consumption 67.7% comparing with the classical genetic algorithm.","PeriodicalId":143976,"journal":{"name":"2021 33rd Chinese Control and Decision Conference (CCDC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 33rd Chinese Control and Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC52312.2021.9602556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Improving on-orbit service techniques with non-cooperative spacecraft is attracting more and more scholars' attention. The free time orbital pursuit-evasion problem is a typical problem in this field. Generally, solving the orbital pursuit-evasion game results in solving a 24-dimension two points boundary value problem which is really complicated with such high dimension and the numerical methods used to obtain the solution is sensitive to the initial estimate of the costates. To overcome the weaknesses, this paper presents a dimension reduction guidance method to transform the free-time orbital pursuit-evasion game into a 3-dimension parameters optimization problem based on the costate normalization technique where each of the parameters needs to be optimized has a strict boundary. Comparing to the previous methods, the decrease of the dimension and the boundary of the parameters reduce the searching space together. The simulation results and the statistical analysis demonstrate that this method is efficient and it improves the computation consumption 67.7% comparing with the classical genetic algorithm.
一种轨道追逃博弈的降维制导方法
改进非合作航天器在轨服务技术正受到越来越多学者的关注。自由时间轨道追逃问题是该领域的一个典型问题。一般来说,求解轨道追逃博弈的结果是求解一个24维两点边值问题,这个问题在如此高维的情况下非常复杂,而且求解所采用的数值方法对初始估计很敏感。为了克服这一缺点,本文提出了一种降维制导方法,将自由时间轨道追逃博弈转化为一个基于协态归一化技术的三维参数优化问题,其中每个需要优化的参数都有严格的边界。与以前的方法相比,维数的减少和参数边界的缩小共同减少了搜索空间。仿真结果和统计分析表明,该方法是有效的,与经典遗传算法相比,计算量提高了67.7%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信