Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model

dc.contributor.author	Htun, Nyi Nyi
dc.date.accessioned	2019-07-11T03:08:46Z
dc.date.available	2019-07-11T03:08:46Z
dc.date.issued	2013-02-26
dc.identifier.uri	http://onlineresource.ucsy.edu.mm/handle/123456789/667
dc.description.abstract	This paper presents a method based on receptor model for finding the shortest smooth path in variable size with safety margin, where clothoid curvature is used for smoothing path. The method modifies the results of grid-based A∗ algorithm and tries to push the given path away from obstacles and makes a smooth path between two specific points in 2D and 3D space. The optimized smooth path which we got in this study will be used as the main control line for designing canal surface for further study.	en_US
dc.language.iso	en	en_US
dc.publisher	Eleventh International Conference On Computer Applications (ICCA 2013)	en_US
dc.subject	Pathfinding	en_US
dc.subject	receptor geometrical models	en_US
dc.subject	А* algorithm	en_US
dc.subject	designing automation system	en_US
dc.subject	applied geometry	en_US
dc.title	Finding the shortest smooth path in variable size using improved A* algorithm on grid-based receptor model	en_US
dc.type	Article	en_US