An Efficient Constrained Shortest Path Algorithm for Traffic Navigation

Abstract:

Article Preview

FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of the key techniques of a traffic navigation system. Since classical Dijkstra algorithm and heuristic A* algorithm cannot support some constrained conditions in practice, and existing algorithms supporting constraints require the road network to be modified ahead and have low efficiency. The paper studies the model of road network, and analyzes two types of constraints, one-way street and intersection turning prohibitions, then proposes the constrained A* algorithm and gives the Heuristic function. Finally, the paper tests and analyzes the algorithm, and evaluation performance of the prototype system which employs it. The result shows that the algorithm’s efficiency is fairly good.

Info:

Periodical:

Advanced Materials Research (Volumes 356-360)

Edited by:

Hexing Li, Qunjie Xu and Daquan Zhang

Pages:

2880-2885

DOI:

10.4028/www.scientific.net/AMR.356-360.2880

Citation:

Z. H. Wang et al., "An Efficient Constrained Shortest Path Algorithm for Traffic Navigation", Advanced Materials Research, Vols. 356-360, pp. 2880-2885, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.