Name
Abstract | ||
|---|---|---|
Dynamic path planning can efficiently enhance the validity and reliability of real-time navigation for vehicles to avoid unexpected traffic congestions and to shorten the whole traveling time. In this paper, we present a dynamic path planning method in which the density of road links is set as the main measurement for traffic status. By analyzing the traveling time and waiting time, we propose a mechanism for vehicles to decide whether to revise the current path. Our method aims at offering a path with smallest time cost for vehicles towards the destination. Furthermore, we give the discussion on time complexity and convergence of our method. Finally, simulation is conducted to evaluate the proposed method. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-52730-7_13 | Lecture Notes of the Institute for Computer Sciences, Social Informatics, and Telecommunications Engineering |
Keywords | Field | DocType |
Path planning,Dynamic,Density-based,VANET | Motion planning,Convergence (routing),Validity,Simulation,Computer science,Real-time computing,Artificial intelligence,Time complexity,Urban area,Vehicular ad hoc network,Machine learning | Conference |
Volume | ISSN | Citations |
183 | 1867-8211 | 0 |
PageRank | References | Authors |
0.34 | 2 | 5 |