A Bi-Criteria Obstacle Avoidance Scheme Synthesized by Time-Varying Penalty Strategy Neural Network for Mobile Parallel Manipulators

In order to enable the mobile parallel manipulator to avoid obstacles and achieve repetitive motion as well as avoid velocity spikes, a bi-criteria obstacle avoidance scheme synthesized by time-varying penalty strategy (BCOA-TVPS) neural network is proposed and designed. To do so, first, the bi-criteria are composed of repetitive motion criterion and infinite norm velocity minimization criterion, and the constraints consider the vector-based obstacle avoidance constraints. Second, the bi-criteria obstacle avoidance scheme is reformulated as a constrained time-varying quadratic programming (QP) problem. Third, a time-varying penalty strategy (TVPS) neural network is adopted to solve the QP problem. Finally, two kinds of trajectory tracking experiments verify the effectiveness and applicability of the proposed BCOA-TVPS scheme.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Cybernetics
Published
2025-11-12
DOI
https://doi.org/10.1109/tcyb.2025.3625702
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

A Bi-Criteria Obstacle Avoidance Scheme Synthesized by Time-Varying Penalty Strategy Neural Network for Mobile Parallel Manipulators

Xiaohui Ren, Zhijun Zhang, Wenhao Zhang
IEEE Transactions on Cybernetics
Robotic Mechanisms and Dynamics
article

A Bi-Criteria Obstacle Avoidance Scheme Synthesized by Time-Varying Penalty Strategy Neural Network for Mobile Parallel Manipulators

Xiaohui Ren, Zhijun Zhang, Wenhao Zhang
article en

Abstract

In order to enable the mobile parallel manipulator to avoid obstacles and achieve repetitive motion as well as avoid velocity spikes, a bi-criteria obstacle avoidance scheme synthesized by time-varying penalty strategy (BCOA-TVPS) neural network is proposed and designed. To do so, first, the bi-criteria are composed of repetitive motion criterion and infinite norm velocity minimization criterion, and the constraints consider the vector-based obstacle avoidance constraints. Second, the bi-criteria obstacle avoidance scheme is reformulated as a constrained time-varying quadratic programming (QP) problem. Third, a time-varying penalty strategy (TVPS) neural network is adopted to solve the QP problem. Finally, two kinds of trajectory tracking experiments verify the effectiveness and applicability of the proposed BCOA-TVPS scheme.

IEEE Transactions on CyberneticsVol. 56(3)
Southwest University of Science and Technology (CN), South China University of Technology (CN)
Openalex Percentile: Top 57%
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.