2022
DOI: 10.3390/app122311982
|View full text |Cite
|
Sign up to set email alerts
|

An RRT-Dijkstra-Based Path Planning Strategy for Autonomous Vehicles

Abstract: It is challenging to plan paths for autonomous vehicles on half-structured roads because of the vast planning area and complex environmental constraints. This work aims to plan optimized paths with high accuracy and efficiency. A two-step path planning strategy is proposed. The classic planning problem is divided into two simpler planning problems: reduction problems for a vast planning area and solving problems for weighted directed graphs. The original planning area is first reduced using an RRT (Rapidly Exp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…These rules are used to determine the driving behavior of autonomous vehicles based on different environmental cues [ 13 ]. After receiving driving decision commands, Chen et al employed a Dijkstra-based method to plan feasible driving trajectories [ 14 ]. Yu et al [ 15 ] considered constraints from surrounding vehicles during lane-changing maneuvers and utilized a third-degree polynomial to plan intelligent vehicle lane-change trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…These rules are used to determine the driving behavior of autonomous vehicles based on different environmental cues [ 13 ]. After receiving driving decision commands, Chen et al employed a Dijkstra-based method to plan feasible driving trajectories [ 14 ]. Yu et al [ 15 ] considered constraints from surrounding vehicles during lane-changing maneuvers and utilized a third-degree polynomial to plan intelligent vehicle lane-change trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…Local path planning algorithms include the artificial potential field algorithm (APF) [15], DWA [16], and deep learning method (DL) [17]. Dijkstra [18] uses a breadth-first search, which has the advantages of simple principles and a small amount of computation, but the computational efficiency is low. RRT [19] is a sampling-based algorithm with probabilistic integrity, but the algorithm search is blind, and the convergence speed is slow.…”
Section: Related Workmentioning
confidence: 99%
“…Path-planning algorithms for UGVs can be mainly divided into traditional classical algorithms [8,9] and learning-based methods [10][11][12]. Traditional classic algorithms generally obtain the optimized path in complex environments through a hierarchical architecture incorporating a global planner and a local planner [13].…”
Section: Introductionmentioning
confidence: 99%