A Planning Framework for Complex Flipping Manipulation of Multiple Mobile Manipulators

During complex object manipulation, manipulator systems often face the configuration disconnectivity problem due to closed-chain constraints. Although regrasping can be adopted to guarantee connectivity, it introduces additional issues such as impact and efficiency. Therefore, regrasping numbers should be minimized during manipulation. To address this problem, a novel planning framework is proposed for multiple mobile manipulator systems. Given the object trajectory and the grasping pose set, the planning framework includes three steps. First, the inverse kinematic solution is verified along the given trajectory based on different grasping poses. Coverable trajectory segments are determined for each robot for a specific grasping pose. Second, the trajectory choice problem is formulated into a set cover problem, by which we can quickly determine whether the manipulation can be completed without regrasping or with a minimal regrasping number. Finally, the motions of each mobile manipulator are planned with the assigned trajectory segments using existing methods. Both simulations and experimental results show the performance of the planner in complex flipping manipulation. Additionally, theoretical analysis and multiple simulations are conducted to demonstrate the performance of the planner.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-04-03
DOI
https://doi.org/10.1109/lra.2025.3557749
Citations
4
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
5.10
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Planning Framework for Complex Flipping Manipulation of Multiple Mobile Manipulators

Zhenhua Xiong, Meng Ren, Michael Yu Wang, Wenhang Liu et al.
4 citations
IEEE Robotics and Automation Letters
Robotic Path Planning Algorithms
5.10
article

A Planning Framework for Complex Flipping Manipulation of Multiple Mobile Manipulators

Zhenhua Xiong, Meng Ren, Michael Yu Wang, Wenhang Liu, Kun Song
article en
4 citations

Abstract

During complex object manipulation, manipulator systems often face the configuration disconnectivity problem due to closed-chain constraints. Although regrasping can be adopted to guarantee connectivity, it introduces additional issues such as impact and efficiency. Therefore, regrasping numbers should be minimized during manipulation. To address this problem, a novel planning framework is proposed for multiple mobile manipulator systems. Given the object trajectory and the grasping pose set, the planning framework includes three steps. First, the inverse kinematic solution is verified along the given trajectory based on different grasping poses. Coverable trajectory segments are determined for each robot for a specific grasping pose. Second, the trajectory choice problem is formulated into a set cover problem, by which we can quickly determine whether the manipulation can be completed without regrasping or with a minimal regrasping number. Finally, the motions of each mobile manipulator are planned with the assigned trajectory segments using existing methods. Both simulations and experimental results show the performance of the planner in complex flipping manipulation. Additionally, theoretical analysis and multiple simulations are conducted to demonstrate the performance of the planner.

IEEE Robotics and Automation LettersVol. 10(5)
Shanghai Jiao Tong University (CN), Great Bay University
Openalex Percentile: Top 5%
Robotic Path Planning Algorithms
5.10
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.