Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning
We propose the adaptive t-distribution spiral search Dung Beetle Optimization (TSDBO) Algorithm to address the limitations of the vanilla Dung Beetle Optimization Algorithm (DBO), such as vulnerability to local optima, weak convergence speed, and poor convergence accuracy. Specifically, we introduce...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/1/396 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841549334743613440 |
|---|---|
| author | Kezhen Liu Yongqiang Dai Huan Liu |
| author_facet | Kezhen Liu Yongqiang Dai Huan Liu |
| author_sort | Kezhen Liu |
| collection | DOAJ |
| description | We propose the adaptive t-distribution spiral search Dung Beetle Optimization (TSDBO) Algorithm to address the limitations of the vanilla Dung Beetle Optimization Algorithm (DBO), such as vulnerability to local optima, weak convergence speed, and poor convergence accuracy. Specifically, we introduced an improved Tent chaotic mapping-based population initialization method to enhance the distribution quality of the initial population in the search space. Additionally, we employed a dynamic spiral search strategy during the reproduction phase and an adaptive t-distribution perturbation strategy during the foraging phase to enhance global search efficiency and the capability of escaping local optima. Experimental results demonstrate that TSDBO exhibits significant improvements in all aspects compared to other modified algorithms across 12 benchmark tests. Furthermore, we validated the practicality and reliability of TSDBO in robotic path planning applications, where it shortened the shortest path by 5.5–7.2% on a 10 × 10 grid and by 11.9–14.6% on a 20 × 20 grid. |
| format | Article |
| id | doaj-art-3158db307ab7410f806f97375c295a79 |
| institution | Kabale University |
| issn | 2076-3417 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj-art-3158db307ab7410f806f97375c295a792025-01-10T13:15:25ZengMDPI AGApplied Sciences2076-34172025-01-0115139610.3390/app15010396Improvement of Dung Beetle Optimization Algorithm Application to Robot Path PlanningKezhen Liu0Yongqiang Dai1Huan Liu2College of Information Science and Technology, Gansu Agricultural University, Lanzhou 730070, ChinaCollege of Information Science and Technology, Gansu Agricultural University, Lanzhou 730070, ChinaCollege of Information Science and Technology, Gansu Agricultural University, Lanzhou 730070, ChinaWe propose the adaptive t-distribution spiral search Dung Beetle Optimization (TSDBO) Algorithm to address the limitations of the vanilla Dung Beetle Optimization Algorithm (DBO), such as vulnerability to local optima, weak convergence speed, and poor convergence accuracy. Specifically, we introduced an improved Tent chaotic mapping-based population initialization method to enhance the distribution quality of the initial population in the search space. Additionally, we employed a dynamic spiral search strategy during the reproduction phase and an adaptive t-distribution perturbation strategy during the foraging phase to enhance global search efficiency and the capability of escaping local optima. Experimental results demonstrate that TSDBO exhibits significant improvements in all aspects compared to other modified algorithms across 12 benchmark tests. Furthermore, we validated the practicality and reliability of TSDBO in robotic path planning applications, where it shortened the shortest path by 5.5–7.2% on a 10 × 10 grid and by 11.9–14.6% on a 20 × 20 grid.https://www.mdpi.com/2076-3417/15/1/396dung beetle optimization algorithmdynamic spiral searchadaptive t-distribution perturbationsingle-objective optimizationpath planning |
| spellingShingle | Kezhen Liu Yongqiang Dai Huan Liu Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning Applied Sciences dung beetle optimization algorithm dynamic spiral search adaptive t-distribution perturbation single-objective optimization path planning |
| title | Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning |
| title_full | Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning |
| title_fullStr | Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning |
| title_full_unstemmed | Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning |
| title_short | Improvement of Dung Beetle Optimization Algorithm Application to Robot Path Planning |
| title_sort | improvement of dung beetle optimization algorithm application to robot path planning |
| topic | dung beetle optimization algorithm dynamic spiral search adaptive t-distribution perturbation single-objective optimization path planning |
| url | https://www.mdpi.com/2076-3417/15/1/396 |
| work_keys_str_mv | AT kezhenliu improvementofdungbeetleoptimizationalgorithmapplicationtorobotpathplanning AT yongqiangdai improvementofdungbeetleoptimizationalgorithmapplicationtorobotpathplanning AT huanliu improvementofdungbeetleoptimizationalgorithmapplicationtorobotpathplanning |