Author
Listed:
- Xinlu Zong
(School of Computer Science, Hubei University of Technology, Wuhan, Hubei 430068, P. R. China)
- Yin Liu
(School of Computer Science, Hubei University of Technology, Wuhan, Hubei 430068, P. R. China)
- Zhiwei Ye
(School of Computer Science, Hubei University of Technology, Wuhan, Hubei 430068, P. R. China)
- Xue Xia
(School of Computer Science, Hubei University of Technology, Wuhan, Hubei 430068, P. R. China)
Abstract
Efficient and safe path planning for autonomous navigation is paramount in advancing the motion control capabilities of mobile robots. To obtain the global optimal smooth path for mobile robots, a multi-strategy ensemble Harris hawks optimization algorithm (SDHHO) is proposed in this paper. The spiral search strategy is adopted to improve the early update method of the algorithm, which can improve the global exploration ability. To achieve better balance between global exploration and local exploitation, the Sine chaotic map is introduced to the escape energy, replacing random components. Furthermore, an elite differential mutation strategy combined with Gaussian mutation is designed to prevent the algorithm from falling into local optima. We compared the SDHHO algorithm with other classical and novel algorithms on 23 benchmark functions, and the results demonstrated the superiority of SDHHO. The proposed algorithm is applied to the smooth path planning for mobile robots, which is transformed into an optimization problem of control nodes of high-order Bezier curves. Empirical evaluations across diverse environments underscore the proficiency of the proposed method in generating paths characterized by reduced length and enhanced safety and continuity.
Suggested Citation
Xinlu Zong & Yin Liu & Zhiwei Ye & Xue Xia, 2024.
"Multi-strategy ensemble Harris hawks optimization for smooth path planning of mobile robots,"
International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 35(07), pages 1-31, July.
Handle:
RePEc:wsi:ijmpcx:v:35:y:2024:i:07:n:s0129183124500839
DOI: 10.1142/S0129183124500839
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:35:y:2024:i:07:n:s0129183124500839. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.