A Recurrent Neural Network Based Bicriteria Repetitive Motion Collision Avoidance Scheme for Motion Planning of Dual Redundant Manipulators

To achieve low joint-angle drift and avoid mutual collision between dual redundant manipulators (DRMs) when they are doing collaboration works, a recurrent neural network based bicriteria repetitive motion collision avoidance (BRMCA) scheme is proposed for motion planning of DRMs. By designing a combined optimization objective encompassing both repetitive motion criterion and collision avoidance criterion, the BRMCA scheme has larger feasible region and less constraint contradiction issues compared with traditional inequality constraints based method. Furthermore, by incorporating velocity-level kinematic model and physical limits of DRMs into the scheme, a time varying quadratic programming (TVQP) problem is formulated. The linear variational inequality-based primal-dual neural network (LVI-PDNN) is used to solve the proposed scheme due to the high accuracy and low computation complexity. Finally, through comparison simulations of tracking Circle-shape and C-shape trajectories between BRMCA scheme and minimum velocity norm (MVN) scheme, it exhibits that the proposed BRMCA scheme can achieve low joint-angle drift, collision avoidance and high tracking accuracy when DRMs are doing cooperative tasks.

Authors

Institutions

Publication Details

Published
2025-02-06
DOI
https://doi.org/10.1109/icicip64458.2025.10898120
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Recurrent Neural Network Based Bicriteria Repetitive Motion Collision Avoidance Scheme for Motion Planning of Dual Redundant Manipulators

Shirui Chen, Huanli Gao, Shaolin Hu, Zhijun Zhang
Robotic Path Planning Algorithms
article

A Recurrent Neural Network Based Bicriteria Repetitive Motion Collision Avoidance Scheme for Motion Planning of Dual Redundant Manipulators

Shirui Chen, Huanli Gao, Shaolin Hu, Zhijun Zhang
article en

Abstract

To achieve low joint-angle drift and avoid mutual collision between dual redundant manipulators (DRMs) when they are doing collaboration works, a recurrent neural network based bicriteria repetitive motion collision avoidance (BRMCA) scheme is proposed for motion planning of DRMs. By designing a combined optimization objective encompassing both repetitive motion criterion and collision avoidance criterion, the BRMCA scheme has larger feasible region and less constraint contradiction issues compared with traditional inequality constraints based method. Furthermore, by incorporating velocity-level kinematic model and physical limits of DRMs into the scheme, a time varying quadratic programming (TVQP) problem is formulated. The linear variational inequality-based primal-dual neural network (LVI-PDNN) is used to solve the proposed scheme due to the high accuracy and low computation complexity. Finally, through comparison simulations of tracking Circle-shape and C-shape trajectories between BRMCA scheme and minimum velocity norm (MVN) scheme, it exhibits that the proposed BRMCA scheme can achieve low joint-angle drift, collision avoidance and high tracking accuracy when DRMs are doing cooperative tasks.

Guangdong University of Petrochemical Technology (CN), South China University of Technology (CN)
Guangdong University of Petrochemical Technology, Ministry of Education, Nanchang University, South China University of Technology, Jishou University, Research and Development
Climate action
Openalex Percentile: Top 97%
Robotic Path Planning Algorithms
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.