{"title":"Multi-strategy ensemble wind driven optimization algorithm for robot path planning","authors":"Chao Zhang , Yi Yang , Wei Chen","doi":"10.1016/j.matcom.2024.11.023","DOIUrl":null,"url":null,"abstract":"<div><div>In this study, a multi-strategy ensemble wind driven optimization (MEWDO) algorithm is proposed and combined with cubic spline interpolation to solve path planning challenges for single and multiple robots. The proposed MEWDO uses a Chebyshev map to initialize air particle populations and increase population diversity. A segmented learning local exploitation strategy is proposed to upgrade the exploitation ability of the algorithm. To enhance the exploration ability of the algorithm, a mutation strategy is introduced that disturbs dimensions one by one, based on the <em>F</em>-distribution with asymmetric characteristics. First, performance comparison experiments were conducted between MEWDO and seven other intelligent algorithms on 16 benchmark test functions. The results showed that MEWDO performed the best. Second, path planning simulation experiments were conducted in three static environments to compare MEWDO with three intelligent algorithms and the artificial potential field method, and MEWDO outperformed the comparison algorithms in terms of the planned shortest path and algorithm stability. In some complex rescue environments, multiple robots are frequently sent to perform tasks from different routes to improve the rescue success rate. For this purpose, MEWDO was used to plan task paths for five robots to test its performance in multi-robot path planning. The results showed that MEWDO finds the best route for all five robots to perform the task in a complex environment.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"231 ","pages":"Pages 144-159"},"PeriodicalIF":4.4000,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics and Computers in Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378475424004798","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In this study, a multi-strategy ensemble wind driven optimization (MEWDO) algorithm is proposed and combined with cubic spline interpolation to solve path planning challenges for single and multiple robots. The proposed MEWDO uses a Chebyshev map to initialize air particle populations and increase population diversity. A segmented learning local exploitation strategy is proposed to upgrade the exploitation ability of the algorithm. To enhance the exploration ability of the algorithm, a mutation strategy is introduced that disturbs dimensions one by one, based on the F-distribution with asymmetric characteristics. First, performance comparison experiments were conducted between MEWDO and seven other intelligent algorithms on 16 benchmark test functions. The results showed that MEWDO performed the best. Second, path planning simulation experiments were conducted in three static environments to compare MEWDO with three intelligent algorithms and the artificial potential field method, and MEWDO outperformed the comparison algorithms in terms of the planned shortest path and algorithm stability. In some complex rescue environments, multiple robots are frequently sent to perform tasks from different routes to improve the rescue success rate. For this purpose, MEWDO was used to plan task paths for five robots to test its performance in multi-robot path planning. The results showed that MEWDO finds the best route for all five robots to perform the task in a complex environment.
期刊介绍:
The aim of the journal is to provide an international forum for the dissemination of up-to-date information in the fields of the mathematics and computers, in particular (but not exclusively) as they apply to the dynamics of systems, their simulation and scientific computation in general. Published material ranges from short, concise research papers to more general tutorial articles.
Mathematics and Computers in Simulation, published monthly, is the official organ of IMACS, the International Association for Mathematics and Computers in Simulation (Formerly AICA). This Association, founded in 1955 and legally incorporated in 1956 is a member of FIACC (the Five International Associations Coordinating Committee), together with IFIP, IFAV, IFORS and IMEKO.
Topics covered by the journal include mathematical tools in:
•The foundations of systems modelling
•Numerical analysis and the development of algorithms for simulation
They also include considerations about computer hardware for simulation and about special software and compilers.
The journal also publishes articles concerned with specific applications of modelling and simulation in science and engineering, with relevant applied mathematics, the general philosophy of systems simulation, and their impact on disciplinary and interdisciplinary research.
The journal includes a Book Review section -- and a "News on IMACS" section that contains a Calendar of future Conferences/Events and other information about the Association.