SOLVING FIND PATH PROBLEM IN MAPPED ENVIRONMENTS USING MODIFIED A-ASTERISK ALGORITHM

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29243

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29243

題名:	SOLVING FIND PATH PROBLEM IN MAPPED ENVIRONMENTS USING MODIFIED A-ASTERISK ALGORITHM
作者:	FAN,KC;LUI,PC
貢獻者:	資訊工程研究所
日期:	1994
上傳時間:	2010-06-29 20:17:20 (UTC+8)
出版者:	中央大學
摘要:	In this paper, we will present a path planning algorithm to solve the find-path problem in mapped environments. The moving objects considered in this paper can be any shape, which is approximated by its bounding convex polygon. Since the actual translating and rotating movement of the object in the free space is considered in the finding of collision-free path, it won't miss those paths which require rotational maneuvering. In addition to the progressing strategy, a modified A* algorithm based on the revised depth-first search in setting up the h' value is also proposed to find the optimal path. From the experimental results, the modified A* algorithm is proved to be a very good method.
關聯:	IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS
顯示於類別:	[資訊工程研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	516	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing