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...
Uloženo v:
| Vydáno v: | Advanced Transportation Ročník 97-98; s. 1 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Kapitola Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Zurich
Trans Tech Publications
01.01.2011
Trans Tech Publications Ltd |
| Témata: | |
| ISBN: | 9783037852446, 3037852445 |
| ISSN: | 1660-9336, 1662-7482, 1662-7482 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 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

