Article(id=1149773874918809604, tenantId=1146029695717560320, journalId=1146123166801305609, issueId=1149773869357167407, articleNumber=null, orderNo=null, doi=10.12404/j.issn.1671-1815.2404351, pmid=null, cstr=null, oa=null, hot=null, price=null, onlineType=0, articleFormat=0, articleType=null, articleTypeStr=null, receivedDate=1718121600000, receivedDateStr=2024-06-12, revisedDate=1738684800000, revisedDateStr=2025-02-05, acceptedDate=null, acceptedDateStr=null, onlineDate=1752057053545, onlineDateStr=2025-07-09, pubDate=1746633600000, pubDateStr=2025-05-08, doiRegisterDate=null, doiRegisterDateStr=null, onlineIssueDate=1752057053545, onlineIssueDateStr=2025-07-09, onlineJustAcceptDate=null, onlineJustAcceptDateStr=null, onlineFirstDate=null, onlineFirstDateStr=null, sourceXml=null, magXml=null, createTime=1752057053545, creator=13701087609, updateTime=1752057053545, updator=13701087609, issue=Issue{id=1149773869357167407, tenantId=1146029695717560320, journalId=1146123166801305609, year='2025', volume='25', issue='13', pageStart='5273', pageEnd='5704', issueExtLink='null', onlineDate='null', pubDate='null', beforeIssueId=null, nextIssueId=null, price=null, status=1, issueComplete=1, articleOrder=1, issueType=-1, specialIssue=0, createTime=1752057052207, creator=13701087609, updateTime=1768456769392, updator=13701087609, preIssue=null, nextIssue=null, ext={EN=IssueExt(id=1218559268744253990, tenantId=1146029695717560320, journalId=1146123166801305609, issueId=1149773869357167407, language=EN, specialIssueTitle=, coverIllustrator=, specialIssueEditor=, specialIssueAbout=), CN=IssueExt(id=1218559268744253991, tenantId=1146029695717560320, journalId=1146123166801305609, issueId=1149773869357167407, language=CN, specialIssueTitle=, coverIllustrator=, specialIssueEditor=, specialIssueAbout=)}, issueFiles=null}, startPage=5501, endPage=5514, ext={EN=ArticleExt(id=1149773875774447628, articleId=1149773874918809604, tenantId=1146029695717560320, journalId=1146123166801305609, language=EN, title=Dynamic Multi-subswarm Salp Swarm Algorithm for Solving Unmanned Aerial Vehicles Three-dimensional Path Planning Problem, columnId=1156262729162810294, journalTitle=Science Technology and Engineering, columnName=Papers·Automation and Computational Technology, runingTitle=null, highlight=null, articleAbstract=

The Unmanned aerial vehicles three-dimensional path planning problem is a combinatorial optimization problem to find the optimal path between the starting point and the endpoint in complex three-dimensional environment, but most path planning algorithms struggle to find feasible paths within acceptable time and precision range, therefore, a dynamic multi-subswarm salp swarm algorithm based on K-means++ clustering optimization was proposed to address the aforementioned issue. Firstly, a new cost function incorporating height cost was proposed within the three-dimensional environment model. The path planning problem was converted into a multi-dimensional function optimization issue. Secondly, the population was clustered using the K-means++ clustering algorithm, and a dynamic multi-subswarm mechanism was designed to balance the algorithm's global search and local exploitation. Each subswarm collaborates with multiple strategies for improvement, avoiding the algorithm from being trapped in local optima while enhancing global optimization capability. Finally, after validating the algorithm against five algorithms ISSA, MSNSSA, IBSO, MBFPA, and SSA using 12 CEC2017 benchmark test functions, it was applied to solve the optimal path planning problem in three-dimensional environments. Simulation results under different environmental models demonstrate that the algorithm's average effective path rate is increased by 15.5%, 11%, 23%, 20.5% and 18% compared to the other five algorithms, confirming its excellent optimization capability in complex environments.

, correspAuthors=Guang-fu WU, authorNote=null, correspAuthorsNote=null, copyrightStatement=null, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=null, magXml=null, pdfUrl=null, pdf=null, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=null, mapNumber=null, authorCompany=null, fund=null, authors=null, authorsList=Guang-fu WU, Xiao-lin WANG), CN=ArticleExt(id=1149773906422227774, articleId=1149773874918809604, tenantId=1146029695717560320, journalId=1146123166801305609, language=CN, title=求解无人机三维路径规划问题的动态多子群樽海鞘群算法, columnId=1156262729783567290, journalTitle=科学技术与工程, columnName=论文·自动化技术、计算机技术, runingTitle=null, highlight=null, articleAbstract=

无人机三维路径规划问题是在复杂三维环境中找到起点与终点之间最优路径的组合优化问题,但大多数路径规划算法难以在可接受的时间和精度范围内找到可行路径,因此提出了一种基于K-means++聚类优化的动态多子群樽海鞘群算法用于解决上述问题。首先,在三维环境模型中结合高度成本提出新的成本函数,将路径规划问题转化为多维函数优化问题。其次,采用K-means++聚类算法对种群进行分群,并设计动态多子群机制均衡算法的全局搜索与局部开发;各子群结合多策略协同改进,在避免算法陷入局部最优的同时提高全局寻优能力。最后,在12个CEC2017基准测试函数中验证了该算法对比其他5种算法(ISSA、MSNSSA、IBSO、MBFPA、SSA)的性能后,将其应用于三维环境中对最优路径规划问题进行求解。在不同的环境模型下的仿真实验结果表明,该算法的平均有效路径率相较于其他5种算法分别提高了15.5%、11%、23%、20.5%和18%,这证实了该算法在复杂环境下具有优秀的寻优能力。

, correspAuthors=巫光福, authorNote=null, correspAuthorsNote=null, copyrightStatement=null, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=60sdlnsV7/lCwSexEFkiKg==, magXml=ZUW45vizUTKFw3WoV0kK/g==, pdfUrl=null, pdf=M2u9I9hDmDQrbu+Y0Ps+zQ==, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=xe/wbLHAnOIxBJ9KyelFOA==, mapNumber=null, authorCompany=null, fund=null, authors=

巫光福(1977—),男,汉族,江西玉山人,博士,副教授,硕士研究生导师。研究方向:信息论与编码、密码学、信息安全、区块链等。E-mail:

, authorsList=巫光福, 王小林)}, authors=[Author(id=1175498531092705682, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=wuguangfu@126.com, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1175498531155620244, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, authorId=1175498531092705682, language=EN, stringName=Guang-fu WU, firstName=Guang-fu, middleName=null, lastName=WU, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China, bio=null, bioImg=null, bioContent=null, aboutCorrespAuthor=null), CN=AuthorExt(id=1175498531226923413, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, authorId=1175498531092705682, language=CN, stringName=巫光福, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=江西理工大学信息工程学院, 赣州 341000, bio={"content":"

巫光福(1977—),男,汉族,江西玉山人,博士,副教授,硕士研究生导师。研究方向:信息论与编码、密码学、信息安全、区块链等。E-mail:

"}, bioImg=null, bioContent=

巫光福(1977—),男,汉族,江西玉山人,博士,副教授,硕士研究生导师。研究方向:信息论与编码、密码学、信息安全、区块链等。E-mail:

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1175498531017208206, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, xref=null, ext=[AuthorCompanyExt(id=1175498531025596815, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China), AuthorCompanyExt(id=1175498531033985424, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=江西理工大学信息工程学院, 赣州 341000)])]), Author(id=1175498531277255063, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1175498531340169625, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, authorId=1175498531277255063, language=EN, stringName=Xiao-lin WANG, firstName=Xiao-lin, middleName=null, lastName=WANG, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China, bio=null, bioImg=null, bioContent=null, aboutCorrespAuthor=null), CN=AuthorExt(id=1175498531403084186, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, authorId=1175498531277255063, language=CN, stringName=王小林, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=江西理工大学信息工程学院, 赣州 341000, bio=null, bioImg=null, bioContent=null, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1175498531017208206, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, xref=null, ext=[AuthorCompanyExt(id=1175498531025596815, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China), AuthorCompanyExt(id=1175498531033985424, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=江西理工大学信息工程学院, 赣州 341000)])])], keywords=[Keyword(id=1175498531528913307, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=1, keyword=three-dimensional path planning), Keyword(id=1175498531587633564, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=2, keyword=cost function), Keyword(id=1175498531637965213, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=3, keyword=salp swarm algorithm), Keyword(id=1175498531688296862, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=4, keyword=K-means++ clustering algorithm), Keyword(id=1175498531738628511, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=5, keyword=dynamic multi-subswarm), Keyword(id=1175498531788960160, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, orderNo=6, keyword=collaborative improvement), Keyword(id=1175498531843486113, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=1, keyword=三维路径规划), Keyword(id=1175498531906400676, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=2, keyword=成本函数), Keyword(id=1175498531977703846, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=3, keyword=樽海鞘群算法), Keyword(id=1175498532032229800, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=4, keyword=K-means++聚类算法), Keyword(id=1175498532086755754, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=5, keyword=动态多子群), Keyword(id=1175498532149670315, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, orderNo=6, keyword=协同改进)], refs=[Reference(id=1175498535349924336, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2023, volume=195, issue=1, pageStart=30, pageEnd=null, url=null, language=null, rfNumber=[1], rfOrder=0, authorNames=Yahia H S, Mohammed A S, journalName=Environmental Monitoring and Assessment, refType=null, unstructuredReference=Yahia H S, Mohammed A S. Path planning optimization in unmanned aerial vehicles using meta-heuristic algorithms: a systematic review[J]. Environmental Monitoring and Assessment, 2023, 195(1): 30., articleTitle=Path planning optimization in unmanned aerial vehicles using meta-heuristic algorithms: a systematic review, refAbstract=null), Reference(id=1175498535412838898, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=34, issue=10, pageStart=e4827, pageEnd=null, url=null, language=null, rfNumber=[2], rfOrder=1, authorNames=Khan M T R, Muhammad S M, Ru Y, journalName=International Journal of Communication Systems, refType=null, unstructuredReference=Khan M T R, Muhammad S M, Ru Y, et al. Aspects of unmanned aerial vehicles path planning: overview and applications[J]. International Journal of Communication Systems, 2021, 34(10): e4827., articleTitle=Aspects of unmanned aerial vehicles path planning: overview and applications, refAbstract=null), Reference(id=1175498535471559156, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2023, volume=23, issue=6, pageStart=3051, pageEnd=null, url=null, language=null, rfNumber=[3], rfOrder=2, authorNames=Poudel S, Arafat M Y, Moh S, journalName=Sensors, refType=null, unstructuredReference=Poudel S, Arafat M Y, Moh S. Bio-inspired optimization-based path planning algorithms in unmanned aerial vehicles: a survey[J]. Sensors, 2023, 23(6): 3051., articleTitle=Bio-inspired optimization-based path planning algorithms in unmanned aerial vehicles: a survey, refAbstract=null), Reference(id=1175498535530279414, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2019, volume=69, issue=2, pageStart=1741, pageEnd=1750, url=null, language=null, rfNumber=[4], rfOrder=3, authorNames=Baek J, Han S I, Han Y, journalName=IEEE Trans on Vehicular Technology, refType=null, unstructuredReference=Baek J, Han S I, Han Y. Energy-efficient UAV routing for wireless sensor networks[J]. IEEE Trans on Vehicular Technology, 2019, 69(2): 1741-1750., articleTitle=Energy-efficient UAV routing for wireless sensor networks, refAbstract=null), Reference(id=1175498535609971192, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=33, issue=22, pageStart=15569, pageEnd=15599, url=null, language=null, rfNumber=[5], rfOrder=4, authorNames=Kiani F, Seyyedabbasi A, Aliyev R, journalName=Neural Computing and Applications, refType=null, unstructuredReference=Kiani F, Seyyedabbasi A, Aliyev R, et al. Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms[J]. Neural Computing and Applications, 2021, 33(22): 15569-15599., articleTitle=Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms, refAbstract=null), Reference(id=1175498535672885754, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2017, volume=49, issue=4, pageStart=665, pageEnd=676, url=null, language=null, rfNumber=[6], rfOrder=5, authorNames=Woods A C, La H M, journalName=IEEE Trans on Systems Man and Cybernetics: Systems, refType=null, unstructuredReference=Woods A C, La H M. A novel potential field controller for use on aerial robots[J]. IEEE Trans on Systems Man and Cybernetics: Systems, 2017, 49(4): 665-676., articleTitle=A novel potential field controller for use on aerial robots, refAbstract=null), Reference(id=1175498535739994620, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=13, issue=11, pageStart=2213, pageEnd=null, url=null, language=null, rfNumber=[7], rfOrder=6, authorNames=Wang H W, Qi X Y, Lou S J, journalName=Symmetry, refType=null, unstructuredReference=Wang H W, Qi X Y, Lou S J, et al. An efficient and robust improved A* algorithm for path planning[J]. Symmetry, 2021, 13(11): 2213., articleTitle=An efficient and robust improved A* algorithm for path planning, refAbstract=null), Reference(id=1175498535811297790, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2017, volume=26, issue=1, pageStart=1760008, pageEnd=null, url=null, language=null, rfNumber=[8], rfOrder=7, authorNames=Silva A J, Silva A M, Motta T C F, journalName=International Journal on Artificial Intelligence Tools, refType=null, unstructuredReference=Silva A J, Silva A M, Motta T C F, et al. Heuristic and genetic algorithm approaches for UAV path planning under critical situation[J]. International Journal on Artificial Intelligence Tools, 2017, 26(1): 1760008., articleTitle=Heuristic and genetic algorithm approaches for UAV path planning under critical situation, refAbstract=null), Reference(id=1175498535882600960, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2018, volume=22, issue=null, pageStart=387, pageEnd=408, url=null, language=null, rfNumber=[9], rfOrder=8, authorNames=Wang D S, Tan D P, Liu L, journalName=Soft Computing, refType=null, unstructuredReference=Wang D S, Tan D P, Liu L. Particle swarm optimization algorithm: an overview[J]. Soft Computing, 2018, 22: 387-408., articleTitle=Particle swarm optimization algorithm: an overview, refAbstract=null), Reference(id=1175498535958098434, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2014, volume=69, issue=null, pageStart=46, pageEnd=61, url=null, language=null, rfNumber=[10], rfOrder=9, authorNames=Mirjalili S, Mirjalili S M, Lewis A, journalName=Advances in Engineering Software, refType=null, unstructuredReference=Mirjalili S, Mirjalili S M, Lewis A. Grey wolf optimizer[J]. Advances in Engineering Software, 2014, 69: 46-61., articleTitle=Grey wolf optimizer, refAbstract=null), Reference(id=1175498536029401604, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2019, volume=23, issue=null, pageStart=715, pageEnd=734, url=null, language=null, rfNumber=[11], rfOrder=10, authorNames=Arora S, Singh S, journalName=Soft Computing, refType=null, unstructuredReference=Arora S, Singh S. Butterfly optimization algorithm: a novel approach for global optimization[J]. Soft Computing, 2019, 23: 715-734., articleTitle=Butterfly optimization algorithm: a novel approach for global optimization, refAbstract=null), Reference(id=1175498536092316166, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2017, volume=114, issue=null, pageStart=163, pageEnd=191, url=null, language=null, rfNumber=[12], rfOrder=11, authorNames=Mirjalili S, Gandomi A H, Mirjalili S Z, journalName=Advances in Engineering Software, refType=null, unstructuredReference=Mirjalili S, Gandomi A H, Mirjalili S Z, et al. Salp swarm algorithm: a bio-inspired optimizer for engineering design problems[J]. Advances in Engineering Software, 2017, 114: 163-191., articleTitle=Salp swarm algorithm: a bio-inspired optimizer for engineering design problems, refAbstract=null), Reference(id=1175498536184590855, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2020, volume=8, issue=null, pageStart=99740, pageEnd=99771, url=null, language=null, rfNumber=[13], rfOrder=12, authorNames=Zhang J, Wang J S, journalName=IEEE Access, refType=null, unstructuredReference=Zhang J, Wang J S. Improved salp swarm algorithm based on Levy flight and sine cosine operator[J]. IEEE Access, 2020, 8: 99740-99771., articleTitle=Improved salp swarm algorithm based on Levy flight and sine cosine operator, refAbstract=null), Reference(id=1175498536255894025, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2020, volume=145, issue=null, pageStart=113122, pageEnd=null, url=null, language=null, rfNumber=[14], rfOrder=13, authorNames=Tubishat M, Idris N, Shuib L, journalName=Expert Systems with Applications, refType=null, unstructuredReference=Tubishat M, Idris N, Shuib L, et al. Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection[J]. Expert Systems with Applications, 2020, 145: 113122., articleTitle=Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection, refAbstract=null), Reference(id=1175498536306225675, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2023, volume=147, issue=null, pageStart=110838, pageEnd=null, url=null, language=null, rfNumber=[15], rfOrder=14, authorNames=Ahmed M, Kamel S H, Abbasy N H, journalName=Applied Soft Computing, refType=null, unstructuredReference=Ahmed M, Kamel S H, Abbasy N H, et al. A gaussian random walk salp swarm algorithm for optimal dynamic charging of electric vehicles[J]. Applied Soft Computing, 2023, 147: 110838., articleTitle=A gaussian random walk salp swarm algorithm for optimal dynamic charging of electric vehicles, refAbstract=null), Reference(id=1175498536369140236, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=47, issue=2, pageStart=363, pageEnd=377, url=null, language=null, rfNumber=[16], rfOrder=15, authorNames=邢致恺, 贾鹤鸣, 宋文龙, journalName=自动化学报, refType=null, unstructuredReference=邢致恺, 贾鹤鸣, 宋文龙. 基于莱维飞行樽海鞘群优化算法的多阈值图像分割[J]. 自动化学报, 2021, 47(2): 363-377., articleTitle=基于莱维飞行樽海鞘群优化算法的多阈值图像分割, refAbstract=null), Reference(id=1175498536427860494, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=47, issue=2, pageStart=363, pageEnd=377, url=null, language=null, rfNumber=[16], rfOrder=16, authorNames=Xing Zhikai, Jia Heming, Song Wenlong, journalName=Acta Automatica Sinica, refType=null, unstructuredReference=Xing Zhikai, Jia Heming, Song Wenlong. Levy flight trajectory-based salp swarm algorithm for multilevel thresholding image segmentation[J]. Acta Automatica Sinica, 2021, 47(2): 363-377., articleTitle=Levy flight trajectory-based salp swarm algorithm for multilevel thresholding image segmentation, refAbstract=null), Reference(id=1175498536482386448, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2023, volume=147, issue=null, pageStart=110776, pageEnd=null, url=null, language=null, rfNumber=[17], rfOrder=17, authorNames=Gupta H, Verma O P, journalName=Applied Soft Computing, refType=null, unstructuredReference=Gupta H, Verma O P. A novel hybrid coyote-particle swarm optimization algorithm for three-dimensional constrained trajectory planning of unmanned serial vehicle[J]. Applied Soft Computing, 2023, 147: 110776., articleTitle=A novel hybrid coyote-particle swarm optimization algorithm for three-dimensional constrained trajectory planning of unmanned serial vehicle, refAbstract=null), Reference(id=1175498536545301010, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=48, issue=5, pageStart=1307, pageEnd=1317, url=null, language=null, rfNumber=[18], rfOrder=18, authorNames=陈忠云, 张达敏, 辛梓芸, journalName=自动化学报, refType=null, unstructuredReference=陈忠云, 张达敏, 辛梓芸. 多子群的共生非均匀高斯变异樽海鞘群算法[J]. 自动化学报, 2022, 48(5): 1307-1317., articleTitle=多子群的共生非均匀高斯变异樽海鞘群算法, refAbstract=null), Reference(id=1175498536620798484, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=48, issue=5, pageStart=1307, pageEnd=1317, url=null, language=null, rfNumber=[18], rfOrder=19, authorNames=Chen Zhongyun, Zhang Damin, Xin Ziyun, journalName=Acta Automatica Sinica, refType=null, unstructuredReference=Chen Zhongyun, Zhang Damin, Xin Ziyun. Multi-subpopulation based symbiosis and non-uniform Gaussian mutation salp swarm algorithm[J]. Acta Automatica Sinica, 2022, 48(5): 1307-1317., articleTitle=Multi-subpopulation based symbiosis and non-uniform Gaussian mutation salp swarm algorithm, refAbstract=null), Reference(id=1175498536675324438, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2024, volume=41, issue=4, pageStart=1077, pageEnd=1085, url=null, language=null, rfNumber=[19], rfOrder=20, authorNames=李大海, 李鑫, 王振东, journalName=计算机应用研究, refType=null, unstructuredReference=李大海, 李鑫, 王振东. 融合小生境机制的增强麻雀搜索算法及其应用[J]. 计算机应用研究 2024, 41(4): 1077-1085., articleTitle=融合小生境机制的增强麻雀搜索算法及其应用, refAbstract=null), Reference(id=1175498536746627608, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2024, volume=41, issue=4, pageStart=1077, pageEnd=1085, url=null, language=null, rfNumber=[19], rfOrder=21, authorNames=Li Dahai, Li Xin, Wang Zhendong, journalName=Application Research of Computers, refType=null, unstructuredReference=Li Dahai, Li Xin, Wang Zhendong. Enhanced sparrow search algorithm by integrating niche mechanism and its application[J]. Application Research of Computers, 2024, 41(4): 1077-1085., articleTitle=Enhanced sparrow search algorithm by integrating niche mechanism and its application, refAbstract=null), Reference(id=1175498536817930778, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2007, volume=7, issue=null, pageStart=1027, pageEnd=1035, url=null, language=null, rfNumber=[20], rfOrder=22, authorNames=Arthur D, Vassilvitskii S, journalName=In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, refType=null, unstructuredReference=Arthur D, Vassilvitskii S. K-means++: the advantages of careful seeding[C]// In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, 2007, 7: 1027-1035., articleTitle=K-means++: the advantages of careful seeding, refAbstract=null), Reference(id=1175498536897622556, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2020, volume=35, issue=9, pageStart=2112, pageEnd=2120, url=null, language=null, rfNumber=[21], rfOrder=23, authorNames=张达敏, 陈忠云, 辛梓芸, journalName=控制与决策, refType=null, unstructuredReference=张达敏, 陈忠云, 辛梓芸, 等. 基于疯狂自适应的樽海鞘群算法[J]. 控制与决策, 2020, 35(9): 2112-2120., articleTitle=基于疯狂自适应的樽海鞘群算法, refAbstract=null), Reference(id=1175498536964731422, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2020, volume=35, issue=9, pageStart=2112, pageEnd=2120, url=null, language=null, rfNumber=[21], rfOrder=24, authorNames=Zhang Damin, Chen Zhongyun, Xin Ziyun, journalName=Control and Decision, refType=null, unstructuredReference=Zhang Damin, Chen Zhongyun, Xin Ziyun, et al. Salp swarm algorithm based on craziness and adaptive[J]. Control and Decision, 2020, 35(9): 2112-2120., articleTitle=Salp swarm algorithm based on craziness and adaptive, refAbstract=null), Reference(id=1175498537006674464, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=37, issue=1, pageStart=237, pageEnd=246, url=null, language=null, rfNumber=[22], rfOrder=25, authorNames=白钰, 彭珍瑞, journalName=控制与决策, refType=null, unstructuredReference=白钰, 彭珍瑞. 基于自适应惯性权重的樽海鞘群算法[J]. 控制与决策, 2022, 37(1): 237-246., articleTitle=基于自适应惯性权重的樽海鞘群算法, refAbstract=null), Reference(id=1175498537069589026, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=37, issue=1, pageStart=237, pageEnd=246, url=null, language=null, rfNumber=[22], rfOrder=26, authorNames=Bai Yu, Peng Zhenrui, journalName=Control and Decision, refType=null, unstructuredReference=Bai Yu, Peng Zhenrui. Salp swarm algorithm based on adaptive inertia weight[J]. Control and Decision, 2022, 37(1): 237-246., articleTitle=Salp swarm algorithm based on adaptive inertia weight, refAbstract=null), Reference(id=1175498537132503588, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=14, issue=5, pageStart=1222, pageEnd=null, url=null, language=null, rfNumber=[23], rfOrder=27, authorNames=Tudose A M, Picioroaga I I, Sidea D O, journalName=Energies, refType=null, unstructuredReference=Tudose A M, Picioroaga I I, Sidea D O, et al. Solving single-and multi-objective optimal reactive power dispatch problems using an improved salp swarm algorithm[J]. Energies, 2021, 14(5): 1222., articleTitle=Solving single-and multi-objective optimal reactive power dispatch problems using an improved salp swarm algorithm, refAbstract=null), Reference(id=1175498537203806758, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2024, volume=24, issue=18, pageStart=7710, pageEnd=7718, url=null, language=null, rfNumber=[24], rfOrder=28, authorNames=黎观锋, 梁志坚, 杨武, journalName=科学技术与工程, refType=null, unstructuredReference=黎观锋, 梁志坚, 杨武. 基于改进二进制蛇优化算法的配电网故障定位[J]. 科学技术与工程, 2024, 24(18): 7710-7718., articleTitle=基于改进二进制蛇优化算法的配电网故障定位, refAbstract=null), Reference(id=1175498537279304231, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2024, volume=24, issue=18, pageStart=7710, pageEnd=7718, url=null, language=null, rfNumber=[24], rfOrder=29, authorNames=Li Guanfeng, Liang Zhijian, Yang Wu, journalName=Science Technology and Engineering, refType=null, unstructuredReference=Li Guanfeng, Liang Zhijian, Yang Wu. Fault location in distribution networks based on an improved binary snake optimization algorithm[J]. Science Technology and Engineering, 2024, 24(18): 7710-7718., articleTitle=Fault location in distribution networks based on an improved binary snake optimization algorithm, refAbstract=null), Reference(id=1175498537367384617, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2021, volume=37, issue=null, pageStart=3665, pageEnd=3698, url=null, language=null, rfNumber=[25], rfOrder=30, authorNames=Wang Z, Luo Q, Zhou Y, journalName=Engineering with Computers, refType=null, unstructuredReference=Wang Z, Luo Q, Zhou Y. Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems[J]. Engineering with Computers, 2021, 37: 3665-3698., articleTitle=Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems, refAbstract=null), Reference(id=1175498537476436523, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=48, issue=11, pageStart=2757, pageEnd=2776, url=null, language=null, rfNumber=[26], rfOrder=31, authorNames=张新明, 姜云, 刘尚旺, journalName=自动化学报, refType=null, unstructuredReference=张新明, 姜云, 刘尚旺, 等. 灰狼与郊狼混合优化算法及其聚类优[J]. 自动化学报, 2022, 48(11): 2757-2776., articleTitle=灰狼与郊狼混合优化算法及其聚类优, refAbstract=null), Reference(id=1175498537560322605, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, doi=null, pmid=null, pmcid=null, year=2022, volume=48, issue=11, pageStart=2757, pageEnd=2776, url=null, language=null, rfNumber=[26], rfOrder=32, authorNames=Zhang Xinming, Jiang Yun, Liu Shangwang, journalName=Acta Automatica Sinica, refType=null, unstructuredReference=Zhang Xinming, Jiang Yun, Liu Shangwang, et al. Hybrid coyote optimization algorithm with grey wolf optimizer and its application to clustering optimization[J]. Acta Automatica Sinica, 2022, 48(11): 2757-2776., articleTitle=Hybrid coyote optimization algorithm with grey wolf optimizer and its application to clustering optimization, refAbstract=null)], funds=[Fund(id=1175498534959854057, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, awardId=11461031, language=CN, fundingSource=国家自然科学基金(11461031), fundOrder=null, country=null), Fund(id=1175498535089877483, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, awardId=20212ACB202003, language=CN, fundingSource=江西省科技厅重点项目(20212ACB202003), fundOrder=null, country=null), Fund(id=1175498535198929389, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, awardId=MMKFKT202123, language=CN, fundingSource=密码科学技术国家重点实验室开放课题面上项目(MMKFKT202123), fundOrder=null, country=null)], companyList=[AuthorCompany(id=1175498531017208206, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, xref=null, ext=[AuthorCompanyExt(id=1175498531025596815, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China), AuthorCompanyExt(id=1175498531033985424, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, companyId=1175498531017208206, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=江西理工大学信息工程学院, 赣州 341000)])], figs=[ArticleFig(id=1175498532309053871, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.1, caption=Environmental model, figureFileSmall=QIMAtU7rzJR3+cYQzs9wZg==, figureFileBig=NxXbmLW2kk1wZkEwfOF3Yw==, tableContent=null), ArticleFig(id=1175498532371968432, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图1, caption=环境模型, figureFileSmall=QIMAtU7rzJR3+cYQzs9wZg==, figureFileBig=NxXbmLW2kk1wZkEwfOF3Yw==, tableContent=null), ArticleFig(id=1175498532422300081, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.2, caption=Cubic B-spline curve interpolation, figureFileSmall=QXS171GCoPHdudukbgD/dA==, figureFileBig=+OUaEt6v/jn+VASdHALZlA==, tableContent=null), ArticleFig(id=1175498532472631730, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图2, caption=三次B样条曲线插值

蓝色圈点为路径点;蓝色折线为连接各个路径点的路径;红色曲线则为经过三次B样条曲线插值技术处理后的路径,使路径更平滑

, figureFileSmall=QXS171GCoPHdudukbgD/dA==, figureFileBig=+OUaEt6v/jn+VASdHALZlA==, tableContent=null), ArticleFig(id=1175498532522963379, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.3, caption=Flight angle constraint diagram, figureFileSmall=MKdZR2lbCLt/lHFWmpPRMw==, figureFileBig=8AUuvRW23hgvoGBww1D+Mg==, tableContent=null), ArticleFig(id=1175498532602655156, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图3, caption=飞行转角约束, figureFileSmall=MKdZR2lbCLt/lHFWmpPRMw==, figureFileBig=8AUuvRW23hgvoGBww1D+Mg==, tableContent=null), ArticleFig(id=1175498532699124150, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.4, caption=Population division schematic diagram, figureFileSmall=PNwqKALz6TaJ+KO04kxHNw==, figureFileBig=Jj0M+Q7OR3eWx9AMR6/R0Q==, tableContent=null), ArticleFig(id=1175498532787204537, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图4, caption=种群划分示意图, figureFileSmall=PNwqKALz6TaJ+KO04kxHNw==, figureFileBig=Jj0M+Q7OR3eWx9AMR6/R0Q==, tableContent=null), ArticleFig(id=1175498532850119100, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.5, caption=Differences of c1 between SSA and DMSSSA, figureFileSmall=C54ZZyODd2yR8dUOVABRSQ==, figureFileBig=eM08RGINtHovufuS6iOyVQ==, tableContent=null), ArticleFig(id=1175498532942393791, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图5, caption=c1在SSA和DMSSSA之间的差异, figureFileSmall=C54ZZyODd2yR8dUOVABRSQ==, figureFileBig=eM08RGINtHovufuS6iOyVQ==, tableContent=null), ArticleFig(id=1175498533059834307, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.6, caption=Precision elimination strategy, figureFileSmall=Qts/VcagQsIl6QM5On5NQA==, figureFileBig=BxuLfInLgswqazFlbs/+Hw==, tableContent=null), ArticleFig(id=1175498533160497605, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图6, caption=精密消除策略, figureFileSmall=Qts/VcagQsIl6QM5On5NQA==, figureFileBig=BxuLfInLgswqazFlbs/+Hw==, tableContent=null), ArticleFig(id=1175498533231800774, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.7, caption=Flowchart of DMSSSA, figureFileSmall=gEtWQ7l7KNYm1Um6FkRagw==, figureFileBig=o32C0ASQ0gBUJRol82yOTg==, tableContent=null), ArticleFig(id=1175498533307298248, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图7, caption=DMSSSA的执行流程, figureFileSmall=gEtWQ7l7KNYm1Um6FkRagw==, figureFileBig=o32C0ASQ0gBUJRol82yOTg==, tableContent=null), ArticleFig(id=1175498533370212809, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.8, caption=Average convergence curve plots of each algorithm, figureFileSmall=tWvj86XYSAXSvL/jaSESLQ==, figureFileBig=/V3L54S0T/BArZNZTBgzzg==, tableContent=null), ArticleFig(id=1175498533437321675, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图8, caption=各算法平均收敛曲线图, figureFileSmall=tWvj86XYSAXSvL/jaSESLQ==, figureFileBig=/V3L54S0T/BArZNZTBgzzg==, tableContent=null), ArticleFig(id=1175498533487653325, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Fig.9, caption=Performance analysis of various algorithms in different model, figureFileSmall=U5YKXXGPWTfDd2e6fErTuA==, figureFileBig=jyzNBFJhNlUXyBSFBc8h4g==, tableContent=null), ArticleFig(id=1175498533546373582, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=图9, caption=各算法在不同模型中的性能分析, figureFileSmall=U5YKXXGPWTfDd2e6fErTuA==, figureFileBig=jyzNBFJhNlUXyBSFBc8h4g==, tableContent=null), ArticleFig(id=1175498533596705232, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 1, caption=

Benchmark function

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 函数名称 类型 F i *
F1 Shifted and Rotated Rosenbrock's
Function
Simple
Multimodal
Functions
400
F2 Shifted and Rotated Rastrigin's Function 500
F3 Shifted and Rotated Expanded Scaffer's
F6 Function
600
F4 Shifted and Rotated Non-Continuous
Rastrigin's Function
800
F5 Hybrid Function 2 (N=3) Hybrid
Functions
1 200
F6 Hybrid Function 4 (N=4) 1 400
F7 Hybrid Function 6 (N=4) 1 600
F8 Hybrid Function 6 (N=6) 2 000
F9 Composition Function 2 (N=3) Composition
Functions
2 200
F10 Composition Function 3 (N=4) 2 300
F11 Composition Function 5 (N=5) 2 500
F12 Composition Function 8 (N=6) 2 800
), ArticleFig(id=1175498533663814098, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表1, caption=

测试函数

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 函数名称 类型 F i *
F1 Shifted and Rotated Rosenbrock's
Function
Simple
Multimodal
Functions
400
F2 Shifted and Rotated Rastrigin's Function 500
F3 Shifted and Rotated Expanded Scaffer's
F6 Function
600
F4 Shifted and Rotated Non-Continuous
Rastrigin's Function
800
F5 Hybrid Function 2 (N=3) Hybrid
Functions
1 200
F6 Hybrid Function 4 (N=4) 1 400
F7 Hybrid Function 6 (N=4) 1 600
F8 Hybrid Function 6 (N=6) 2 000
F9 Composition Function 2 (N=3) Composition
Functions
2 200
F10 Composition Function 3 (N=4) 2 300
F11 Composition Function 5 (N=5) 2 500
F12 Composition Function 8 (N=6) 2 800
), ArticleFig(id=1175498533735117268, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 2, caption=

Parameter settings of algorithms

, figureFileSmall=null, figureFileBig=null, tableContent=
算法 参数设置
DMSSSA D=100,N=30,Tmax=500,m=2.5,R=rand(0,50)
ISSA D=100,Ninit=30,Ntot=240,Tmax=500,m=2
MSNSSA D=100,N=30,Tmax=500,m=2.5,b=2
IBSO D=100,N=30,Tmax=500,c1=0.5,c2=0.05,c3=2
MBFPA
SSA
D=100,N=30,Tmax=500,c=0.01,a=0.1
D=100,N=30,Tmax=500,m=2
), ArticleFig(id=1175498533789643222, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表2, caption=

算法的参数设置

, figureFileSmall=null, figureFileBig=null, tableContent=
算法 参数设置
DMSSSA D=100,N=30,Tmax=500,m=2.5,R=rand(0,50)
ISSA D=100,Ninit=30,Ntot=240,Tmax=500,m=2
MSNSSA D=100,N=30,Tmax=500,m=2.5,b=2
IBSO D=100,N=30,Tmax=500,c1=0.5,c2=0.05,c3=2
MBFPA
SSA
D=100,N=30,Tmax=500,c=0.01,a=0.1
D=100,N=30,Tmax=500,m=2
), ArticleFig(id=1175498533856752088, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 3, caption=

Friedman statistical results

, figureFileSmall=null, figureFileBig=null, tableContent=
维度 30维 50维 100维
P 2.312 5×10-9 5.342 3×10-10 3.776 4×10-9
ISSA 2.15 2.33 1.95
MSNSSA 3.77 3.65 4.08
IBSO 3.32 4.45 5.16
MBFPA 3.77 3.97 3.21
SSA 5.24 5.05 4.93
DMSSSA 1.16 1.04 1.34
), ArticleFig(id=1175498533961609690, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表3, caption=

Friedman 统计结果

, figureFileSmall=null, figureFileBig=null, tableContent=
维度 30维 50维 100维
P 2.312 5×10-9 5.342 3×10-10 3.776 4×10-9
ISSA 2.15 2.33 1.95
MSNSSA 3.77 3.65 4.08
IBSO 3.32 4.45 5.16
MBFPA 3.77 3.97 3.21
SSA 5.24 5.05 4.93
DMSSSA 1.16 1.04 1.34
), ArticleFig(id=1175498534066467292, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 4, caption=

Test results of each strategies

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 平均值/方差
SSA DMSSSA1 DMSSSA2 DMSSSA3 DMSSSA
F1 3.04×104/6.51×103 1.97×104/3.66×103 1.34×104/2.80×103 1.25×104/2.76×103 1.31×103/7.63×101
F2 1.62×103/1.13×102 1.53×103/7.72×101 1.50×103/6.12×101 1.47×103/7.48×101 1.33×103/4.27×101
F3 7.28×102/7.32×100 7.03×102/4.98×100 6.80×102/3.76×100 6.85×102/4.04×100 6.79×102/3.12×100
F4 2.21×103/9.58×101 2.20×103/1.06×102 2.09×103/1.21×102 2.11×103/8.67×101 1.92×103/7.50×101
F5 7.46×108/2.61×108 6.21×108/2.25×109 6.15×108/1.33×1010 6.20×108/8.20×108 5.96×108/1.78×108
F6 2.43×104/4.07×103 2.31×104/5.17×103 1.43×104/4.37×103 3.34×104/3.50×103 1.21×104/1.42×103
F7 8.43×103/9.25×102 8.27×103/9.62×102 8.17×103/8.64×102 8.22×103/1.07×103 7.39×103/9.48×102
F8 6.63×103/4.54×102 6.30×103/4.33×102 6.19×103/3.42×102 6.11×103/2.45×102 5.75×103/6.33×102
F9 2.56×104/1.71×103 2.38×104/1.57×103 2.29×104/1.36×103 2.33×104/1.73×103 2.22×104/1.84×103
F10 4.79×103/2.30×102 4.61×103/2.19×102 4.58×103/2.21×102 4.64×103/2.97×102 4.57×103/1.09×102
F11 8.13×103/6.93×102 8.01×103/9.74×102 6.96×103/1.11×103 6.72×103/2.24×103 3.78×103/9.55×101
F12 7.20×103/1.03×103 7.02×103/7.95×102 6.97×103/1.45×103 6.89×103/1.60×103 4.14×103/1.18×102
), ArticleFig(id=1175498534246822365, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表4, caption=

各策略测试结果

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 平均值/方差
SSA DMSSSA1 DMSSSA2 DMSSSA3 DMSSSA
F1 3.04×104/6.51×103 1.97×104/3.66×103 1.34×104/2.80×103 1.25×104/2.76×103 1.31×103/7.63×101
F2 1.62×103/1.13×102 1.53×103/7.72×101 1.50×103/6.12×101 1.47×103/7.48×101 1.33×103/4.27×101
F3 7.28×102/7.32×100 7.03×102/4.98×100 6.80×102/3.76×100 6.85×102/4.04×100 6.79×102/3.12×100
F4 2.21×103/9.58×101 2.20×103/1.06×102 2.09×103/1.21×102 2.11×103/8.67×101 1.92×103/7.50×101
F5 7.46×108/2.61×108 6.21×108/2.25×109 6.15×108/1.33×1010 6.20×108/8.20×108 5.96×108/1.78×108
F6 2.43×104/4.07×103 2.31×104/5.17×103 1.43×104/4.37×103 3.34×104/3.50×103 1.21×104/1.42×103
F7 8.43×103/9.25×102 8.27×103/9.62×102 8.17×103/8.64×102 8.22×103/1.07×103 7.39×103/9.48×102
F8 6.63×103/4.54×102 6.30×103/4.33×102 6.19×103/3.42×102 6.11×103/2.45×102 5.75×103/6.33×102
F9 2.56×104/1.71×103 2.38×104/1.57×103 2.29×104/1.36×103 2.33×104/1.73×103 2.22×104/1.84×103
F10 4.79×103/2.30×102 4.61×103/2.19×102 4.58×103/2.21×102 4.64×103/2.97×102 4.57×103/1.09×102
F11 8.13×103/6.93×102 8.01×103/9.74×102 6.96×103/1.11×103 6.72×103/2.24×103 3.78×103/9.55×101
F12 7.20×103/1.03×103 7.02×103/7.95×102 6.97×103/1.45×103 6.89×103/1.60×103 4.14×103/1.18×102
), ArticleFig(id=1175498534385234399, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 5, caption=

Results from 30 runs of each algorithm in 100 dimensions

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 指标 ISSA MSNSSA IBSO MBFPA SSA DMSSSA

F1
平均值
方差
4.28×103
1.05×103
2.83×103
5.07×102
4.87×103
1.37×103
3.58×103
8.83×102
4.57×104
1.17×104
1.22×103
1.05×102
排名 4 2 5 3 6 1

F2
平均值
方差
1.62×103
1.09×102
1.48×103
8.29×101
1.71×103
1.32×102
1.44×103
6.58×102
1.95×103
1.05×102
1.38×103
6.36×101
排名 4 3 5 2 6 1

F3
平均值
方差
6.87×102
6.01×100
6.74×102
4.44×100
6.92×102
7.94×100
6.76×102
7.52×100
6.99×102
6.58×100
6.69×102
4.26×100
排名 4 2 5 3 6 1

F4
平均值
方差
1.95×103
1.12×102
1.86×103
1.11×102
2.08×103
1.39×102
1.85×103
8.49×101
2.40×103
1.14×102
1.82×103
8.43×101
排名 4 3 5 2 6 1

F5
平均值
方差
2.79×109
1.11×109
1.58×109
6.94×108
4.94×109
1.81×109
4.99×109
8.73×109
5.38×109
1.61×109
6.39×108
1.34×108
排名 3 2 4 5 6 1

F6
平均值
方差
8.79×103
1.10×103
8.36×103
9.05×102
9.97×103
1.33×103
8.98×103
3.30×102
1.34×104
1.64×104
7.76×103
7.45×102
排名 3 2 5 4 6 1

F7
平均值
方差
9.64×103
1.13×103
1.22×104
1.55×103
1.26×104
1.73×103
1.04×104
2.43×103
1.68×104
2.56×103
7.84×103
8.34×102
排名 2 4 5 3 6 1

F8
平均值
方差
5.77×103
6.64×102
6.58×103
6.00×102
7.80×103
5.96×102
5.93×103
6.31×102
7.18×103
4.61×102
5.63×103
4.49×102
排名 2 4 6 3 5 1

F9
平均值
方差
2.74×104
1.82×103
2.91×104
1.91×103
2.69×104
2.19×103
2.69×104
2.97×103
3.39×104
1.75×103
2.12×104
1.55×103
排名 4 5 2 3 6 1

F10
平均值
方差
8.28×103
9.20×102
1.15×104
1.03×103
6.38×103
7.20×102
5.66×103
7.38×102
2.69×104
4.76×103
3.85×103
7.31×101
排名 4 5 3 2 6 1

F11
平均值
方差
4.48×103
3.16×102
4.47×103
3.20×102
4.63×103
3.72×102
5.98×103
1.97×103
6.52×103
7.86×102
4.12×103
4.49×102
排名 2 3 4 5 6 1

F12
平均值
方差
7.53×103
1.33×103
6.80×103
9.81×102
7.60×103
7.76×102
8.04×103
2.00×103
2.48×104
3.26×103
4.00×103
1.34×102
排名 3 2 4 5 6 1
排名第一次数 0 0 0 0 0 12
平均排名 3.25 3.08 4.41 3.33 5.91 1
总排名 3 2 5 4 6 1
), ArticleFig(id=1175498534515257825, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表5, caption=

100维时各算法30次运行结果

, figureFileSmall=null, figureFileBig=null, tableContent=
函数 指标 ISSA MSNSSA IBSO MBFPA SSA DMSSSA

F1
平均值
方差
4.28×103
1.05×103
2.83×103
5.07×102
4.87×103
1.37×103
3.58×103
8.83×102
4.57×104
1.17×104
1.22×103
1.05×102
排名 4 2 5 3 6 1

F2
平均值
方差
1.62×103
1.09×102
1.48×103
8.29×101
1.71×103
1.32×102
1.44×103
6.58×102
1.95×103
1.05×102
1.38×103
6.36×101
排名 4 3 5 2 6 1

F3
平均值
方差
6.87×102
6.01×100
6.74×102
4.44×100
6.92×102
7.94×100
6.76×102
7.52×100
6.99×102
6.58×100
6.69×102
4.26×100
排名 4 2 5 3 6 1

F4
平均值
方差
1.95×103
1.12×102
1.86×103
1.11×102
2.08×103
1.39×102
1.85×103
8.49×101
2.40×103
1.14×102
1.82×103
8.43×101
排名 4 3 5 2 6 1

F5
平均值
方差
2.79×109
1.11×109
1.58×109
6.94×108
4.94×109
1.81×109
4.99×109
8.73×109
5.38×109
1.61×109
6.39×108
1.34×108
排名 3 2 4 5 6 1

F6
平均值
方差
8.79×103
1.10×103
8.36×103
9.05×102
9.97×103
1.33×103
8.98×103
3.30×102
1.34×104
1.64×104
7.76×103
7.45×102
排名 3 2 5 4 6 1

F7
平均值
方差
9.64×103
1.13×103
1.22×104
1.55×103
1.26×104
1.73×103
1.04×104
2.43×103
1.68×104
2.56×103
7.84×103
8.34×102
排名 2 4 5 3 6 1

F8
平均值
方差
5.77×103
6.64×102
6.58×103
6.00×102
7.80×103
5.96×102
5.93×103
6.31×102
7.18×103
4.61×102
5.63×103
4.49×102
排名 2 4 6 3 5 1

F9
平均值
方差
2.74×104
1.82×103
2.91×104
1.91×103
2.69×104
2.19×103
2.69×104
2.97×103
3.39×104
1.75×103
2.12×104
1.55×103
排名 4 5 2 3 6 1

F10
平均值
方差
8.28×103
9.20×102
1.15×104
1.03×103
6.38×103
7.20×102
5.66×103
7.38×102
2.69×104
4.76×103
3.85×103
7.31×101
排名 4 5 3 2 6 1

F11
平均值
方差
4.48×103
3.16×102
4.47×103
3.20×102
4.63×103
3.72×102
5.98×103
1.97×103
6.52×103
7.86×102
4.12×103
4.49×102
排名 2 3 4 5 6 1

F12
平均值
方差
7.53×103
1.33×103
6.80×103
9.81×102
7.60×103
7.76×102
8.04×103
2.00×103
2.48×104
3.26×103
4.00×103
1.34×102
排名 3 2 4 5 6 1
排名第一次数 0 0 0 0 0 12
平均排名 3.25 3.08 4.41 3.33 5.91 1
总排名 3 2 5 4 6 1
), ArticleFig(id=1175498534628504035, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=EN, label=Table 6, caption=

Path planning performance metrics of each algorithm

, figureFileSmall=null, figureFileBig=null, tableContent=
环境模型 指标 ISSA MSNSSA IBSO MBFPA SSA DMSSSA
模型1 最优值 162.19 177.21 200.13 260.61 170.80 125.26
平均值 318.51 260.39 220.72 395.98 387.74 130.85
方差 46.82 55.02 55.55 79.12 73.85 1.17
平均用时/s 20.18 18.32 24.35 23.11 22.07 19.21
有效路径率/% 100 100 100 100 100 100
模型2 最优值 438.91 467.76 567.58 461.24 512.23 351.71
平均值 537.18 543.25 814.23 574.71 606.85 400.11
方差 46.50 66.45 77.26 72.26 78.22 39.23
平均用时/s 25.31 26.01 31.22 28.65 29.18 26.12
有效路径率/% 96 92 79 88 83 100
模型3 最优值 570.45 463.70 511.56 497.64 578.13 500.34
平均值 821.19 688.78 787.12 864.27 744.46 665.51
方差 134.12 85.67 100.37 177.13 901.85 44.17
平均用时/s 31.45 29.45 34.01 31.35 34.12 30.12
有效路径率/% 73 86 75 71 81 100
), ArticleFig(id=1175498534745944550, tenantId=1146029695717560320, journalId=1146123166801305609, articleId=1149773874918809604, language=CN, label=表6, caption=

各算法路径规划性能指标

, figureFileSmall=null, figureFileBig=null, tableContent=
环境模型 指标 ISSA MSNSSA IBSO MBFPA SSA DMSSSA
模型1 最优值 162.19 177.21 200.13 260.61 170.80 125.26
平均值 318.51 260.39 220.72 395.98 387.74 130.85
方差 46.82 55.02 55.55 79.12 73.85 1.17
平均用时/s 20.18 18.32 24.35 23.11 22.07 19.21
有效路径率/% 100 100 100 100 100 100
模型2 最优值 438.91 467.76 567.58 461.24 512.23 351.71
平均值 537.18 543.25 814.23 574.71 606.85 400.11
方差 46.50 66.45 77.26 72.26 78.22 39.23
平均用时/s 25.31 26.01 31.22 28.65 29.18 26.12
有效路径率/% 96 92 79 88 83 100
模型3 最优值 570.45 463.70 511.56 497.64 578.13 500.34
平均值 821.19 688.78 787.12 864.27 744.46 665.51
方差 134.12 85.67 100.37 177.13 901.85 44.17
平均用时/s 31.45 29.45 34.01 31.35 34.12 30.12
有效路径率/% 73 86 75 71 81 100
)], attaches=null, journal=Journal(id=1146119176004939786, delFlag=0, nameCn=科学技术与工程, nameEn=Science Technology and Engineering, nameHistory1=null, nameHistory2=null, issn=1671-1815, eissn=, cn=11-4688/T, coden=null, periodic=4, language=CN, oaType=是, ccby=null, superviseOffice=null, ownerOffice=null, pubOffice=null, editorOffice=null, officeType=null, aims=null, clcCode=null, officeProv=null, officeCity=null, officeAddr=null, officeZip=null, officeEmail=null, officePhone=null, editDirector=null, officeDirector=null, officeDirectorPhone=null, officeStaffNum=null, officeEmpNum=null, coverPicUrl=UKU/O7GSka5polgCTkbIIw==, journalPrice=null, startedYear=null, abbrevIsoEn=Sci Technol Eng, journalRemark=null, publicationField=null, createdTime=null, updatedTime=1754445529766, createdBy=null, updatedBy=13701087609, firstLetterCn=S, firstLetterEn=S, subjectCode=Natural Sciences, subjectName=自然科学, subjectCodeEn=Natural Sciences, subjectNameEn=null, picCn=UKU/O7GSka5polgCTkbIIw==, picEn=5hwlULoNwcbj3xUmVi9MAQ==, jcr=null, cjcr=null, exts=[JournalExt(id=1159791870395564357, language=CN, name=科学技术与工程, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=null, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=http://www.stae.com.cn/jsygc/home, createdTime=1754445529793, updatedTime=1754445529793, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=http://www.stae.com.cn/jsygc/site/menus/20090429150146001, submissionAuthorUrl=http://www.stae.com.cn/jsygc/author/login, submissionEditorUrl=http://www.stae.com.cn/jsygc/editor/login, submissionReviewUrl=http://www.stae.com.cn/jsygc/reviewer/login, submissionCeEditorUrl=, submissionAeEditorUrl=, option={"copyright":""}), JournalExt(id=1159791870441701702, language=EN, name=Science Technology and Engineering, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=null, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=http://www.stae.com.cn/jsygc/home, createdTime=1754445529804, updatedTime=1754445529804, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=http://www.stae.com.cn/jsygc/author/login, submissionEditorUrl=http://www.stae.com.cn/jsygc/editor/login, submissionReviewUrl=http://www.stae.com.cn/jsygc/reviewer/login, submissionCeEditorUrl=, submissionAeEditorUrl=, option={"copyright":""})], databaseList=null, tenantJournalId=1146123166801305609, websiteList=[Website(id=1148243202391400884, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1146123166801305609, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/kxjsygc/CN, language=CN, createTime=1751692112777, createBy=18614031015, updateTime=1753520965431, updateBy=18614031015, name=科学技术与工程-中文站点, tplId=1146099689490845704, title=科学技术与工程, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1148622798802673703, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1148243202391400884, code=articleTextType, value=kx, createTime=1751782615614, updateTime=1751782615614, creator=18614031015, updator=18614031015), WebsiteProps(id=1148622798781702180, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1148243202391400884, code=banner, value=null, createTime=1751782615609, updateTime=1751782615609, creator=18614031015, updator=18614031015), WebsiteProps(id=1148622798769119267, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1148243202391400884, code=logo, value=https://castjournals.cast.org.cn/joweb/kjdb/CN/file/pic?fileId=j86gbwi+p0Idkyl5SzIlmQ==, createTime=1751782615606, updateTime=1751782615606, creator=18614031015, updator=18614031015), WebsiteProps(id=1148622798794285094, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1148243202391400884, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/kjdb/CN/file/pic, createTime=1751782615612, updateTime=1751782615612, creator=18614031015, updator=18614031015), WebsiteProps(id=1148622798790090789, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1148243202391400884, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1751782615611, updateTime=1751782615611, creator=18614031015, updator=18614031015)]), Website(id=1155914124811976731, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1146123166801305609, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/kxjsygc/EN, language=EN, createTime=1753521003206, createBy=18614031015, updateTime=1753521003206, updateBy=18614031015, name=科学技术与工程-英文站点, tplId=1146101810881728533, title=Science Technology and Engineering, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1155914371227308235, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1155914124811976731, code=articleTextType, value=kx, createTime=1753521061952, updateTime=1753521061952, creator=18614031015, updator=18614031015), WebsiteProps(id=1155914371210531016, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1155914124811976731, code=banner, value=null, createTime=1753521061947, updateTime=1753521061947, creator=18614031015, updator=18614031015), WebsiteProps(id=1155914371202142407, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1155914124811976731, code=logo, value=https://castjournals.cast.org.cn/joweb/kjdb/CN/file/pic?fileId=j86gbwi+p0Idkyl5SzIlmQ==, createTime=1753521061945, updateTime=1753521061945, creator=18614031015, updator=18614031015), WebsiteProps(id=1155914371223113930, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1155914124811976731, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/kjdb/CN/file/pic, createTime=1753521061950, updateTime=1753521061950, creator=18614031015, updator=18614031015), WebsiteProps(id=1155914371218919625, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1155914124811976731, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1753521061949, updateTime=1753521061949, creator=18614031015, updator=18614031015)])], journalTitle=科学技术与工程, weixinUrl=null, journalUrl=null, iacademicId=null, status=0, seqNo=null, journalTitleEn=Science Technology and Engineering, journalPhotoCn=UKU/O7GSka5polgCTkbIIw==, journalPhotoEn=5hwlULoNwcbj3xUmVi9MAQ==, journalFirstLetter=S, journalRecommend=null, journalNew=null, journalCollection=null, jcrJf=null, cjcrJf=null, jcrJfStr=null, cjcrJfStr=null, submissionFirstDecision=null, sciSubjectClassification=null, casSubjectClassification=null, citeScore=null, totalCitationFrequency=null, icpCode=null, psCode=null, advertisingLicenseCode=null, copyrightInformation=null, country=null, option=null, provinceCode=null, provinceName=null, collectFlag=false), detailUrlCn=https://castjournals.cast.org.cn/joweb/kxjsygc/CN/10.12404/j.issn.1671-1815.2404351, detailUrlEn=https://castjournals.cast.org.cn/joweb/kxjsygc/EN/10.12404/j.issn.1671-1815.2404351, pdfUrlCn=https://castjournals.cast.org.cn/joweb/kxjsygc/CN/PDF/10.12404/j.issn.1671-1815.2404351, pdfUrlEn=https://castjournals.cast.org.cn/joweb/kxjsygc/EN/PDF/10.12404/j.issn.1671-1815.2404351, aliStartDate=null, aliEndDate=null, collectionFlag=false, citedCount=null, citedUrl=null, reference=null)
收藏切换
求解无人机三维路径规划问题的动态多子群樽海鞘群算法
收藏切换
PDF下载
巫光福 , 王小林
科学技术与工程 | 论文·自动化技术、计算机技术 2025,25(13): 5501-5514
收起
收藏切换
科学技术与工程 | 论文·自动化技术、计算机技术 2025, 25(13): 5501-5514
求解无人机三维路径规划问题的动态多子群樽海鞘群算法
全屏
巫光福 , 王小林
作者信息
  • 江西理工大学信息工程学院, 赣州 341000
  • 巫光福(1977—),男,汉族,江西玉山人,博士,副教授,硕士研究生导师。研究方向:信息论与编码、密码学、信息安全、区块链等。E-mail:

Dynamic Multi-subswarm Salp Swarm Algorithm for Solving Unmanned Aerial Vehicles Three-dimensional Path Planning Problem
Guang-fu WU , Xiao-lin WANG
Affiliations
  • School of Information Engineering, Jiangxi University of Science & Technology, Ganzhou 341000, China
出版时间: 2025-05-08 doi: 10.12404/j.issn.1671-1815.2404351
文章导航
收藏切换

无人机三维路径规划问题是在复杂三维环境中找到起点与终点之间最优路径的组合优化问题,但大多数路径规划算法难以在可接受的时间和精度范围内找到可行路径,因此提出了一种基于K-means++聚类优化的动态多子群樽海鞘群算法用于解决上述问题。首先,在三维环境模型中结合高度成本提出新的成本函数,将路径规划问题转化为多维函数优化问题。其次,采用K-means++聚类算法对种群进行分群,并设计动态多子群机制均衡算法的全局搜索与局部开发;各子群结合多策略协同改进,在避免算法陷入局部最优的同时提高全局寻优能力。最后,在12个CEC2017基准测试函数中验证了该算法对比其他5种算法(ISSA、MSNSSA、IBSO、MBFPA、SSA)的性能后,将其应用于三维环境中对最优路径规划问题进行求解。在不同的环境模型下的仿真实验结果表明,该算法的平均有效路径率相较于其他5种算法分别提高了15.5%、11%、23%、20.5%和18%,这证实了该算法在复杂环境下具有优秀的寻优能力。

三维路径规划  /  成本函数  /  樽海鞘群算法  /  K-means++聚类算法  /  动态多子群  /  协同改进

The Unmanned aerial vehicles three-dimensional path planning problem is a combinatorial optimization problem to find the optimal path between the starting point and the endpoint in complex three-dimensional environment, but most path planning algorithms struggle to find feasible paths within acceptable time and precision range, therefore, a dynamic multi-subswarm salp swarm algorithm based on K-means++ clustering optimization was proposed to address the aforementioned issue. Firstly, a new cost function incorporating height cost was proposed within the three-dimensional environment model. The path planning problem was converted into a multi-dimensional function optimization issue. Secondly, the population was clustered using the K-means++ clustering algorithm, and a dynamic multi-subswarm mechanism was designed to balance the algorithm's global search and local exploitation. Each subswarm collaborates with multiple strategies for improvement, avoiding the algorithm from being trapped in local optima while enhancing global optimization capability. Finally, after validating the algorithm against five algorithms ISSA, MSNSSA, IBSO, MBFPA, and SSA using 12 CEC2017 benchmark test functions, it was applied to solve the optimal path planning problem in three-dimensional environments. Simulation results under different environmental models demonstrate that the algorithm's average effective path rate is increased by 15.5%, 11%, 23%, 20.5% and 18% compared to the other five algorithms, confirming its excellent optimization capability in complex environments.

three-dimensional path planning  /  cost function  /  salp swarm algorithm  /  K-means++ clustering algorithm  /  dynamic multi-subswarm  /  collaborative improvement
巫光福, 王小林. 求解无人机三维路径规划问题的动态多子群樽海鞘群算法. 科学技术与工程, 2025 , 25 (13) : 5501 -5514 . DOI: 10.12404/j.issn.1671-1815.2404351
Guang-fu WU, Xiao-lin WANG. Dynamic Multi-subswarm Salp Swarm Algorithm for Solving Unmanned Aerial Vehicles Three-dimensional Path Planning Problem[J]. Science Technology and Engineering, 2025 , 25 (13) : 5501 -5514 . DOI: 10.12404/j.issn.1671-1815.2404351
近年来,无人机(unmanned aerial vehicles,UAV)在各个领域、行业和应用中越来越受欢迎[1],由于其通用性强、机动性好、安装方便和运行成本适中等特点,无人机被广泛应用于军事、灾害管理、救援行动、公共服务、农业等各种领域[2]。由于无人机的特殊工作属性,在执行任务时将面临大跨度空间和复杂的飞行环境的问题,并且在遇到不同类型的威胁区域和障碍物时,也会在一定程度上增加任务的成本和飞行风险。因此,合理的路径规划不仅可以提高无人机的避障性能,还可以降低飞行成本,满足实际任务需求。无人机路径规划是指在飞行路径、飞行持续时间、燃料消耗和威胁数量或类型等一个或者多个约束条件的前提下,无人机在有障碍物的空间中找到起点到终点的无碰撞最优路径[3]
针对路径规划提出一系列算法,这些算法通常被区分为经典、启发式、机器学习和元启发式算法。经典算法的代表有Voronoi图(VD)[4]、快速探索随机树(rapidly-exploring random tree,RRT)[5]和人工势场(artificial potential field,APF)[6]等。这些算法在简单障碍条件下以较少的计算资源就可以提供较好的路径规划结果,但是在复杂的环境条件下,它们很难规划出可行路径。启发式算法的代表有A*[7]、贪婪启发式(greedy heuristics,GH)[8]等及其改进算法。与经典算法相比,启发式算法能在合理的时间内提供更优的路径,被认为是部分智能的,在复杂的环境条件和约束下,这些算法也很难获得可靠的路径。采用神经网络(neural network,NN)和强化学习(reinforcement learning,RL)等技术将机器学习引入路径规划中,这些方法已被用于静态和动态环境下以及在各种约束条件下获得无人机的最优飞行路径。然而,机器学习方法却常常受限于高昂的计算成本、大型数据集和大量的训练时间。元启发式算法因其快速收敛和在静态和动态环境条件下出色的寻优能力而被广泛应用于无人机的最优路径规划中,其中元启发式群智能算法更是备受国内外学者的瞩目,如粒子群算法(particle swarm optimization, PSO)[9]、灰狼优化算法(grey wolf optimization, GWO)[10]、蝴蝶优化算法(butterfly optimization algorithm, BOA)[11]等都属于这一类别。
樽海鞘群算法(salp swarm algorithm,SSA)是一种由Mirjalili等[12]于2017年提出的新型群智能算法。相比其他群体智能算法,SSA的优点在于参数少、结构简单且易于实现。SSA在解决大多数优化问题方面都表现出卓越的性能,但与同类群智能算法类似,在解决高维复杂优化问题时仍存在易陷入局部最优、全局搜索与局部开发不平衡等不足。为此,文献[13]提出一种基于Levy飞行和正余弦算子的改进樽海鞘群算法,结合改进的正余弦算子对领导者位置进行更新并在追随者位置引入levy飞行机制增强算法鲁棒性和稳定性。文献[14]将局部搜索算法(local search algorithm,LSA)和SSA结合使用,提高算法跳出局部最优能力。文献[15]将高斯随机行走集成到算法中平衡算法的开发与搜索能力,然后在局部最优停滞点引入一种双领导者再分散策略提高算法搜索效率最后运用于电动汽车的动态充电。文献[16]结合levy飞行策略更新领导者位置,并将其应用到多阈值图像分割,获得更高的分割效率和更精确的分割阈值。针对SSA在求解效率和寻优精度等方面取得一些成效,但SSA在解决三维路径规划问题时仍存在寻优能力差、求解效率低、易收敛于次优路径等问题。现提出一种基于K-means++聚类优化的动态多子群樽海鞘群算法(dynamic multi-subswarm salp swarm algorithm based on K-means++ clustering optimization,DMSSSA)用于解决上述问题。通过建立多约束三维环境模型,结合高度成本,提出一种三维路径规划成本函数,并采用三次B样条曲线插值技术处理路径坐标点,以保证路径的可飞性和平滑性。提出一种基于K-means++聚类优化的动态多子群樽海鞘群算法(DMSSSA),在12个CEC2017基准测试函数中验证DMSSSA对比其他5种对比算法的性能后,用Friedman检验检测其差异性。为验证DMSSSA在解决三维路径规划问题时的有效性,使DMSSSA与其他5种对比算法在三组不同复杂性的环境模型中进行仿真实验。
路径规划问题主要包括两个部分:路径规划算法和路径规划模型。路径规划算法包括经典算法、启发式算法、机器学习算法和元启发式算法。路径规划模型涵盖了内外部约束,内部约束包括无人机的性能约束,例如飞行高度、飞行距离和飞行转角等;外部约束则包括地形和威胁约束,例如地理范围、地形条件、威胁位置和威胁级别等。所采用目标函数是通过无人机的性能约束和外部飞行环境约束来考虑可能影响路径质量的一些必要因素,路径规划算法结合目标函数获取路径坐标点,并通过三次B样条曲线插值技术平滑化坐标点曲线,最后形成无人机可飞行的路径。
采用复合函数对无人机飞行环境的地形进行模拟,考虑了原始地形和障碍物区域等因素,形成三维数字高程地图模型,表达式为
Z1(x,y)=sin(y+a)+bsinx+ccos(d x 2 + y 2)+ecosy+fsin(f x 2 + y 2)+gcosy
式(1)中:在地图模型的笛卡尔坐标系中,Z1(x,y)为环境中的某些点的坐标,Z1为对应点的海拔高度,Z1(x,y)通过常数系数(a,b,c,d,e,f,g)的不同组合来模拟数字地图的多样化基础地形特征。
通过较高的天然山峰模拟无人机飞行环境中的障碍物,其数学模型可以表示为
Z2(x,y)= i = 1 nHiexp - ( x - x i ) 2 a i 2 - ( y - y i ) 2 b i 2+H0
式(2)中:Z2(x,y)用于描述数字地图的山峰坡度数据;HiH0和(xi,yi)分别为山峰的海拔高度、水平面高度和山峰的中心坐标点;aibi为山峰沿着xy轴方向的坡度衰减量用来控制山峰的坡度;n为环境模型中山峰的数量。威胁区域用空心圆柱体表示,无人机在飞行过程中需避让威胁区域,环境建模如图1所示。
在路径规划中常用路径参数化技术来描述路径,路径可以由路径规划算法结合目标函数生成的一系列的有序路径坐标点来表示。基于多约束的三维环境模型,DMSSSA生成的路径会出现对应的拐点,为使规划的路径更贴切无人机的真实飞行路径,降低无人机飞行成本,引入了三次B样条曲线插值[17]对路径进行平滑处理如图2所示。B样条曲线是由贝塞尔曲线发展而来,它改进了贝塞尔曲线的优化方式,弥补了其缺陷,B样条曲线上点的方程为
P(u)= i = 0 ndiNi,k(u)
式(3)中:di(i=0,1,…,n)为第i个路径点;Ni,k(u)为由递归公式[式(4)]定义的k阶归一化B样条基函数,即
N i , 1 ( u ) = 1 , u i u u i + 1 0 , N i , k ( u ) = u - u i u i + k - u i N i , k - 1 ( u ) +         u i + k + 1 - u u i + k + 1 - u i + 1 N i + 1 , k - 1 ( u ) , k > 1
该基本函数是由一个称为参数结的非递减序列确定,即{u0u1≤…≤un+k},此外,Ni,k(u)是每个区间上的分段多项式,并且满足: i = 0 nNi,k(t)≡1。
在三维空间中,高度的变化也会影响整体成本,所以在考虑整体成本函数时,高度成本应该是最有影响的因素。对于离线三维路径规划问题,地图信息和障碍物信息已给出,无人机可以在该环境中移动,路径成本和飞行转角成本也应该被纳入其中。由于路径规划方案是随机生成的,无人机可能会进入有威胁的区域,因此还必须考虑碰撞成本。
提出并引入飞行高度成本,其表示无人机根据估计路径需要改变飞行高度的次数所需的总成本,改变飞行高度需要改变推力,在实时的情况下这种推力的改变对于无人机的能效表现方面存在很大影响。设wiwi+1ST的海拔分量分别表示为wi(z)、wi+1(z)、S(z)和T(z),那么路径中的总海拔高度变化可以由式(5)确定,因此飞行高度总成本如式(7)所示。
Ealt= i = 1 n[ w i + 1 ( z ) - w i ( z )]+ T ( z ) - w n ( z )+ w 1 ( z ) - S ( z )
Ralt= T ( z ) - S ( z )
J1= E a l t - R a l t
在所有的路径规划问题中,较短的路径长度都具有较大的优势,这不仅减少了飞行时间,还降低了能源的消耗。考虑到无人机在整个任务期间以恒定速度飞行,路径成本(J2)被转换为从起点(S)到目标(T)的最短路径长度问题,ST之间的路径点可以表示为W=(S,w1,w2,…,wn,T),将两个路径点之间的欧氏距离记为路径段 w i w i + 1,那么J2可表示为
J2= i = 0 n w i w i + 1
为保证规划路径的可飞性引入飞行转角成本函数,无人机的飞行角度主要由水平转角α和垂直俯仰角β控制,且必须符合无人机的实际角度约束。如图3所示, w i w i + 1 w i + 1 w i + 2表示无人机飞行路径中的两个连续路径段,而 w ' i w ' i + 1 w ' i + 1 w ' i + 2是它们在xoy平面上的投影。在这点上,如果将k标记为沿轴正方向的单位向量,则路径段投影w'iw'i+1、水平转角αi和垂直俯仰角βi的计算公式如下。
$\boldsymbol{w}_{i}^{\prime} \boldsymbol{w}_{i+1}^{\prime}=\boldsymbol{k} \times\left(\boldsymbol{w}_{i} \boldsymbol{w}_{i+1} \times \boldsymbol{k}\right)$
$\alpha_{i}=\arctan \left(\frac{\boldsymbol{w}_{i}^{\prime} \boldsymbol{w}_{i+1}^{\prime} \cdot \boldsymbol{w}_{i+1}^{\prime} \boldsymbol{w}_{i+2}^{\prime}}{\boldsymbol{w}_{i}^{\prime} \boldsymbol{w}_{i+1}^{\prime} \cdot \boldsymbol{w}_{i+1}^{\prime} \boldsymbol{w}_{i+2}^{\prime}}\right) $
βi=arctan w i + 1 ( z ) - w i ( z ) w ' i w ' i + 1
式中:wi(z)、wi+1(z)为路径点wiwi+1对应的海拔分量,将无人机水平转角和垂直俯仰角超出约束的惩罚系数记为λ1λ2,无人机飞行转角成本为
J3=λ1 i = 1 n - 2αi2 i = 1 n - 1 β i - β i - 1
在无人机飞行的环境中,除了一些不同高度天然山峰障碍物外,还包括一些用圆柱体表示的威胁区域,若无人机与威胁区域中心的距离为dT, d T m a x表示威胁区域能辐射到的最大距离, d T m i n表示威胁区域内的危险区域,则无人机的碰撞成本(J4)可以表示为如式(13)所示。
J4= 0 , d T > d T m a x 1 d T , d T m i n d T d T m a x 1 , d T < d T m i n
目标函数用来计算路径规划的成本从而分析路径的优劣,成本函数包括飞行高度成本、路径长度成本、飞行转角成本和碰撞成本4个方面,目标函数的表达式为
J= k = 1 4kiJi
式(14)中:ki为特定因素在总成本函数中的权重,这些权重的取值取决于具体问题,并且对生成的最优路径起决定性作用的因素会被赋予更高的权重。
樽海鞘群以链式结构存在,领导者是位于链首“引导群”的樽海鞘个体,其余个体则被认为是“相互追随”的追随者,在觅食阶段,领导者负责引导种群向食物源位置游动,种群初始化为
$\boldsymbol{X}_{i, j}=\operatorname{rand}(N, D)\left(\boldsymbol{u} \boldsymbol{b}_{j}-\boldsymbol{l} \boldsymbol{b}_{j}\right)+\boldsymbol{l} \boldsymbol{b}_{j}$
式(15)中:Xi,j为第i个樽海鞘在第j维空间的位置;N为樽海鞘种群规模;D为空间维度;ubjlbj分别为搜索空间的上下界。
在SSA中,食物源的位置是全局最优解,负责引导领导者的位置更新,领导者位置更新如下。
$\boldsymbol{X}_{1, j}^{t}=\left\{\begin{array}{ll} \boldsymbol{F}_{j}+c_{1}\left[\left(\boldsymbol{u} \boldsymbol{b}_{j}-\boldsymbol{l} \boldsymbol{b}_{j}\right) c_{2}+\boldsymbol{l} \boldsymbol{b}_{j}\right], & c_{3} \geqslant 0.5 \\ \boldsymbol{F}_{j}-c_{1}\left[\left(\boldsymbol{u} \boldsymbol{b}_{j}-\boldsymbol{l} \boldsymbol{b}_{j}\right) c_{2}+\boldsymbol{l} \boldsymbol{b}_{j}\right], & c_{3}<0.5 \end{array}\right. $
式(16)中: X 1 , j tFj分别为第t次迭代第j维领导者和食物源的位置;c2c3为[0,1]区间内均匀分布的随机数;c1为平衡算法全局搜索与局部开发的重要因素,并且参数c1在迭代过程中自适应减小,如式(17)所示。
c1=2 e - ( 4 t T m a x ) m
追随者的位置更新公式为
$\boldsymbol{X}_{i, j}^{t+1}=\frac{1}{2}\left(\boldsymbol{X}_{i, j}^{t}+\boldsymbol{X}_{i-1, j}^{t}\right)$
式(18)中: X i , j t + 1 X i , j t分别为个体i(i≥2)在j维空间的更新位置和原位置; X i - 1 , j t为前一个个体的j维空间位置。
樽海鞘个体在迭代过程中可能会越界移动到搜索空间之外,用式(19)将其代回搜索空间。
$\boldsymbol{X}_{i, j}=\left\{\begin{array}{ll} l \boldsymbol{b}_{j}, & \boldsymbol{X}_{i, j} \leqslant l \boldsymbol{b}_{j} \\ \boldsymbol{u} \boldsymbol{b}_{j}, & \boldsymbol{X}_{i, j} \leqslant \boldsymbol{u} \boldsymbol{b}_{j} \\ \boldsymbol{X}_{i, j}, & \text { 其他 } \end{array}\right. $
已有诸多学者采用多子群策略来解决单子群元启发式群智能算法导致的种群多样性差、收敛效率低等问题,如陈忠云等[18]提出多子群共生策略,根据适应度值将种群均匀划分为多个子群,分别执行不同的位置更新策略来获得更好的寻优精度和收敛速度。李大海等[19]引入新式小生境机制将种群自动划分为若干个子群,以保持种群多样性并提升算法的收敛速度。在SSA算法的基础上,保持种群个体总量不变的条件下,结合K-means++聚类算法将种群动态的划分为领导者、追随者和链尾者3个子群。首先在领导者位置更新公式的参数c1中引入随机游走因子来控制领导者的收敛特性,以更好地平衡算法的搜索和开发能力;然后采用趋优追随机制来更新追随者位置,充分发挥精英个体的引导作用,增强全局搜索能力;最后使用精密消除策略来更新链尾者的位置,使其在更优的位置进行精细搜索,增强局部开发能力。
聚类算法的目的是根据特定标准将数据集分成不同的簇,将相似度高的数据归为同一簇,而将差异较大的数据分到不同的簇中。K-means++聚类算法是Arthur等[20]在2007年提出的一种聚类算法,相较于K-means聚类算法随机选择的初始质心,K-means++聚类算法在一定程度上解决了对初始质心选择的敏感性问题。K-means++聚类算法是一种分区聚类算法,将给定的数据集划分为簇并找到数据集中各个数据点与任一簇质心之间的最小平方误差,然后将每个数据点分配给距离它最近的簇,具体步骤如下。
步骤1 确定簇的个数k,从数据集X中均匀随机的选择一个初始簇质心μ1
步骤2 D(x)表示数据点x到任一质心的最短欧氏距离,以最大比例 D ( x ' ) 2 x X D ( x ) 2选择下一个质心μj=x'X(j=2,3,…,k),重复此步骤直至总共取到k个质心。
步骤3 将簇Nj设置为X中所有距离μj比距离μi(ij)更近数据点的集合,距离统一用欧氏距离度量。
步骤4 重新计算簇Nj的质心:μj= 1 N j x N jx
步骤5 重复步骤3和步骤4,直至质心μ不再变化。
K-means++聚类算法的目标是将所有数据点与簇质心之间的平方误差之和最小化,其表达式为
$\varphi(X)=\sum_{j=1}^{k} \sum_{x_{i} \in N_{j}}\left\|x_{i}-\mu_{j}\right\|^{2} $
式(21)中:xi为簇Nj内的数据点;μj 为簇内质心。
结合K-means++聚类算法提出动态多子群划分策略如下。
首先确定子群个数,选择种群适应度值最优个体的位置当作第一子群的初始质心。
其次计算所有樽海鞘个体与该质心的最短欧氏距离D(x),根据最大欧氏距离平方比 D ( x ' ) 2 x X D ( x ) 2依次确定其他子群初始质心位置,再将所有樽海鞘个体分配到距离最近质心所在的子群。
最后各子群重新计算质心的位置,直至子群质心的位置始终不变时,即可确定子群质心的最终位置以及子群个体分布及数量Ni,如图4(a)所示。将第一质心所在的子群划分为领导者子群,使其能够在食物源周围进行搜索,负责平衡算法的搜索与开发。通过计算第一子群的质心μ1与其他两个质心μj之间的欧式距离Lj来划分追随者子群和链尾者子群的位置[式(21)],最终种群划分如图4(b)所示。为了使樽海鞘能通过快速协调的变化和觅食来实现更好的搜索,将沿用基础樽海鞘群算法的链式建模思想,按照子群内所有个体与子群质心的欧氏距离从小到大顺序把所有个体链接在一起,最后把领导者子群位于链首,随后是追随者子群,最后是链尾者子群。
L j t= ( μ j t - μ 1 t ) 2,j∈(2,3,…,k)
在领导者位置更新公式[式(16)]中,参数c1是SSA中最为关键且敏感的参数,起着平衡算法全局搜索与局部开发能力的作用。在式(22)中,将m的值设为2.5,参数c1能使算法的搜索能力和开发能力处于更好的平衡状态[18],其次引入随机游走因子R,让参数c1的取值随迭代进程的变化而变化,以达到改变领导者收敛特性的效果。如图5所示,在迭代前期,DMSSSA中参数c1的取值始终控制在0和原SSA的参数c1之间,且在较长的时间取值为0,这让领导者个体在迭代前期向着食物源的位置游走,且只负责对食物源周围进行搜索,能较好地维持算法的全局搜索能力;在迭代后期,参数c1的取值趋近于0,领导者个体将紧跟食物源的位置游走,此时领导者负责锁定食物源的位置,引导追随者和链尾者进行局部位置更新,以增强算法的局部开发能力。在DMSSA的领导者位置更新策略中,参数c1起着至关重要的作用,随机因子R的引入能增强领导者在子群中的协同能力。将式(17)替换为式(22)来更新参数c1,再根据式(16)对领导者个体位置进行更新,公式为
c1=2 e - 4 R t T m a x m
式(22)中:随机游走因子R是[0,50]的随机整数。参数c1R的增大而减小。
在标准SSA中,追随者新个体通过链中相邻两个体位置产生,如式(18)所示,此种方法存在以下不足:没有考虑新个体与原有个体的适应度优劣而盲目替换原有个体;追随者个体仅根据链中相邻个体位置进行更新,使新生成个体对前一个个体有较强的依赖性,缺乏与其他个体之间的学习。因此文献[21]引入线性递减惯性权重来决定前一个个体对当前个体的影响程度,在一定程度上增强了算法的局部搜索能力,但可能使得非精英个体在迭代过程中发挥作用;文献[22]提出了一种自适应惯性权重的方法引入种群的成功率,进一步增强了局部搜索能力,但仍存在非精英个体在引导过程中发挥作用的问题。故提出并引入趋优追随机制更新追随者子群,使其根据链中相邻个体适应度关系采用不同的更新机制,加快追随者个体趋向适应度更优的位置,减弱其对前一个个体的依赖性,加强与其他个体之间的信息交流提高算法的收敛速度,提出基于趋优追随机制改进的追随者个体位置更新策略具体如下。
(1)加速追随机制。若前一个个体的适应度值比当前个体更优时,引入加速追随机制更新追随者的位置,即
$\boldsymbol{X}_{i, j}^{t+1}=\frac{1}{2} r_{1} \boldsymbol{X}_{i, j}^{t}+\left(1-\frac{1}{2} r_{1}\right) \boldsymbol{X}_{i-1, j}^{t} $
(2)反向游走机制。若当前个体适应度值优于前一个个体时,采用反向游走机制使当前个体不再追随前一个个体,朝反方向游动,其位置更新方式为
$\boldsymbol{X}_{i, j}^{t+1}=\boldsymbol{X}_{i, j}^{t}+r_{1}\left(\boldsymbol{X}_{i-1, j}^{t}-\boldsymbol{X}_{i, j}^{t}\right) $
(3)随机跳出机制。若前一个个体的适应度值与当前个体相当不足以引导当前个体趋向更优位置时,算法容易陷入局部最优,此时在随机选择的一个个体位置上采用与领导者相似的位置更新方式来帮助当前个体跳出,位置更新公式如下。
$\boldsymbol{X}_{i, j}^{t+1}=\left\{\begin{array}{l} \boldsymbol{X}_{r, j}^{t}+r_{1}\left[\left(\boldsymbol{u} \boldsymbol{b}_{j}-\boldsymbol{l} \boldsymbol{b}_{j}\right) r_{2}+\boldsymbol{l} \boldsymbol{b}_{j}\right], r_{3} \geqslant 0.5 \\ \boldsymbol{X}_{r, j}^{t}-r_{1}\left[\left(\boldsymbol{u} \boldsymbol{b}_{j}-\boldsymbol{l} \boldsymbol{b}_{j}\right) r_{2}+\boldsymbol{l} \boldsymbol{b}_{j}\right], r_{3}<0.5 \end{array}\right. $
式(25)中:N1r<N2; X r , j t为第t次迭代第j维空间的追随者子群中随机选择的一个樽海鞘个体;参数r1r2r3为区间[0,1]生成的随机数。
为了获得更多高质量的解向量,许多学者将对立学习[14]引入算法中,尽管这种策略是有效的,但它也存在不足:若最优解恰好位于对立学习解和原始解的对称平面上,这两个解对应的适应度值将完全相同,在这种情况下,对立学习策略就会失效。受到进化理论“适者生存”的启发,结合自适应T分布提出精密消除策略来淘汰原链尾者子群个体并让具有更优适应度的个体替代,具体公式为
$\boldsymbol{X}_{i, j}^{t+1}=\boldsymbol{F}_{j}+(\boldsymbol{u} \boldsymbol{b}-\boldsymbol{l} \boldsymbol{b}) R_{\mathrm{r}} T\left[\frac{1}{m} \exp \left(\frac{\ln t_{\mathrm{c}}}{t_{\mathrm{c}}}\right)^{t}\right] $
式(26)中: Rr为动态半径,Rr=1-t/Tmax,t为当前迭代次数, Tmax为最大迭代次数。
T分布为统计学中使用的抽样分布,由缩放因子m和迭代临界点tc控制自适应T分布的自由度,使其能够根据迭代次数实现自适应调节,在迭代前期较小的自由度使链尾者个体有更大的突变概率,以获得更优解,在迭代后期较大的自由度使链尾者在食物源位置附近进行突变,来保持种群多样性。在迭代后期往往会出现种群个体聚集的情况,精密消除策略将自适应T分布、动态半径和搜索上下界相乘以构建弹性半径,使新生成个体的位置在迭代后期仍有一定的向外扩展概率,以提高算法的精细搜索能力,避免算法陷入局部最优。将缩放因子m设置为10,将迭代临界点tc设置为Tmax/5,t为当前迭代次数,Tmax为最大迭代次数。精密消除策略的示意图如图6所示。
综合3.1节和3.2节,DMSSSA算法的伪代码如下。
输入:最大迭代数Tmax、种群个体数量N、搜索上下边界ub和lb、问题维度D;
输出:全局最优位置Fj以及其适应度值f(Fj)。
[1]种群初始化:Xi=(xi,1,xi,2,…,xi,j,…,xi,D),设置相关参数;
[2] 计算种群适应度并排序,确定食物源Fj;
[3]while tTmax then
[4]利用K-means++聚类算法对种群进行分群,确定各子群个体数量N1N2N3;
[5] for i=1:N
[6] if iN1 then
[7] 按式(22)计算c1,并根据式(16)更新领导者位置;
[8] else if N1<iN1+N2
[9] 按式(23)~式(25)更新追随者位置;
[10] else if N1+N2<iN
[11] 按式(26)更新链尾者位置;
[12] end if
[13] end for
[14] 再次计算种群适应度值,更新食物源位置;
[15]end while
[16]输出最优位置Fj及其适应度值f(Fj)。
DMSSSA算法流程图如图7所示。
传统樽海鞘群算法的时间复杂度为O[T(N×D+N×f)][12],其中D为问题维度,T为算法的最大迭代数,N为种群个体数量,f为待解决问题适应度函数的计算量。根据算法的伪代码和图7,可以计算出DMSSSA算法的时间复杂度,在迭代之前初始化阶段需要对N个个体的每个维度进行初始化设置,所以该步骤的时间复杂度表示为O1(N×D)。在初始化之后需要对全部个体进行适应度评估并且使用快速排序从小到大排序,然后确定食物源的位置,所以该步骤的时间复杂度为O2(N×f+N×log2N)。进入迭代之后,需利用K-means++聚类算法进行划分子群,根据文献[20]可以将该步骤的时间复杂度表示为O3[Tlog2k)],其中k为质心数量。领导者、追随者和链尾者子群个体进行相应的位置更新,由于樽海鞘个体总量不变,且迭代次数都为T,所以该步骤的时间复杂度可以表示为O4[T(N×D)]。各子群在每次迭代更新之后,需要对全部个体再次计算适应度值并更新食物源的位置,该步骤时间复杂度为O5[T(N×f)+T×N]=O5[T(N×f)]。综上所述,合并同类项之后DMSSSA的时间复杂度为O=O1+O2+O3+O4+O5=O[T(N×D+N×f )],DMSSSA的时间复杂度与SSA为同一数量级,证明DMSSSA在提升寻优性能的情况下并未增加算法复杂性。
所有仿真实验均在相同的实验环境中进行,实验仿真软件为MATLAB R2022b,运行在Intel(R) i7-8750H @2.20GHz、16.0GB内存和Windows11(64位)操作系统上。实验对DMSSSA以及其他5种元启发式算法:ISSA[23]、MSNSSA[18]、IBSO[24]、MBFPA[25]、SSA[12]进行性能测试。选取了CEC2017测试集中的12个具有代表性的测试函数,其中F1~F4为多峰函数、F5~F8为混合函数、F9~F12为复合函数。所选取的这些测试函数复杂度较高且含有大量的局部最优解,测试集函数如表1所示。
将DMSSSA与其他5个对比算法在维度为100的测试函数上进行测试,对比算法的参数设置皆取自原文献,具体设置如表2所示,每个算法迭代500次,并在各个测试函数上独立运行30次以排除实验数据的随机性。评估各算法稳定性和优化能力的指标包括:30次运行后获得的最优解的平均值、方差和排名。排名评估标准优先考虑平均值,其次是方差,最优解平均值反映出算法的寻优性能,方差反映出算法的稳定性,如表4所示,排名最优者用加粗字体表示。
表5所示,DMSSSA在12个测试函数中皆有较好的表现,最优平均值均是第一,在总排名也取得了第一的成绩。DMSSSA的方差除了在测试函数F6F11中排名略落后于MBFPA和MSNSSA外,在其他10个测试函数中均取得第一,总的方差排名也是第一,说明动态多子群策略相较于其他算法的改进策略在优化能力、稳定性和鲁棒性方面具有较大的优势。DMSSSA在所有测试函数上的收敛精度都优于其他算法,在测试函数F5F6F7F10F12中的收敛精度比其他对比算法高一个数量级。
图8中给出了各算法在100维下运行30次的平均收敛曲线图,为了更直观地对比实验结果,在部分收敛曲线上做了放大处理,如图8(a)图8(e)所示。在图8(a)~图8(d)多峰函数中,DMSSSA均以较快的收敛速度领先于其他算法,在F2F3F4中,大约迭代到300次时的收敛精度已经超过其他对比算法的最终收敛精度,随着迭代次数的增加,算法的最终收敛精度要优于其他改进算法;图8(e)~图8(h)为混合函数F5F6F7F8的收敛曲线图,算法在混合函数上也有优秀的表现,收敛速度和收敛精度都明显优于其他改进算法,尤其是在F5F7中,其收敛精度比其他算法低1~2个数量级。图8(i)~图8(l)为复合函数F9F10F11F12的收敛曲线图,尽管测试函数含有大量的局部最优解,例如,在F9函数中,其他一些对比算法很早就陷入了局部最优,并在迭代到350次左右停止收敛,而DMSSSA算法在迭代到100~200次时短暂地陷入局部最优,迭代至200次后迅速搜索到更优解,由此可以反映出DMSSSA跳出局部最优的能力,函数F6F8也可以反映出算法跳出局部最优的能力。
为进一步证明DMSSSA算法与其他5种对比算法存在显著性差异,采用Friedman检验对各算法30次运行结果的平均值进行分析。Friedman检验[26]是用于检测各数据集之间是否存在显著性差异的非参数双向方差分析方法。结果如表3所示,其中的P表示渐进显著性,用来判断各算法之间是否存在显著性差异,若P<0.01则表明算法的各项数据之间存在显著性差异。对于30维、50维、100维,P分别为2.312 5×10-9、5.342 3×10-10和3.776 4×10-9,都远远小于0.01,说明DMSSSA算法在3个维度上都与其他对比算法存在显著性的差异。表2中其他值表示算法在各维度下秩的平均值,在3个不同维度中,DMSSSA的秩均值都是最小的,进一步证明了DMSSSA的寻优能力。综上所述,DMSSSA总体上明显优于其他对比算法。
为了验证DMSSSA各个策略的有效性,对DMSSSA中改进策略进行完整性消融实验。设将标准SSA按动态多子群策略划分的算法为DMSSSA1,在DMSSSA1的基础上只对领导者个体位置更新进行改进的算法为DMSSSA2,在DMSSSA2的基础上引入追随者个体趋优追随策略的算法为DMSSSA3,最后在DMSSSA3的基础上增加精密消除策略的算法为DMSSSA。将标准SSA、DMSSSA1、DMSSSA2、DMSSSA3和DMSSSA基于表1的基准函数进行测试,各算法迭代次数为500,并独立运行30次,算法参数设置均保持一致,表4展现了DMSSSA不同改进策略收敛精度情况。
表4中可以看出,DMSSSA1在12个测试函数中的收敛精度都优于标准SSA,说明动态多子群分群策略的优越性。在分群策略的基础上对3个子群的位置更新方式进行改进的算法DMSSSA2、DMSSSA3和DMSSSA的测试结果都优于DMSSSA1,说明各子群位置更新策略的改进对算法性能有显著提升,并且DMSSSA的测试结果比DMSSSA2和DMSSSA3都要好,说明多策略协同改进进一步提升了算法的性能。实验结果表明每个策略在DMSSSA上都是有效的,各个策略都是不可或缺的,共同提升了DMSSSA的综合寻优性能。
无人机路径规划问题本质上是一个非确定性多项式求解问题,采用DMSSSA来解决这一问题,则是通过对目标函数进行求解寻优。樽海鞘链的每一只樽海鞘代表着一条可能的路径,其维数对应着路径点的个数,而樽海鞘个体的各维数值则代表着路径点的坐标。在路径规划中,樽海鞘个体的适应度则对应着目标函数的值,该目标函数由飞行高度成本函数、路径长度成本函数、飞行转角成本函数和碰撞成本函数构成。在樽海鞘群中,领导者子群代表当前目标函数值较优的个体,链尾者子群则代表目标函数值较差的个体。通过不断更新领导者、追随者和链尾者的位置,樽海鞘群逐步趋向最优位置,经过多次迭代,最终得到的最优解即为最佳路径。
三维路径规划采用与上述基准函数测试相同的软硬件实验环境,各维度范围在[0,200]的空间中,建立了3个不同的环境模型,路径规划难度依次递增。使用上述算法性能测试时所用的5种算法作为对比算法,为保证实验的公平性,各算法均采用原文参数设置,统一设置起点坐标为S(0,0,20),终点坐标为T(200,200,20),种群规模为50,迭代次数为200。为减少实验的偶然性让各算法分别运行30次,分别统计了路径长度最优值、平均值、方差、平均用时和有效路径率等指标用来体现算法性能的优劣。这些指标中,平均值越小代表路径规划平均成本越低,方差体现出在面对复杂三维环境时算法的稳定性和鲁棒性,有效路径率则反映算法在多次独立实验中找到满足约束路径的比例。
环境模型1如图9(a)所示,在该模型中仅设置了少量的山体障碍物和威胁区域,同时各座山体分布地在较为分散,这样算法在路径规划时具有更高的概率找到最优路径。实验结果如表6所示,所有算法均在30次独立运行时能够规划出有效路径,如图9(c)所示,从收敛精度上看,DMSSSA都明显要低于其他算法,从收敛曲线上看,DMSSSA的曲线更为平滑,拐点较少,证明该算法在多次独立运行中具有较强的稳定性。
环境模型2和模型3属于高难度模型,用于进一步评估DMSSSA在三维路径规划的性能,如图9(d)~图9(g)所示,相较于模型1其增加了山体障碍物的数量,山体沿XY轴的坡度均减小使其变得更加陡峭,明显增加了路径规划的难度。在独立运行次数为30和迭代次数为200的条件下,仅有DMSSSA在30次测试中都规划出有效路径。在模型2中,DMSSSA的平均路径长度相较于ISSA、MSNSSA、IBSO、MBFPA和SSA分别降低了25.51%、26.34%、50.86%、33.72%和34.06%,当然,这种优越的性能是以更高的计算时间为代价,在计算时间上,DMSSSA的平均用时位于ISSA和MSNSSA之后。在模型3中,所提算法的平均路径长度分别降低了18.91%、3.38%、15.45%、23.01%和10.61%,有效路径率分别提高了27%、14%、25%、29%和19%,在计算时间上,DMSSSA位于MSNSSA之后,领先于ISSA、IBSO、MBFPA和SSA。
综上所述,基于K-means++聚类优化的动态多子群樽海鞘群算法在不同的环境模型下均有良好的鲁棒性,收敛速度快,寻优能力强,都能够以100%的效率规划出有效路径,面对复杂地形有更显著的优势。
提出一种基于K-means++聚类优化的动态多子群樽海鞘群算法用于求解无人机三维路径规划问题。首先结合K-means++聚类算法设计动态多子群机制以平衡算法的全局搜索与局部开发,各子群结合多策略协同改进提高算法全局寻优能力同时避免算法陷入局部最优。其次,将DMSSSA放在12个CEC2017测试函数上测试其性能,实验证明了DMSSSA的寻优能力优于其他对比算法;最后将该算法应用在3个不同复杂性的三维环境模型中,对最优路径规划问题进行求解。仿真实验结果表明,在3种不同的环境模型下,DMSSSA都能高效地规划出有效路径,并且平均有效路径率相比于ISSA、MSNSSA、IBSO、MBFPA和SSA提高了15.5%、11%、23%、20.5%和18%。在3种环境模型中的平均规划路径长度最小,在复杂模型规划的路径长度分别比其他算法降低了22.21%、14.86%、33.15%、28.36%和22.33%,从而证明了DMSSSA在无人机三维路径规划问题中的有效性。尽管DMSSSA在算法设计和路径规划上有较好的性能,但是也存在一些局限,当问题的复杂性和维度增加时,DMSSSA会增加算法的计算复杂性和计算时间。因此在未来的工作中将尝试使用分布式并行计算方法来减少路径规划问题的计算时间,并引入更多的约束条件,比如动态障碍物约束和飞行速度约束,以更好地适应和满足无人机的特殊作业需求。
  • 国家自然科学基金(11461031)
  • 江西省科技厅重点项目(20212ACB202003)
  • 密码科学技术国家重点实验室开放课题面上项目(MMKFKT202123)
参考文献 引证文献
排序方式:
[1]
Yahia H S, Mohammed A S. Path planning optimization in unmanned aerial vehicles using meta-heuristic algorithms: a systematic review[J]. Environmental Monitoring and Assessment, 2023, 195(1): 30.
[2]
Khan M T R, Muhammad S M, Ru Y, et al. Aspects of unmanned aerial vehicles path planning: overview and applications[J]. International Journal of Communication Systems, 2021, 34(10): e4827.
[3]
Poudel S, Arafat M Y, Moh S. Bio-inspired optimization-based path planning algorithms in unmanned aerial vehicles: a survey[J]. Sensors, 2023, 23(6): 3051.
[4]
Baek J, Han S I, Han Y. Energy-efficient UAV routing for wireless sensor networks[J]. IEEE Trans on Vehicular Technology, 2019, 69(2): 1741-1750.
[5]
Kiani F, Seyyedabbasi A, Aliyev R, et al. Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms[J]. Neural Computing and Applications, 2021, 33(22): 15569-15599.
[6]
Woods A C, La H M. A novel potential field controller for use on aerial robots[J]. IEEE Trans on Systems Man and Cybernetics: Systems, 2017, 49(4): 665-676.
[7]
Wang H W, Qi X Y, Lou S J, et al. An efficient and robust improved A* algorithm for path planning[J]. Symmetry, 2021, 13(11): 2213.
[8]
Silva A J, Silva A M, Motta T C F, et al. Heuristic and genetic algorithm approaches for UAV path planning under critical situation[J]. International Journal on Artificial Intelligence Tools, 2017, 26(1): 1760008.
[9]
Wang D S, Tan D P, Liu L. Particle swarm optimization algorithm: an overview[J]. Soft Computing, 2018, 22: 387-408.
[10]
Mirjalili S, Mirjalili S M, Lewis A. Grey wolf optimizer[J]. Advances in Engineering Software, 2014, 69: 46-61.
[11]
Arora S, Singh S. Butterfly optimization algorithm: a novel approach for global optimization[J]. Soft Computing, 2019, 23: 715-734.
[12]
Mirjalili S, Gandomi A H, Mirjalili S Z, et al. Salp swarm algorithm: a bio-inspired optimizer for engineering design problems[J]. Advances in Engineering Software, 2017, 114: 163-191.
[13]
Zhang J, Wang J S. Improved salp swarm algorithm based on Levy flight and sine cosine operator[J]. IEEE Access, 2020, 8: 99740-99771.
[14]
Tubishat M, Idris N, Shuib L, et al. Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection[J]. Expert Systems with Applications, 2020, 145: 113122.
[15]
Ahmed M, Kamel S H, Abbasy N H, et al. A gaussian random walk salp swarm algorithm for optimal dynamic charging of electric vehicles[J]. Applied Soft Computing, 2023, 147: 110838.
[16]
邢致恺, 贾鹤鸣, 宋文龙. 基于莱维飞行樽海鞘群优化算法的多阈值图像分割[J]. 自动化学报, 2021, 47(2): 363-377.
Xing Zhikai, Jia Heming, Song Wenlong. Levy flight trajectory-based salp swarm algorithm for multilevel thresholding image segmentation[J]. Acta Automatica Sinica, 2021, 47(2): 363-377.
[17]
Gupta H, Verma O P. A novel hybrid coyote-particle swarm optimization algorithm for three-dimensional constrained trajectory planning of unmanned serial vehicle[J]. Applied Soft Computing, 2023, 147: 110776.
[18]
陈忠云, 张达敏, 辛梓芸. 多子群的共生非均匀高斯变异樽海鞘群算法[J]. 自动化学报, 2022, 48(5): 1307-1317.
Chen Zhongyun, Zhang Damin, Xin Ziyun. Multi-subpopulation based symbiosis and non-uniform Gaussian mutation salp swarm algorithm[J]. Acta Automatica Sinica, 2022, 48(5): 1307-1317.
[19]
李大海, 李鑫, 王振东. 融合小生境机制的增强麻雀搜索算法及其应用[J]. 计算机应用研究 2024, 41(4): 1077-1085.
Li Dahai, Li Xin, Wang Zhendong. Enhanced sparrow search algorithm by integrating niche mechanism and its application[J]. Application Research of Computers, 2024, 41(4): 1077-1085.
[20]
Arthur D, Vassilvitskii S. K-means++: the advantages of careful seeding[C]// In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, 2007, 7: 1027-1035.
[21]
张达敏, 陈忠云, 辛梓芸, 等. 基于疯狂自适应的樽海鞘群算法[J]. 控制与决策, 2020, 35(9): 2112-2120.
Zhang Damin, Chen Zhongyun, Xin Ziyun, et al. Salp swarm algorithm based on craziness and adaptive[J]. Control and Decision, 2020, 35(9): 2112-2120.
[22]
白钰, 彭珍瑞. 基于自适应惯性权重的樽海鞘群算法[J]. 控制与决策, 2022, 37(1): 237-246.
Bai Yu, Peng Zhenrui. Salp swarm algorithm based on adaptive inertia weight[J]. Control and Decision, 2022, 37(1): 237-246.
[23]
Tudose A M, Picioroaga I I, Sidea D O, et al. Solving single-and multi-objective optimal reactive power dispatch problems using an improved salp swarm algorithm[J]. Energies, 2021, 14(5): 1222.
[24]
黎观锋, 梁志坚, 杨武. 基于改进二进制蛇优化算法的配电网故障定位[J]. 科学技术与工程, 2024, 24(18): 7710-7718.
Li Guanfeng, Liang Zhijian, Yang Wu. Fault location in distribution networks based on an improved binary snake optimization algorithm[J]. Science Technology and Engineering, 2024, 24(18): 7710-7718.
[25]
Wang Z, Luo Q, Zhou Y. Hybrid metaheuristic algorithm using butterfly and flower pollination base on mutualism mechanism for global optimization problems[J]. Engineering with Computers, 2021, 37: 3665-3698.
[26]
张新明, 姜云, 刘尚旺, 等. 灰狼与郊狼混合优化算法及其聚类优[J]. 自动化学报, 2022, 48(11): 2757-2776.
Zhang Xinming, Jiang Yun, Liu Shangwang, et al. Hybrid coyote optimization algorithm with grey wolf optimizer and its application to clustering optimization[J]. Acta Automatica Sinica, 2022, 48(11): 2757-2776.
2025年第25卷第13期
PDF下载
387
157
引用本文
BibTeX
文章信息
doi: 10.12404/j.issn.1671-1815.2404351
  • 接收时间:2024-06-12
  • 首发时间:2025-07-09
  • 出版时间:2025-05-08
补充材料
相关文章
文章信息
作者
出版历史
  • 收稿日期:2024-06-12
  • 修回日期:2025-02-05
基金
国家自然科学基金(11461031)
江西省科技厅重点项目(20212ACB202003)
密码科学技术国家重点实验室开放课题面上项目(MMKFKT202123)
作者信息
    江西理工大学信息工程学院, 赣州 341000
参考文献
分享链接
https://castjournals.cast.org.cn/joweb/kxjsygc/CN/10.12404/j.issn.1671-1815.2404351
分享至
全文二维码

扫描看全文

引用本文
BibTeX
本文的引用情况
2种不同金属材料的力学参数

Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)

Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏