Obstacle detection bot is a smart robot that can identify barriers in its path and rapidly choose a new path to deliver / move safely and without interruption. These robots can be seen in modern restaurants, hospitals, and other congested areas where items must be delivered quickly and safely. Topics linked to robotics have been one of the most researched subjects in recent years. Meanwhile, intelligent mobile robots are popular, but controlling and navigating them is challenging, and the inability to deal with permanent impediments and avoid them through safe and secure routing is a key necessity of these systems. Motion planning, also known as path planning (sometimes known as the navigation issue or the piano mover's problem), is a computational problem that involves determining a set of viable configurations for moving an object from one location to another. Computational geometry, computer animation, robotics, and computer games all utilize the phrase. The computation of a continuous path that connects a start configuration S and a goal configuration G while avoiding collision with known obstacles is a basic motion planning problem. In a 2D or 3D workspace, the robot and obstacle geometry are defined, and the motion is represented as a path in (potentially higher-dimensional) configuration space. The subject of optimal path planning is a well-studied topic in academics that has found applications in a variety of industries. Google Maps is a widely used application that mainly relies on path finding algorithms, image processing, satellite navigation, and sensor-based systems, among other things. Autonomous vehicles are futuristic technologies that will be on the road in all developed countries within the next five years. All of the challenges listed above necessitated the development of speedier algorithms for finding the shortest path from a source to a target or multiple goals while avoiding static or moving impediments. So the proposed work aims to compare four different path planning algorithms, namely Bug 1 Algorithm, Bug 2 Algorithm, D* Algorithm and A * algorithm and through an thorough comparative study conclude which of them is the best algorithm.

Route, Distance, Left, Right, Grid.