International Journal of Robotics and Autonomous Systems ISSN: 3107-7382 (Online)

Author: Amitav Sengupta, Riya Mehra

Abstract: Path planning is a critical component in autonomous robotic navigation, enabling robots to determine an efficient route from their current position to a designated goal. This paper explores the core principles and practical applications of simple path planning algorithms, including Dijkstra’s algorithm, A* (A-star), and the Bug algorithm. By comparing their computational requirements, path efficiency, and suitability for different environments, this paper provides a foundational guide for students, researchers, and developers entering the field of mobile robotics. Emphasis is placed on simplicity, computational efficiency, and adaptability to real-time robotic systems with limited hardware resources.

Keywords: Path Planning, Robotics, Dijkstra, A*, Bug Algorithm, Autonomous Navigation