A study of the shortest-path problem in the finite space
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 94 === The problems of finding the shortest path without touching any obstacle have been studied intensive The different point of this study is that some objects inside the space and treated as targets The essence of this research is to find the shortest path conne...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/jw38x5 |
| Summary: | 碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 94 === The problems of finding the shortest path without touching any obstacle have been studied intensive The different point of this study is that some objects inside the space and treated as targets The essence of this research is to find the shortest path conneting all the targets without touching the obstacles .It is to find the shortest Hamiltonian path problem,which is known as a NP-complete problem An approximate algorithm is developed A simulation is given to show that computational complexity of this algorithm is linear
|
|---|