Comparative study of Bidirectional A*, D* and D* Lite for Path Planning

被引：0
作者：
Chadhurbala, R., V
Naveen, U. S. [1 ]
Nipun, B., V [1 ]
Supriya, P. [1 ]
Suyampulingam, A.
机构：
[1] Amrita Vishwa Vidyapeetham, Dept Elect & Elect Engn, Amrita Sch Engn, Coimbatore, Tamil Nadu, India
来源：
10TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTING AND COMMUNICATION TECHNOLOGIES, CONECCT 2024 | 2024年
关键词：
Bidirectional A*; D*; D* Lite; Navigation; Obstacle Avoidance; Path planning;
D O I：
10.1109/CONECCT62155.2024.10677080
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Path planning algorithms are mainly used in robotics for navigation. Search-based algorithms are well-suited for partially known environments. Autonomous robots in factories constantly move equipment from one place to another. They have to take optimal paths to reduce time and cost while avoiding obstacles by replanning the path. This paper compares three path planning algorithms, Bidirectional A*, D*, and D* Lite. This comparative study evaluates these algorithms' performance in an 8x8 grid environment in various scenarios. Various metrics, such as the number of steps in the path, computation time and efficiency, were used to compare these algorithms. The results of this evaluation will assist in decision-making when selecting a path planning algorithm for any application.
引用
收藏
页数：6
相关论文
共 12 条
  • [1] B Saravana Kumar, 2022, 2022 IEEE 2nd Mysore Sub Section International Conference (MysuruCon), P1, DOI 10.1109/MysuruCon55714.2022.9972560
  • [2] Optimized Offline-Coverage Path Planning Algorithm for Multi-Robot for Weeding in Paddy Fields
    Govindaraju, Murugaraj
    Fontanelli, Daniele
    Kumar, S. Selva
    Pillai, Anju S.
    [J]. IEEE ACCESS, 2023, 11 : 109868 - 109884
  • [3] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS
    HART, PE
    NILSSON, NJ
    RAPHAEL, B
    [J]. IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02): : 100 - +
  • [4] Iima Hitoshi, 2008, SICE 2008 - 47th Annual Conference of the Society of Instrument and Control Engineers of Japan, P2045, DOI 10.1109/SICE.2008.4654998
  • [5] Fast replanning for navigation in unknown terrain
    Koenig, S
    Likhachev, M
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (03) : 354 - 363
  • [6] Lifelong planning A
    Koenig, S
    Likhachev, M
    Furcy, D
    [J]. ARTIFICIAL INTELLIGENCE, 2004, 155 (1-2) : 93 - 146
  • [7] LaValle Steven M, 1998, COMPUTER ENCE DEP
  • [8] Nair Sandeep S., 2022, 2022 4th International Conference on Inventive Research in Computing Applications (ICIRCA), P211, DOI 10.1109/ICIRCA54612.2022.9985576
  • [9] Using Particle Swarm Optimization for Robot Path Planning in Dynamic Environments with Moving Obstacles and Target
    Nasrollahy, Amin Zargar
    Javadi, Hamid Haj Seyyed
    [J]. 2009 THIRD UKSIM EUROPEAN SYMPOSIUM ON COMPUTER MODELING AND SIMULATION (EMS 2009), 2009, : 60 - +
  • [10] Nippun Kumaar A. A., 2023, 2023 IEEE INT C EL C, P1, DOI [10.1109/CONECCT57959.2023.10234766, DOI 10.1109/CONECCT57959.2023.10234766]
12