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

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29243

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29243

Title:	SOLVING FIND PATH PROBLEM IN MAPPED ENVIRONMENTS USING MODIFIED A-ASTERISK ALGORITHM
Authors:	FAN,KC;LUI,PC
Contributors:	資訊工程研究所
Date:	1994
Issue Date:	2010-06-29 20:17:20 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	517	View/Open

社群 sharing