Path Planning Optimization for Industrial Robots using an Adaptive Improved Differential Evolution Algorithm
Abstract
Industrial robot path planning faces mechanical stress accumulation and motion instability caused by velocity step in complex scenarios. In this study, an adaptive optimization model is proposed, integrating the improved differential evolutionary algorithm and asymmetric S-type velocity planning. This model achieves global-local cooperative optimization through dynamic parameter coupling and velocity field feedback mechanism. Moreover, this study constructed a 10m×6m dynamic simulation environment (including 12 static/dynamic obstacles) based on the Gazebo platform, and set parameters such as the maximum linear velocity of the robot as 2m/s and the safety distance as 0.3m. The performance of the model was also compared with traditional benchmark methods (ant colony optimization algorithm, etc.) and most advanced methods (improved dynamic window algorithm, etc.). Simulation experiments showed that the average path error of the model was reduced by 76.3%, the number of convergence iterations was reduced by 33.3%, and the AUC value was improved by 9.6%. The model's dynamic obstacle scenario planning efficiency in real-world environments was improved by 23.5%, the motion stability index was improved by 7.2%, and the trajectory tracking energy consumption was reduced by 34.7%. In summary, the adaptive population initialization strategy of IDE and the segmented plus acceleration constraints of IASCV achieve a smooth transition of the velocity profile through the dynamic replanning mechanism in the overspeed region, breaking the limitation of the decoupling of the existing trajectory optimization and dynamics constraints. In conclusion, the research model reaches the advanced level in terms of convergence speed, environmental adaptability and industrial energy efficiency, providing a highly robust solution for complex industrial scenarios.DOI:
https://doi.org/10.31449/inf.v49i24.8515Downloads
Published
How to Cite
Issue
Section
License
I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.
I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.
In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.
I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal. The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.
Copyright © Slovenian Society Informatika







