Implementation of a Linear-Time Shortest Path Algorithm on the Euclidean Plane with Obstacles
碩士 === 國立臺灣海洋大學 === 電機工程學系 === 103 === In the Euclidean planes with obstacles, the shortest path problem is to find an optimal path between the source and the destination. There are three different approaches to solve this problem, namely, roadmaps, cell decomposition, and potential field. Of the ro...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/usrtsn |