Share Email Print

Proceedings Paper

The implementation of the shortest path algorithm with turn restriction traffic rule
Author(s): Yuejun Luo; Lin Li; Li Zheng
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Label algorithm is the center part in most of the shortest path algorithms, in which there are Label Setting and Label Correcting. Topological network consisting of nodes and arcs is used in Label Setting and Label Correcting algorithms. Open frame and Close frame are built in the course of searching. Then the node whose cost is the minimum will be put into Close frame. If the cost of the node is not the minimum while searching, it is saved into Open frame. The searching will be finished until all the object nodes are all saved into Close frame. However, the searching method is not fully applied to the traffic rule which is limited in turn restriction. Even if the rule which is prohibited passing between arc and arc is established in the topological network and the rule is kept during searching, the shortest path like P-Turn and Michigan-Turn can't be searched out. To search out the shortest path with turn restriction traffic rule, it is put forward a new searching method in which a Turn_open frame on the basis of using the Open frame and Close frame is built in the paper. Owning to making use of these three frames interactively, the shortest path which is proper to the traffic rule will be searched out successfully.

Paper Details

Date Published: 2 December 2005
PDF: 8 pages
Proc. SPIE 6045, MIPPR 2005: Geospatial Information, Data Mining, and Applications, 60452Y (2 December 2005); doi: 10.1117/12.651838
Show Author Affiliations
Yuejun Luo, Wuhan Univ. (China)
Lin Li, Wuhan Univ. (China)
Li Zheng, Wuhan Univ. (China)

Published in SPIE Proceedings Vol. 6045:
MIPPR 2005: Geospatial Information, Data Mining, and Applications
Jianya Gong; Qing Zhu; Yaolin Liu; Shuliang Wang, Editor(s)

© SPIE. Terms of Use
Back to Top