Redundancy-Based Motion Planning with Task Constraints for Robot Manipulators

Finding realistic motions for redundant manipulators is essential for complex jobs such as home care and industrial assembly. Motion planning is complex when a task requires standing upright or moving through restricted spaces. This work provides an effective motion-planning strategy for 7-DOF manipulators that improves connections via redundancy. The analytic Cartesian-space-to-joint-space kinematic mapping models for 7-DOF redundant manipulators with diverse configurations are constructed first, and the feasible nodes are determined by sampling the Cartesian space without barriers to satisfy the task requirements. Each Cartesian-space sampling node can provide numerous feasible joint-space nodes because of the redundancy of the robot manipulators. To remove additional valid nodes from a singular position, joint configurations with the same end-effector position orientation are modified iteratively. Finally, we find the nearest nodes in the joint-space constraint manifold and build collision-free smooth pathways. The task constraint levels were varied for a 7-DOF manipulator in simulations and experiments. The proposed planner finds more viable nodes at the same end-position attitude than one-to-one projection. It does not require numerical iterations and achieves high planning efficiency and a high motion-planning success rate.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2025-03-19
DOI
https://doi.org/10.3390/s25061900
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.55

Funders

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

Redundancy-Based Motion Planning with Task Constraints for Robot Manipulators

Yi Zhang, Hongguang Wang
2 citations
Sensors
Robotic Path Planning Algorithms
2.55
article

Redundancy-Based Motion Planning with Task Constraints for Robot Manipulators

Yi Zhang, Hongguang Wang
article en
2 citations

Abstract

Finding realistic motions for redundant manipulators is essential for complex jobs such as home care and industrial assembly. Motion planning is complex when a task requires standing upright or moving through restricted spaces. This work provides an effective motion-planning strategy for 7-DOF manipulators that improves connections via redundancy. The analytic Cartesian-space-to-joint-space kinematic mapping models for 7-DOF redundant manipulators with diverse configurations are constructed first, and the feasible nodes are determined by sampling the Cartesian space without barriers to satisfy the task requirements. Each Cartesian-space sampling node can provide numerous feasible joint-space nodes because of the redundancy of the robot manipulators. To remove additional valid nodes from a singular position, joint configurations with the same end-effector position orientation are modified iteratively. Finally, we find the nearest nodes in the joint-space constraint manifold and build collision-free smooth pathways. The task constraint levels were varied for a 7-DOF manipulator in simulations and experiments. The proposed planner finds more viable nodes at the same end-position attitude than one-to-one projection. It does not require numerical iterations and achieves high planning efficiency and a high motion-planning success rate.

SensorsVol. 25(6)
Shenyang Institute of Automation (CN), Chinese Academy of Sciences (CN), University of Chinese Academy of Sciences (CN)
National Natural Science Foundation of China
Sustainable cities and communities
Openalex Percentile: Top 12%
Robotic Path Planning Algorithms
2.55
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.