.png){kind=icon}
返回
Topology-Driven Parallel Trajectory Optimization in Dynamic Environments
.png){kind=icon}
OA
AI
DOI：10.1109/TRO.2024.3475047.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, we propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A global planner iteratively generates trajectories in distinct homotopy classes. These trajectories are then optimized by local planners working in parallel. While each planner shares the same navigation objectives, they are locally constrained to a specific homotopy class, meaning each local planner attempts a different evasive maneuver. The robot then executes the feasible trajectory with the lowest cost in a receding horizon manner. We demonstrate on a mobile robot navigating among pedestrians that our approach leads to faster trajectories than existing planners.
Keyword:
Trajectory
Dynamics
Planning
Robots
Collision avoidance
Navigation
Vehicle dynamics
Cost function
Trajectory optimization
Topology
Collision avoidance
constrained motion planning
motion and path planning
optimization and optimal control
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏U.S. Environmental Protection Agency Radiogenic Risk Models and Projections for the U.S. Population
PREAI
分享收藏
查看更多内容