Improved Search Algorithm Based on A* for Bidirectional Preprocessing
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [19]
  • |
  • Related [20]
  • |
  • Cited by [0]
  • | |
  • Comments
    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.

    Reference
    [1] 秦昆, 关泽群, 李德仁, 等. 基于栅格数据的最佳路径分析方法研究. 国土资源遥感, 2002, 14(2):38-41.[doi:10.3969/j.issn.1001-070X.2002.02.009
    [2] Cormen TT, Leiserson CE, Rivest RL. Introduction to Algorithms. Cambridge:MIT Press, 2001
    [3] Mohajer B, Kiani K, Samiei E, et al. A new online random particles optimization algorithm for mobile robot path planning in dynamic environments. Mathematical Problems in Engineering, 2013, 2013:491346
    [4] 陆锋, 卢冬梅, 崔伟宏. 交通网络限制搜索区域时间最短路径算法. 中国图象图形学报, 1999, 4(10):849-853
    [5] Fredman ML, Tarjan RE. Fibonacci heaps and their uses in improved network optimization algorithms. Proceedings of the 25th Annual Symposium on Foundations of Computer Science. Singer Island, FL, USA. 1984.
    [6] 王士同. 双向启发式图搜索算法BFFRA. 电子学报, 1990, 18(6):34-39.[doi:10.3321/j.issn:0372-2112.1990.06.006
    [7] 郑年波, 李清权, 徐敬海, 等. 基于转向限制和延误的双向启发式最短路径算法. 武汉大学学报·信息科学版, 2006, 31(3):256-259
    [8] 熊壬浩, 刘羽. A*算法的改进及并行化. 计算机应用, 2015, 35(7):1843-1848
    [9] 熊伟, 张仁平, 刘奇韬, 等. A*算法及其在地理信息系统中的应用. 计算机系统应用, 2007, 16(4):14-17.[doi:10.3969/j.issn.1003-3254.2007.04.004
    [10] 王殿君. 基于改进A*算法的室内移动机器人路径规划. 清华大学学报(自然科学版), 2012, 52(8):1085-1089
    [11] 张宏烈. 移动机器人全局路径规划的研究[硕士学位论文]. 哈尔滨:哈尔滨工程大学, 2002.
    [12] 魏宁, 刘一松. 基于栅格模型的移动机器人全局路径规划研究. 微计算机信息, 2008, 24(11):229-231.[doi:10.3969/j.issn.1008-0570.2008.11.094
    [13] 陈华华, 杜歆, 顾伟康. 基于遗传算法的静态环境全局路径规划. 浙江大学学报(理学版), 2005, 32(1):49-53.[doi:10.3321/j.issn:1008-9497.2005.01.013
    [14] Chabini I, Lan S. Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transportation Systems, 2002, 3(1):60-74.[doi:10.1109/6979.994796
    [15] Whangbo TK. Efficient modified bidirectional A* algorithm for optimal route-finding. In:Okuno HG, Ali M, eds. New Trends in Applied Artificial Intelligence. Berlin Heidelberg:Springer, 2007:344-353
    [16] Elbeltagi E, Hegazy T, Hosny AH, et al. Schedule-dependent evolution of site layout planning. Construction Management and Economics, 2001, 19(7):689-697.[doi:10.1080/01446190110066713
    [17] Hart PE, Nilsson NJ, Raphael B. Correction to "a formal basis for the heuristic determination of minimum cost paths". ACM SIGART Bulletin, 1972, (37):28-29
    [18] Guesgen HW, Mitra D. A multiple-platform decentralized route finding system. Proceedings of the 12th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. Cairo, Egypt. 1999. 707-713.
    [19] 史辉, 曹闻, 朱述龙, 等. A*算法的改进及其在路径规划中的应用. 测绘与空间地理信息, 2009, 32(6):208-211.[doi:10.3969/j.issn.1672-5867.2009.06.070
    Comments
    Comments
    分享到微博
    Submit
Get Citation

秦锋,吴健,张学锋,赵晶丽.基于A*的双向预处理改进搜索算法.计算机系统应用,2019,28(5):95-101

Copy
Share
Article Metrics
  • Abstract:2513
  • PDF: 3014
  • HTML: 3047
  • Cited by: 0
History
  • Received:November 27,2018
  • Revised:December 18,2018
  • Online: May 05,2019
  • Published: May 15,2019
Article QR Code
You are the first990425Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063