Robotic arm path planning based on the improved dung beetle optimization algorithm

ObjectiveA path planning algorithm based on an improved dung beetle optimization algorithm was proposed to address the challenges in complex scenarios where traditional algorithms for robotic arm path planning often suffer from low efficiency and susceptibility to local optima.MethodsFirstly, the ro...

Full description

Saved in:
Bibliographic Details
Main Authors: XUAN Yitong, LI Lijun, CHEN Haifei
Format: Article
Language:zho
Published: Editorial Office of Journal of Mechanical Transmission 2025-02-01
Series:Jixie chuandong
Subjects:
Online Access:http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2025.02.009
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:ObjectiveA path planning algorithm based on an improved dung beetle optimization algorithm was proposed to address the challenges in complex scenarios where traditional algorithms for robotic arm path planning often suffer from low efficiency and susceptibility to local optima.MethodsFirstly, the robotic arm and obstacles were modeled using the bounding box method. An optimization function was established based on path length, joint motion smoothness, and collision avoidance. Secondly, the algorithm incorporated Logistic mapping for population initialization to enhance diversity and improved the heuristic mechanism to accelerate convergence. It introduced an adaptive polynomial mutation to escape local optima. Thirdly, the comparative simulations were conducted using basic dung beetle algorithm, jellyfish algorithm, grey wolf algorithm, whale algorithm, and the improved dung beetle algorithm in Matlab software. Finally, the real-world testing was conducted.ResultsThe results indicate that the proposed algorithm is less prone to getting trapped in local optima, achieves faster convergence, shorter computation time, and higher optimization accuracy when solving robotic arm path planning problems. The algorithm’s reliability is validated through the real-world testing.
ISSN:1004-2539