Bi-directional adaptive enhanced A* algorithm for mobile robot navigation

被引:1
|
作者
Gharbi, Atef [1 ]
机构
[1] Northern Border Univ, Fac Comp & Informat Technol, Dept Informat Syst, Rafha, Saudi Arabia
关键词
Mobile robot; Path planning; A* algorithm; Bi-directional adaptive enhanced A* algorithm (BAEA*);
D O I
10.1108/ACI-12-2023-0195
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
PurposeThe present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.Design/methodology/approachThe paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.FindingsThe paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.Research limitations/implicationsThe rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.Originality/valueThe originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.
引用
收藏
页数:16
相关论文
共 50 条
  • [31] A tennis serve and upswing learning robot based on bi-directional theory
    Miyamoto, H
    Kawato, M
    NEURAL NETWORKS, 1998, 11 (7-8) : 1331 - 1344
  • [32] A tennis serve and upswing learning robot based on bi-directional theory
    Miyamoto, Hiroyuki
    Kawato, Mitsuo
    Neural Networks, 11 (7-8): : 1331 - 1344
  • [33] Enhanced Bi-directional Motion Estimation for Video Frame Interpolation
    Jin, Xin
    Wu, Longhai
    Shen, Guotao
    Chen, Youxin
    Chen, Jie
    Koo, Jayoon
    Hahm, Cheul-Hee
    2023 IEEE/CVF WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV), 2023, : 5038 - 5046
  • [34] TCP With Network Coding Enhanced in Bi-Directional Loss Tolerance
    Nguyen Viet Ha
    Nguyen, Tran T. T.
    Tsuru, Masato
    IEEE COMMUNICATIONS LETTERS, 2020, 24 (03) : 520 - 524
  • [35] Bi-Directional Algorithm for Computing Discrete Spectral Amplitudes in the NFT
    Hari, Siddarth
    Kschischang, Frank R.
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2016, 34 (15) : 3529 - 3537
  • [36] A Rapid Algorithm Prototyping Tool for Bi-Directional Neural Interfaces
    Isaacson, Benjamin
    Dani, Siddharth
    Desai, Sharanya Arcot
    Denison, Tim
    Afshar, Pedram
    2013 6TH INTERNATIONAL IEEE/EMBS CONFERENCE ON NEURAL ENGINEERING (NER), 2013, : 633 - 636
  • [37] Bi-directional prediction scaling-free CORDIC algorithm
    Zou, Jiaxuan
    Jie, Can
    Wang, Dong
    Yan, Chengrong
    Cheng, Xuefeng
    Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2021, 53 (02): : 47 - 52
  • [38] Global bi-directional motion compensation frame interpolation algorithm
    Suqin He
    Cangju Xing
    Puming Zhao
    Multimedia Tools and Applications, 2011, 52 : 19 - 31
  • [39] A BI-DIRECTIONAL REFINEMENT ALGORITHM FOR THE CALCULUS OF (CO)INDUCTIVE CONSTRUCTIONS
    Asperti, Andrea
    Ricciotti, Wilmer
    Coen, Claudio Sacerdoti
    Tassi, Enrico
    LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (01)
  • [40] Global bi-directional motion compensation frame interpolation algorithm
    He, Suqin
    Xing, Cangju
    Zhao, Puming
    MULTIMEDIA TOOLS AND APPLICATIONS, 2011, 52 (01) : 19 - 31