Asymptotically Time-Optimal Smooth Trajectory Planning in Dynamic Environments
This paper proposed an algorithm for smooth trajectory generation in complex environments with dynamic obstacles and velocity constraints. The proposed two-step algorithm: Tube Space-Time Rapidly-exploring Random Trees Star (TubeSTRRT*), is combined with the improved reformulation dynamic coordinate minimum snap (RDCMS) to generate smooth, collision-free trajectories with asymptotic time optimality. First, the space-time state space is sampled to obtain time information for each node, facilitating the avoidance of moving obstacles. Then, to address the issue of non-smooth paths in TubeSTRRT*, a dynamic tube is generated for each node and combined with the RDCMS to create a smooth, collision-free trajectory. Finally, comparative simulations demonstrate the superiority of our algorithm in terms of smoothness.
Authors
- Tao Meng (ORCID: https://orcid.org/0000-0002-9787-2002)
- Hang Zhou (ORCID: https://orcid.org/0000-0001-7243-878X)
- Shujian Sun (ORCID: https://orcid.org/0000-0002-3016-4546)
Institutions
- Zhejiang University (CN)
- Nanjing University of Aeronautics and Astronautics (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/cac63892.2024.10865666
- Citations
- 1
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.25