Motion Optimization of a Six-Degree-of-Freedom Robotic Arm Based on Denavit-Hartenberg Parameter Method and NSGA-II

This paper presents an optimization approach for the motion of a six-degree-of-freedom robotic arm based on the Denavit-Hartenberg (D-H) parameter method and NSGA-II. The forward kinematic model of the robotic arm is established using the D-H parameter method, and the minimization of end-effector error is formulated as a nonlinear optimization problem. An adaptive gradient descent algorithm is employed, integrating momentum terms and adaptive learning rates to enhance convergence speed and stability. The algorithm incorporates multiple random initialization strategies to avoid local optima. The optimized joint configurations result in precise end-effector positioning, with a minimal end-effector error of 2.1819 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">–5</sup> mm. Furthermore, an energy minimization objective is introduced, leading to the development of a multi-objective optimization model. This model accounts for the kinetic and potential energy changes resulting from joint rotations, integrating energy consumption into the optimization framework. The NSGA-II algorithm is utilized for solving the multi-objective optimization problem, incorporating adaptive crossover and mutation operations to improve search efficiency. The results demonstrate a trade-off relationship between end-effector error and energy consumption.

Authors

Institutions

Publication Details

Published
2024-12-29
DOI
https://doi.org/10.1109/iceace63551.2024.10898211
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Motion Optimization of a Six-Degree-of-Freedom Robotic Arm Based on Denavit-Hartenberg Parameter Method and NSGA-II

Ziyang Jin, Zichong Wang
Robotic Mechanisms and Dynamics
article

Motion Optimization of a Six-Degree-of-Freedom Robotic Arm Based on Denavit-Hartenberg Parameter Method and NSGA-II

Ziyang Jin, Zichong Wang
article en

Abstract

This paper presents an optimization approach for the motion of a six-degree-of-freedom robotic arm based on the Denavit-Hartenberg (D-H) parameter method and NSGA-II. The forward kinematic model of the robotic arm is established using the D-H parameter method, and the minimization of end-effector error is formulated as a nonlinear optimization problem. An adaptive gradient descent algorithm is employed, integrating momentum terms and adaptive learning rates to enhance convergence speed and stability. The algorithm incorporates multiple random initialization strategies to avoid local optima. The optimized joint configurations result in precise end-effector positioning, with a minimal end-effector error of 2.1819 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">–5</sup> mm. Furthermore, an energy minimization objective is introduced, leading to the development of a multi-objective optimization model. This model accounts for the kinetic and potential energy changes resulting from joint rotations, integrating energy consumption into the optimization framework. The NSGA-II algorithm is utilized for solving the multi-objective optimization problem, incorporating adaptive crossover and mutation operations to improve search efficiency. The results demonstrate a trade-off relationship between end-effector error and energy consumption.

China Agricultural University (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 65%
Robotic Mechanisms and Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.