Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System
Based on the Dijkstra algorithm, with the parking parameters in the static state, the shortest route to each parking space of the parking lot without dynamic influence factors can be calculated. In the new technology background of the combination of the V2X environment and driverless technology, the...
Main Authors: | Luyang Yu, Haobin Jiang, Lei Hua |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-11-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/9/23/5016 |
Similar Items
-
Parking Space Recognition Method Based on Parking Space Feature Construction in the Scene of Autonomous Valet Parking
by: Shidian Ma, et al.
Published: (2021-03-01) -
Limited Visibility Aware Motion Planning for Autonomous Valet Parking Using Reachable Set Estimation
by: Seongjin Lee, et al.
Published: (2021-02-01) -
SIMULATION OF MUNICIPAL SOLID WASTE ROUTE OPTIMIZATION BY DIJKSTRA'S ALGORITHM
by: Megawati, O, et al.
Published: (2017) -
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
by: Tri Setya Dermawan
Published: (2019-01-01) -
AIS Based Shipping Routes Using the Dijkstra Algorithm
by: Pedro Silveira, et al.
Published: (2019-09-01)