Universal Path Planning for Autonomous Vehicles Considering Real-Time and Obstacle-Avoidance Performance

Effectively handling various scenarios with autonomous vehicles involves the problem of planning paths. Starting from the practical application, we propose a universal path planning method, which can respond to the dynamic traffic environment in a timely manner. The method achieves long-term driving behavioral objectives through the construction of a linear optimization framework that combines a reactive obstacle avoidance strategy and spatial discretization techniques. As for the obstacle avoidance strategy, we introduce the exogenous parameter “time” to realize the consideration of bistatic (static and dynamic) obstacles, while the spatial discretization of path solving is realized by determining the optimal end position through constructing a dynamic objective function. The feasibility and validity of the proposed planning method are verified by simulation experiments.

Authors

Institutions

Publication Details

Published
2024-12-11
DOI
https://doi.org/10.1061/9780784485484.052
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Universal Path Planning for Autonomous Vehicles Considering Real-Time and Obstacle-Avoidance Performance

Chong Wei, Ying Wang, Shurong Li, Dan Zhao
Robotic Path Planning Algorithms
article

Universal Path Planning for Autonomous Vehicles Considering Real-Time and Obstacle-Avoidance Performance

Chong Wei, Ying Wang, Shurong Li, Dan Zhao
article en

Abstract

Effectively handling various scenarios with autonomous vehicles involves the problem of planning paths. Starting from the practical application, we propose a universal path planning method, which can respond to the dynamic traffic environment in a timely manner. The method achieves long-term driving behavioral objectives through the construction of a linear optimization framework that combines a reactive obstacle avoidance strategy and spatial discretization techniques. As for the obstacle avoidance strategy, we introduce the exogenous parameter “time” to realize the consideration of bistatic (static and dynamic) obstacles, while the spatial discretization of path solving is realized by determining the optimal end position through constructing a dynamic objective function. The feasibility and validity of the proposed planning method are verified by simulation experiments.

Beijing Jiaotong University (CN), China People's Public Security University (CN)
Climate action
Openalex Percentile: Top 77%
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.

Universal Path Planning for Autonomous Vehicles Considering Real-Time and Obstacle-Avoidance Performance — Chong Wei, Ying Wang, et al. · (2024) | TGRS Research Map | TGRS