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...

Full description

Bibliographic Details
Main Authors:	J-W Ke, 柯子文
Other Authors:	黃俊平
Format:	Others
Language:	zh-TW
Published:	2006
Online Access:	http://ndltd.ncl.edu.tw/handle/jw38x5

id	ndltd-TW-094NYPI5030009
record_format	oai_dc
spelling	ndltd-TW-094NYPI50300092019-09-24T03:34:24Z http://ndltd.ncl.edu.tw/handle/jw38x5 A study of the shortest-path problem in the finite space 有限空間內最短路徑之研究 J-W Ke 柯子文碩士國立虎尾科技大學工業工程與管理研究所 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 黃俊平 2006 學位論文 ; thesis 41 zh-TW
collection	NDLTD
language	zh-TW
format	Others
sources	NDLTD
description	碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 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
author2	黃俊平
author_facet	黃俊平 J-W Ke 柯子文
author	J-W Ke 柯子文
spellingShingle	J-W Ke 柯子文 A study of the shortest-path problem in the finite space
author_sort	J-W Ke
title	A study of the shortest-path problem in the finite space
title_short	A study of the shortest-path problem in the finite space
title_full	A study of the shortest-path problem in the finite space
title_fullStr	A study of the shortest-path problem in the finite space
title_full_unstemmed	A study of the shortest-path problem in the finite space
title_sort	study of the shortest-path problem in the finite space
publishDate	2006
url	http://ndltd.ncl.edu.tw/handle/jw38x5
work_keys_str_mv	AT jwke astudyoftheshortestpathprobleminthefinitespace AT kēziwén astudyoftheshortestpathprobleminthefinitespace AT jwke yǒuxiànkōngjiānnèizuìduǎnlùjìngzhīyánjiū AT kēziwén yǒuxiànkōngjiānnèizuìduǎnlùjìngzhīyánjiū AT jwke studyoftheshortestpathprobleminthefinitespace AT kēziwén studyoftheshortestpathprobleminthefinitespace
_version_	1719256837002362880

A study of the shortest-path problem in the finite space

Similar Items