Weighted Shortest Path for MRT Navigation
碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 100 === With the rapid transit route path development to be increasingly complex, path planning is also more and more important. Among path planning algorithms, Dijkstra’s algorithm is best known, yet with a disadvantage of high complexity in that, for a single rout...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/34407280276765845808 |