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
- Haibo Du (ORCID: https://orcid.org/0000-0002-7866-2237)
- Yongzheng Cong (ORCID: https://orcid.org/0000-0003-1765-1734)
- Wenwu Zhu (ORCID: https://orcid.org/0000-0001-7368-7323)
- Wei Li (ORCID: https://orcid.org/0000-0002-7406-4221)
- Zixiang Shen
Institutions
- Hefei University of Technology (CN)
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
- National Natural Science Foundation of China