A* Algorithm Improved for the Path Planning of Unknown Environment

碩士 === 國立高雄第一科技大學 === 系統資訊與控制研究所 === 101 === In an unknown environment, path planning is an important role for robots to efficiently search a target. However, no map path planning in an unknown environment is hard for the shortest path. It motivates to find the shortest path in searching the exten...

Full description

Bibliographic Details
Main Authors: Pi-Ching Chang, 張弼青
Other Authors: Kuo-Yang Tu
Format: Others
Language:zh-TW
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/42344872176477813717
id ndltd-TW-101NKIT5392020
record_format oai_dc
spelling ndltd-TW-101NKIT53920202017-04-16T04:34:31Z http://ndltd.ncl.edu.tw/handle/42344872176477813717 A* Algorithm Improved for the Path Planning of Unknown Environment A*演算法改良用於未知環境路徑規劃 Pi-Ching Chang 張弼青 碩士 國立高雄第一科技大學 系統資訊與控制研究所 101 In an unknown environment, path planning is an important role for robots to efficiently search a target. However, no map path planning in an unknown environment is hard for the shortest path. It motivates to find the shortest path in searching the extended area. In this thesis, the idea of extended searching area is applies to improving A* algorithm for the shortest path of path planning. The proposed idea reserves the original advantage of A* algorithm on the shortest path planning to make unknown environment path planning possible. Experiments demonstrate the result of the proposed path planning very close A* algorithm. Finally, three experiments showing the performance of the proposed path planning are also included. Kuo-Yang Tu 杜國洋 2013 學位論文 ; thesis 54 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立高雄第一科技大學 === 系統資訊與控制研究所 === 101 === In an unknown environment, path planning is an important role for robots to efficiently search a target. However, no map path planning in an unknown environment is hard for the shortest path. It motivates to find the shortest path in searching the extended area. In this thesis, the idea of extended searching area is applies to improving A* algorithm for the shortest path of path planning. The proposed idea reserves the original advantage of A* algorithm on the shortest path planning to make unknown environment path planning possible. Experiments demonstrate the result of the proposed path planning very close A* algorithm. Finally, three experiments showing the performance of the proposed path planning are also included.
author2 Kuo-Yang Tu
author_facet Kuo-Yang Tu
Pi-Ching Chang
張弼青
author Pi-Ching Chang
張弼青
spellingShingle Pi-Ching Chang
張弼青
A* Algorithm Improved for the Path Planning of Unknown Environment
author_sort Pi-Ching Chang
title A* Algorithm Improved for the Path Planning of Unknown Environment
title_short A* Algorithm Improved for the Path Planning of Unknown Environment
title_full A* Algorithm Improved for the Path Planning of Unknown Environment
title_fullStr A* Algorithm Improved for the Path Planning of Unknown Environment
title_full_unstemmed A* Algorithm Improved for the Path Planning of Unknown Environment
title_sort a* algorithm improved for the path planning of unknown environment
publishDate 2013
url http://ndltd.ncl.edu.tw/handle/42344872176477813717
work_keys_str_mv AT pichingchang aalgorithmimprovedforthepathplanningofunknownenvironment
AT zhāngbìqīng aalgorithmimprovedforthepathplanningofunknownenvironment
AT pichingchang ayǎnsuànfǎgǎiliángyòngyúwèizhīhuánjìnglùjìngguīhuà
AT zhāngbìqīng ayǎnsuànfǎgǎiliángyòngyúwèizhīhuánjìnglùjìngguīhuà
_version_ 1718438209162051584