An Improved Spider-Wasp Optimizer for Obstacle Avoidance Path Planning in Mobile Robots

Yujie Gao, Zhichun Li, Haorui Wang, Yupeng Hu, Haoze Jiang, Xintong Jiang and Dong Chen ()
Additional contact information
Yujie Gao: College of Automation and Electrical Engineering, Nanjing Tech University, Nanjing 210000, China
Zhichun Li: Department of Health Technology and Informatics, The Hong Kong Polytechnic University, Hong Kong, China
Haorui Wang: College of Computer and Information Engineering, Nanjing Tech University, Nanjing 210000, China
Yupeng Hu: NUIST Reading Academy, Nanjing University of Information Science and Technology, Nanjing 210000, China
Haoze Jiang: College of Automation and Electrical Engineering, Nanjing Tech University, Nanjing 210000, China
Xintong Jiang: College of Material and Chemical Engineering, Zhengzhou University of Light Industry, Zhengzhou 450000, China
Dong Chen: College of Computer and Information Engineering, Nanjing Tech University, Nanjing 210000, China

Mathematics, 2024, vol. 12, issue 17, 1-25

Abstract: The widespread application of mobile robots holds significant importance for advancing social intelligence. However, as the complexity of the environment increases, existing Obstacle Avoidance Path Planning (OAPP) methods tend to fall into local optimal paths, compromising reliability and practicality. Therefore, based on the Spider-Wasp Optimizer (SWO), this paper proposes an improved OAPP method called the LMBSWO to address these challenges. Firstly, the learning strategy is introduced to enhance the diversity of the algorithm population, thereby improving its global optimization performance. Secondly, the dual-median-point guidance strategy is incorporated to enhance the algorithm’s exploitation capability and increase its path searchability. Lastly, a better guidance strategy is introduced to enhance the algorithm’s ability to escape local optimal paths. Subsequently, the LMBSWO is employed for OAPP in five different map environments. The experimental results show that the LMBSWO achieves an advantage in collision-free path length, with 100% probability, across five maps of different complexity, while obtaining 80% fault tolerance across different maps, compared to nine existing novel OAPP methods with efficient performance. The LMBSWO ranks first in the trade-off between planning time and path length. With these results, the LMBSWO can be considered as a robust OAPP method with efficient solving performance, along with high robustness.

Keywords: spider-wasp optimizer; learning strategy; dual-median-point guidance strategy; better guidance strategy; path planning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/17/2604/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/17/2604/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:17:p:2604-:d:1462062

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().