Research for Bidirectional Path Planning Based on An Improved A∗ Algorithm

CORC > 沈阳自动化研究所 > 中国科学院沈阳自动化研究所 > 智能检测与装备研究室

	Research for Bidirectional Path Planning Based on An Improved A∗ Algorithm
	Liu SW(刘生伟)1,2,3; Ma Y(马钺)2,3
	2020
会议日期	August 25-27, 2020
会议地点	Dalian, China
关键词	big grid map A* algorithm path planning bidirectional research
页码	1036-1039
英文摘要	The paths obtained by conventional A∗ algorithm are usually not the optimal solutions, which have many turning nodes and spend more time. To solve these problems, an improved A∗ algorithm is presented. First, the proposed algorithm introduced Chebyshev distance into the formula and parent heuristic function; secondly, using a method of bidirectional search paths with dynamic rectangle. The simulation results show that time is reduced by 85.9% and 58.4% comparing with traditional A∗ algorithm and the other improved A∗ algorithm. It has been demonstrated that the proposed improved A∗ algorithm can efficiently solve the shortest path planning problem especially on large grid maps.
产权排序	1
会议录	Proceedings of 2020 IEEE International Conference on Advances in Electrical Engineering and Computer Applications, AEECA 2020
会议录出版者	IEEE
会议录出版地	New York
语种	英语
ISBN号	978-1-7281-6520-2
内容类型	会议论文
源URL	[http://ir.sia.cn/handle/173321/27839]
专题	沈阳自动化研究所_智能检测与装备研究室
通讯作者	Liu SW(刘生伟)
作者单位	1.University of Chinese Academy of Sciences, Beijing, China 2.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang, China 3.Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, China
推荐引用方式 GB/T 7714	Liu SW,Ma Y. Research for Bidirectional Path Planning Based on An Improved A∗ Algorithm[C]. 见:. Dalian, China. August 25-27, 2020.