Improvement A* Algorithm Based on Dynamic Consistency Assumption

Abstract:

Article Preview

Efficient dynamic shortest path algorithm in static networks plays an important role in ITS. To solve this problem, this paper brings forward the dynamic form of Consistency Assumption and Dynamic A* algorithm (A* algorithm based on dynamic lower bound, DA* algorithm) based on dynamic lower bound. DA* algorithm and the dynamic form of Consistency Assumption are described in detail. It is proved that DA* algorithm can solve one origin node to one destination node shortest paths problem in dynamic networks, if DA* algorithm’s dynamic lower bound satisfies the dynamic form of Consistency Assumption.

Info:

Periodical:

Edited by:

Shucai Li

Pages:

883-887

DOI:

10.4028/www.scientific.net/AMM.97-98.883

Citation:

L. Zou et al., "Improvement A* Algorithm Based on Dynamic Consistency Assumption", Applied Mechanics and Materials, Vols. 97-98, pp. 883-887, 2011

Online since:

September 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.