Adaptive gaining-sharing knowledge-based variant algorithm with historical probability expansion and its application in escape maneuver decision making
IF 10.7 2区 计算机科学Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
{"title":"Adaptive gaining-sharing knowledge-based variant algorithm with historical probability expansion and its application in escape maneuver decision making","authors":"Lei Xie, Yuan Wang, Shangqin Tang, Yintong Li, Zhuoran Zhang, Changqiang Huang","doi":"10.1007/s10462-024-11096-4","DOIUrl":null,"url":null,"abstract":"<div><p>To further improve the performance of adaptive gaining-sharing knowledge-based algorithm (AGSK), a novel adaptive gaining sharing knowledge-based algorithm with historical probability expansion (HPE-AGSK) is proposed by modifying the search strategies. Based on AGSK, three improvement strategies are proposed. First, expansion sharing strategy is proposed and added in junior gaining-sharing phase to boost local search ability. Second, historical probability expansion strategy is proposed and added in senior gaining-sharing phase to strengthen global search ability. Last, reverse gaining strategy is proposed and utilized to expand population distribution at the beginning of iterations. The performance of HPE-AGSK is initially evaluated using IEEE CEC 2021 test suite, compared with fifteen state-of-the-art algorithms (AGSK, APGSK, APGSK-IMODE, GLAGSK, EDA2, AAVS-EDA, EBOwithCMAR, LSHADE-SPACMA, HSES, IMODE, MadDE, CJADE, and iLSHADE-RSP). The results demonstrate that HPE-AGSK outperforms both state-of-the-art GSK-based variants and past winners of IEEE CEC competitions. Subsequently, GSK-based variants and other exceptional algorithms in CEC 2021 are selected to further evaluate the performance of HPE-AGSK using IEEE CEC 2018 test suite. The statistical results show that HPE-AGSK has superior exploration ability than the comparison algorithms, and has strong competition with APGSK (state-of-the-art AGSK variant) and IMODE (CEC 2020 Winner) in exploitation ability. Finally, HPE-AGSK is utilized to solve the beyond visual range escape maneuver decision making problem. Its success rate is 100%, and mean maneuver time is 9.10 s, these results show that HPE-AGSK has good BVR escape maneuver decision-making performance. In conclusion, HPE-AGSK is a highly promising AGSK variant that significantly enhances the performance, and is an outstanding development of AGSK. The code of HPE-AGSK can be downloaded from https://github.com/xieleilei0305/HPE-AGSK-CODE.git. (The link will be available for readers after the paper is published).</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 6","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11096-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11096-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
To further improve the performance of adaptive gaining-sharing knowledge-based algorithm (AGSK), a novel adaptive gaining sharing knowledge-based algorithm with historical probability expansion (HPE-AGSK) is proposed by modifying the search strategies. Based on AGSK, three improvement strategies are proposed. First, expansion sharing strategy is proposed and added in junior gaining-sharing phase to boost local search ability. Second, historical probability expansion strategy is proposed and added in senior gaining-sharing phase to strengthen global search ability. Last, reverse gaining strategy is proposed and utilized to expand population distribution at the beginning of iterations. The performance of HPE-AGSK is initially evaluated using IEEE CEC 2021 test suite, compared with fifteen state-of-the-art algorithms (AGSK, APGSK, APGSK-IMODE, GLAGSK, EDA2, AAVS-EDA, EBOwithCMAR, LSHADE-SPACMA, HSES, IMODE, MadDE, CJADE, and iLSHADE-RSP). The results demonstrate that HPE-AGSK outperforms both state-of-the-art GSK-based variants and past winners of IEEE CEC competitions. Subsequently, GSK-based variants and other exceptional algorithms in CEC 2021 are selected to further evaluate the performance of HPE-AGSK using IEEE CEC 2018 test suite. The statistical results show that HPE-AGSK has superior exploration ability than the comparison algorithms, and has strong competition with APGSK (state-of-the-art AGSK variant) and IMODE (CEC 2020 Winner) in exploitation ability. Finally, HPE-AGSK is utilized to solve the beyond visual range escape maneuver decision making problem. Its success rate is 100%, and mean maneuver time is 9.10 s, these results show that HPE-AGSK has good BVR escape maneuver decision-making performance. In conclusion, HPE-AGSK is a highly promising AGSK variant that significantly enhances the performance, and is an outstanding development of AGSK. The code of HPE-AGSK can be downloaded from https://github.com/xieleilei0305/HPE-AGSK-CODE.git. (The link will be available for readers after the paper is published).
期刊介绍:
Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.