摘要
对路径规划中的最优路径选择算法进行了研究。目前广泛采用的A*最优路径规划算法,在实际的执行过程中容易陷入"死循环",并且其找到的路径并非最优路径。为了提高最优路径规划的准确度和寻优速度,在分析了基本的A*算法的基础上,提出了一种双向A*递归算法,主要通过加入搜索方向因子,充分利用硬件资源和并行编程技术,克服原有A*算法的缺点。最后通过实验和对比证明,双向A*递归算法充分利用双核CPU并行工作的优势,结合并行算法设计,并改进了估价函数模型,大幅提高了算法的性能和运行效率,特别是在大规模路径图搜索的情况下,体现了它的实用性。
Study on the path planning for optimal path selection algorithm.In the actual implementation process,the widely used A＊ algorithm for optimal path planning is easy to fall into the ＂dead loop＂,and it is found that path is not the optimal path.In order to improve the accuracy and speed,based on the analysis of the basic A＊ algorithm,the paper put forward a bi-directional A＊ recursive algorithm,which makes good use of adding factor of search direction and makes full use of hardware resources and parallel programming technology to overcome the shortcomings of the original a＊ algorithm.Finally,experiments and comparison show that two-way recursive algorithm A＊ make good use of the advantages of dual-core CPU working in parallel,combined with the parallel algorithm design,and improves valuation function model,The algorithm significantly improve the performance and efficiency,especially in large-scale road map search.
出处
《计算机仿真》
CSCD
北大核心
2012年第10期341-343,共3页
Computer Simulation
关键词
路径规划
启发式算法
状态空间
Path planning
Heuristic algorithm
State space
作者简介
张本群（1975-），女（汉族），贵州省兴义人，讲师，主要研究领域为算法分析。
