Autonomous mobile robots grapple with the complexities of navigating their operational environment and exercising independent decision-making. A principal challenge in robotics lies in path planning, i.e., identifying the optimal route from an origin to a destination. Various approaches to surmount this challenge have been probed by researchers, taking into account parameters such as the environment, the type of robot, and application prerequisites. A proficient path-planning algorithm stands as a linchpin for secure mobile robot navigation and the triumphant execution of robotics applications. Typically, the primary objective of the navigation process is to minimize the distance traversed, given its implications on other metrics such as processing time and energy consumption. This research aims to shed light on the pivotal components of mobile robot environment representation, navigation, and offers an analysis of certain path-planning techniques. When the development of navigation algorithms initially kicked off, classical techniques such as Artificial Potential Field (APF), Cell Decomposition, and Roadmap gained popularity. However, compared to their predecessors, heuristic path planning techniques like Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Ant Colony Optimization (ACO) have recently witnessed a surge in exploration. This research presents a balanced examination of the merits and demerits of these methods.