Autonomous navigation is a cornerstone of modern robotic systems. This review provides a comprehensive analysis of the landscape of obstacle avoidance and path planning techniques for mobile robots. We categorize and evaluate a range of approaches, beginning with traditional graph-based methods such as A* and Dijkstra, and geometric techniques like Voronoi diagrams and cell decomposition. The review extends to modern metaheuristic algorithms, including genetic algorithms (GA), particle swarm optimization (PSO), and ant colony optimization (ACO). Furthermore, we explore hybrid models that integrate traditional methods with machine learning, such as reinforcement learning (RL) and neural networks (NN). These hybrid approaches aim to address specific challenges, including escaping local minima and enabling real-time decision-making in uncertain environments. A significant focus is placed on the emerging role of Large Language Models (LLMs), analyzing their application in translating natural language commands into navigational actions and improving human-robot interaction. This work critically analyzes the trade-offs of each paradigm—including computational efficiency, scalability, and adaptability across these diverse methods. Finally, this review outlines emerging trends and open challenges, highlighting potential research directions in collaborative robotics, multi-agent systems, and the broader field of mobile robot navigation.

The ability to navigate autonomously from the start to its final goal is the crucial key to mobile robots. To ensure complete navigation, it is mandatory to do heavy programming since this task is composed of several subtasks such as path planning, localization, and obstacle avoidance. This paper simplifies this heavy process by making the robot more intelligent. The robot will acquire the navigation policy from an expert in navigation using machine learning. We used the expert A*, which is characterized by generating an optimal trajectory. In the context of robotics, learning from demonstration (LFD) will allow robots, in general, to acquire new skills by imitating the behavior of an expert. The expert will navigate in different environments, and our robot will try to learn its navigation strategy by linking states and suitable actions taken. We find that our robot acquires the navigation policy given by A* very well. Several tests were simulated with environments of different complexity and obstacle distributions to evaluate the flexibility and efficiency of the proposed strategies. The experimental results demonstrate the reliability and effectiveness of the proposed method.

Autonomous mobile robots have revolutionized navigation by operating without human intervention, leveraging advanced data acquisition systems such as cameras, radar, and LIDAR, along with sophisticated planning, localization, and control algorithms. A critical challenge in this domain is path planning: determining optimal trajectories to ensure safe and efficient travel in diverse environments. This paper addresses the need to systematically evaluate trajectory-planning algorithms, whose selection directly impacts navigation performance. We present a comprehensive analysis of various classes of path-planning methods, detailing their advantages, limitations, and application contexts. By comparing these algorithms, we identify key criteria for selecting the most suitable approach for a given scenario based on environmental complexity, computational constraints, and robot configuration. Our results synthesize existing solutions into a coherent framework that guides practitioners and researchers in algorithm choice. Finally, we discuss current challenges, such as real-time adaptability and scalability, and outline future prospects to advance mobile robot navigation systems. This work offers actionable insights to improve the reliability and performance of autonomous navigation.