Static and dynamic path selection on expander graphs (preliminary version)

1997 ◽  
Author(s):  
Andrei Z. Broder ◽  
Alan M. Frieze ◽  
Eli Upfal
Keyword(s):  
Path Selection ◽  
Expander Graphs ◽  
Preliminary Version ◽  
Dynamic Path

scholarly journals Finite element simulations of dynamic shear rupture experiments and dynamic path selection along kinked and branched faults

2009 ◽  
Vol 114 (B8) ◽  
Author(s):  
Elizabeth L. Templeton ◽  
Aurélie Baudet ◽  
Harsha S. Bhat ◽  
Renata Dmowska ◽  
James R. Rice ◽  
...  
Keyword(s):  
Finite Element ◽  
Path Selection ◽  
Finite Element Simulations ◽  
Dynamic Shear ◽  
Shear Rupture ◽  
Dynamic Path

Research on Dynamic Path Selection Improved Dijkstra Algorithm

2014 ◽  
Vol 1006-1007 ◽  
pp. 1121-1124
Author(s):  
Xiu Li Gao ◽  
Tian Jun Hu ◽  
Jia Zheng
Keyword(s):  
Path Planning ◽  
Intelligent Transportation System ◽  
Optimal Path ◽  
Path Selection ◽  
Practical Significance ◽  
Dijkstra Algorithm ◽  
Time Dynamic ◽  
Dynamic Path ◽  
Information Dynamic ◽  
Improved Algorithm

Dynamic path selection algorithm is one of the most important researches in Intelligent Transportation System (ITS). After comparing in this article, we select Dijkstra algorithm as the optimal path algorithm. The traditional algorithm applies only to the static road network, the improved algorithm obtained optimal path planning program in the dynamic path selection. Finally, the combination of a numerical example, the improved algorithm for real-time, dynamic, effectiveness is verified through computer simulation. The accuracy of the prediction of the traffic flow plays a key role in the path planning, and the fusion forecast information dynamic path selection problem has important practical significance.

Sign in / Sign up

Export Citation Format

Share Document