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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Asymptotically Time-Optimal Smooth Trajectory Planning in Dynamic Environments

Tao Meng, Hang Zhou, Shujian Sun
1 citations
Robotic Path Planning Algorithms
0.25
article

Asymptotically Time-Optimal Smooth Trajectory Planning in Dynamic Environments

Tao Meng, Hang Zhou, Shujian Sun
article en
1 citations

Abstract

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.

Zhejiang University (CN), Nanjing University of Aeronautics and Astronautics (CN)
Sustainable cities and communities
Openalex Percentile: Top 42%
Robotic Path Planning Algorithms
0.25
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.