Efficient Mobile Robot Navigation with D* Lite and Bellman Ford Hybrid Algorithm.

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.