Dynamic Path Planning Algorithm for Dual-Robot Systems Based on Minimum Manipulability Constraints

In response to the safety and reliability concerns in dynamic path planning for dual-robot systems, this paper proposes a spatiotemporal A* path planning algorithm based on minimum manipulability constraints. Firstly, the algorithm extends the child nodes of the spatiotemporal A* algorithm using spatial velocity vectors, altering the search space, and increasing the turning cost to achieve smoother path planning. Then, this paper proposes incorporating minimum manipulability constraints into the evaluation function of the spatiotemporal A* algorithm to enhance the flexibility of robots and the safety and reliability of paths. Additionally, it increases the weight coefficient of the heuristic function to improve the efficiency of the algorithm. Simulation results demonstrate that the proposed algorithm can plan smooth, safe, and reliable paths.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10840130
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

Dynamic Path Planning Algorithm for Dual-Robot Systems Based on Minimum Manipulability Constraints

Haibo Du, Yongzheng Cong, Wenwu Zhu, Wei Li et al.
Robotic Path Planning Algorithms
article

Dynamic Path Planning Algorithm for Dual-Robot Systems Based on Minimum Manipulability Constraints

Haibo Du, Yongzheng Cong, Wenwu Zhu, Wei Li, Zixiang Shen
article en

Abstract

In response to the safety and reliability concerns in dynamic path planning for dual-robot systems, this paper proposes a spatiotemporal A* path planning algorithm based on minimum manipulability constraints. Firstly, the algorithm extends the child nodes of the spatiotemporal A* algorithm using spatial velocity vectors, altering the search space, and increasing the turning cost to achieve smoother path planning. Then, this paper proposes incorporating minimum manipulability constraints into the evaluation function of the spatiotemporal A* algorithm to enhance the flexibility of robots and the safety and reliability of paths. Additionally, it increases the weight coefficient of the heuristic function to improve the efficiency of the algorithm. Simulation results demonstrate that the proposed algorithm can plan smooth, safe, and reliable paths.

Hefei University of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 74%
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.