Pallapothala Tejaswini
ABSTRACT
Robotics is a challenging area which is highly employed in various fields, including industry, logistics, healthcare, and transportation. They need effective and reliable path planning algorithms to navigate in complicated and dynamic situations. Due to its effectiveness and optimality, the hybridized algorithm has recently become a well-liked approach for resolving path planning issues in robotics. In this article, the D* Lite algorithm's implementation was done using Bellman ford Shortest Path Algorithm to achieve improved path quality and their performance assessment was done using different 2D maps. The theoretical foundation of the algorithm, its simulation implementation, and practical findings proving its efficiency regarding computing time, path distance and various other metrics are all presented in this article. It has been verified through both theoretical and empirical results that the novel hybrid technique can enhance the efficiency and effectiveness of the D*Lite. Simulation results are very much effective as D* lite implementation includes bellman ford algorithm for achieving nearly 25% reduced computation time as well as 36% improved optimal path length.
- C. Thorpe and L. Matthies. 1984. Path Relaxation: Path Planning for a Mobile Robot. OCEANS 1984 (1984). DOI: https://doi.org/10.1109/oceans.1984.1152243.Google Scholar
Cross Ref
- Mohd Nadhir Ab Wahab, Samia Nefti-Meziani, and Adham Atyabi. 2020. A comparative review on mobile robot path planning: Classical or meta-heuristic methods? Annual Reviews in Control 50, (2020), 233-252. DOI: https://doi.org/10.1016/j.arcontrol.2020.10.001.Google ScholarCross Ref
- E. Gilbert and D. Johnson. 1985. Distance functions and their application to robot path planning in the presence of obstacles. IEEE Journal on Robotics and Automation,1,1, 21-30. DOI: https://doi.org/10.1109/jra.1985.1087003.Google ScholarCross Ref
- Jerome Barraquand, Bruno Langlois, and Jean-Claude Latombe. 1989. Numerical Potential Field Techniques for Robot Path Planning. (1989). DOI: https://doi.org/10.21236/ada326999.Google ScholarCross Ref
- S.S. Ge and Y.J. Cui. 2000. New potential functions for mobile robot path planning. IEEE Transactions on Robotics and Automation 16, 5 (2000), 615-620. DOI: https://doi.org/10.1109/70.880813.Google ScholarCross Ref
- Phan Gia Luan and Nguyen Truong Thinh. 2021. Hybrid genetic algorithm based smooth global-path planning for a mobile robot. Mechanics Based Design of Structures and Machines 51, 3 (2021), 1758-1774. DOI: https://doi.org/10.1080/15397734.2021.1876569.Google ScholarCross Ref
- Lei Wu, Xiaodong Huang, Junguo Cui, Chao Liu, and Wensheng Xiao. 2023. Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot. Expert Systems with Applications 215, (2023), 119410. DOI: https://doi.org/10.1016/j.eswa.2022.119410.Google ScholarDigital Library
- Shichang Lu, Danyang Liu, Dan Li, and Xulun Shao. 2023. Enhanced Teaching–Learning-Based Optimization Algorithm for the Mobile Robot Path Planning Problem. Applied Sciences 13, 4 (2023), 2291. DOI: https://doi.org/10.3390/app1304229.Google ScholarCross Ref
- Fei-Fei Li, Yun Du, and Ke-Jin Jia. 2022. Path planning and smoothing of mobile robot based on improved artificial fish swarm algorithm. Scientific Reports 12, 1 (2022). DOI: https://doi.org/10.1038/s41598-021-04506-y.Google ScholarCross Ref
- Zhang, Ting-Wei, Guang-Hui Xu, Xi-Sheng Zhan, and Tao Han. 2022. A new hybrid algorithm for path planning of mobile robot. The Journal of Supercomputing 78, 3 (2022), 4158-4181. DOI: https://doi.org/10.1007/s11227-021-04031-9.Google ScholarDigital Library
- Tomas Kulvicius, Sebastian Herzog, Timo Lüddecke, Minija Tamosiunaite, and Florentin Wörgötter. 2021. One-Shot Multi-Path Planning Using Fully Convolutional Networks in a Comparison to Other Algorithms. Frontiers in Neurorobotics 14, (2021). DOI: https://doi.org/10.3389/fnbot.2020.600984.Google ScholarCross Ref
- Yan-long Yao, Xiao-feng Liang, Ming-zhi Li, Kai Yu, Zhe Chen, Chong-ben Ni, and Yue Teng. 2021. Path Planning Method Based on D* lite Algorithm for Unmanned Surface Vehicles in Complex Environments. China Ocean Engineering 35, 3 (2021), 372-383. DOI: https://doi.org/10.1007/s13344-021-0034-z.Google ScholarCross Ref
- Wenbin Hou, Zhihua Xiong, Changsheng Wang, and Howard Chen. 2022. Enhanced ant colony algorithm with communication mechanism for mobile robot path planning. Robotics and Autonomous Systems 148, (2022), 103949. DOI: https://doi.org/10.1016/j.robot.2021.103949.Google ScholarDigital Library
- V. Sathiya, M. Chinnadurai, and S. Ramabalan. 2022. Mobile robot path planning using fuzzy enhanced improved Multi-Objective particle swarm optimization (FIMOPSO). Expert Systems with Applications 198, (2022), 116875. DOI: https://doi.org/10.1016/j.eswa.2022.116875.Google ScholarCross Ref
- Ulises Orozco-Rosas, Kenia Picos, Juan J. Pantrigo, Antonio S. Montemayor, and Alfredo Cuesta-Infante. 2022. Mobile Robot Path Planning Using a QAPF Learning Algorithm for Known and Unknown Environments. IEEE Access 10, (2022), 84648-84663. DOI: https://doi.org/10.1109/access.2022.3197628.Google ScholarCross Ref
- Davide Caffagni. 2022. 2d-path-planning-dataset Dataset. Retrieved Feb 16, 2023 from https://www.kaggle.com/datasets/dcaffo/2dpathplanningdataset. DOI: https://doi.org/10.34740/KAGGLE/DSV/3575462.Google ScholarCross Ref
- Aisha Muhammad, Mohammed A. H. Ali, Sherzod Turaev, Ibrahim Haruna Shanono, Fadhl Hujainah, Mohd Nashrul Mohd Zubir, Muhammad Khairi Faiz, Erma Rahayu Mohd Faizal, and Rawad Abdulghafor. 2022. Novel Algorithm for Mobile Robot Path Planning in Constrained Environment. Computers, Materials & Continua 71, 2 (2022), 2697-2719. DOI: https://doi.org/10.32604/cmc.2022.020873.Google ScholarCross Ref
- Sunil Kumar and Afzal Sikander. 2022. A modified probabilistic roadmap algorithm for efficient mobile robot path planning. Engineering Optimization (2022), 1-19. DOI:https://doi.org/10.1080/0305215x.2022.2104840.Google ScholarCross Ref
- Deng, Xin, Ruifeng Li, Lijun Zhao, Ke Wang, and Xichun Gui. 2021. Multi-obstacle path planning and optimization for mobile robot. Expert Systems with Applications 183 (2021), 115445. DOI: https://doi.org/10.1016/j.eswa.2021.115445.Google ScholarDigital Library
- Inkyung Sung, Bongjun Choi, and Peter Nielsen. 2021. On the training of a neural network for online path planning with offline path planning algorithms. International Journal of Information Management 57, (2021), 102142. DOI: https://doi.org/10.1016/j.ijinfomgt.2020.102142.Google ScholarCross Ref
- Yonlin Huang and Shijie Guo. 2022. Path planning of mobile robots based on improved A* algorithm. 2022 Asia Conference on Advanced Robotics, Automation, and Control Engineering (ARACE) (2022). DOI: https://doi.org/10.1109/arace56528.2022.00031.Google ScholarCross Ref
- Fatin Hassan Ajeil, Ibraheem Kasim Ibraheem, Ahmad Taher Azar, and Amjad J. Humaidi. 2020. Grid-Based Mobile Robot Path Planning Using Aging-Based Ant Colony Optimization Algorithm in Static and Dynamic Environments. Sensors 20, 7 (2020), 1880. DOI: https://doi.org/10.3390/s20071880.Google ScholarCross Ref
- Lu Chang, Liang Shan, Chao Jiang, and Yuewei Dai. 2020. Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment. Autonomous Robots 45, 1 (2020), 51-76. DOI: https://doi.org/10.1007/s10514-020-09947-4.Google ScholarDigital Library
Index Terms
- Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm
Recommendations
Navigation of mobile robot by using D++ algorithm
The navigation of mobile robots is a vital aspect of technology in robotics. We applied the D++ algorithm, which is a novel and improved path-planning algorithm, to the navigation of mobile robots. The D++ algorithm combines Dijkstra's algorithm with ...
An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures
Finding the shortest paths from a single source to all other vertices is a common problem in graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single-source shortest path (SSSP) problem and better applies to be ...
On the Distributed Bellman-Ford Algorithm and the Looping Problem
The classic Bellman-Ford algorithm for calculating shortest paths can be easily adapted to a distributed environment in which the computations are performed locally by identical processors at each network node. A distributed shortest-path algorithm is ...
Comments