Improvement A Algorithm Based on Dynamic Consistency Assumption
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. D...
        Saved in:
      
    
          | Published in | Advanced Transportation Vol. 97-98; p. 1 | 
|---|---|
| Main Authors | , , | 
| Format | Book Chapter Journal Article | 
| Language | English | 
| Published | 
        Zurich
          Trans Tech Publications
    
        01.01.2011
     Trans Tech Publications Ltd  | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783037852446 3037852445  | 
| ISSN | 1660-9336 1662-7482 1662-7482  | 
| DOI | 10.4028/www.scientific.net/AMM.97-98.883 | 
Cover
                Table of Contents: 
            
                  - 167.1 Introduction 167.2 Definitions and Notation 167.3 Description of DA* Algorithm 167.4 Proof of DA* Algorithm 167.5 Conclusions Acknowledgements References