###
:2019,28(5):95-101
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于A*的双向预处理改进搜索算法
(1.安徽工业大学 计算机科学与技术学院, 马鞍山 243032;2.滁州职业技术学院 信息工程系, 滁州 239000)
Improved Search Algorithm Based on A* for Bidirectional Preprocessing
(1.School of Computer Science and Technology, Anhui University of Technology, Ma'anshan 243032, China;2.Department of Information Engineering, Chuzhou Vocational and Technical College, Chuzhou 239000, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 256次   下载 118
投稿时间:2018-11-27    修订日期:2018-12-18
中文摘要: 本文针对传统A*算法存在冗余路径点较多与单向搜索耗时较长的缺点,提出了一种改进A*算法.该算法采用双向预处理结构减少冗余节点数,并通过归一化处理和增加节点标记信息进一步优化估价函数提高遍历速度.利用仿真软件对改进A*算法进行实验,并与其它经典路径规划算法进行比较.仿真结果表明,改进后的A*算法较于传统A*算法能以较低的搜索节点数和搜索时长较好的完成全局路径规划.
Abstract:In this study, an improved A* algorithm is proposed for the traditional A-star algorithm, which has many redundant path points and long-term one-way search. The proposed algorithm uses a bidirectional preprocessing structure to reduce the number of redundant nodes, and further optimizes the evaluation function to improve the traversal speed by normalizing the processing and adding node marker information. Simulation software is used to simulate the improved A* algorithm and compare with other classical path planning algorithms. The simulation results show that the improved A* algorithm can complete the global path planning with lower search node number and search duration than the traditional A* algorithm.
文章编号:     中图分类号:    文献标志码:
基金项目:安徽省教育厅课题(KJ2017ZD05);安徽省自然科学基金青年项目(1808085QF210)
引用文本:
秦锋,吴健,张学锋,赵晶丽.基于A*的双向预处理改进搜索算法.计算机系统应用,2019,28(5):95-101
QIN Feng,WU Jian,ZHANG Xue-Feng,ZHAO Jing-Li.Improved Search Algorithm Based on A* for Bidirectional Preprocessing.COMPUTER SYSTEMS APPLICATIONS,2019,28(5):95-101

用微信扫一扫

用微信扫一扫