Performance analysis of path planning techniques for autonomous robotsA deep path planning analysis in 2D environments

Autonomous robots can use path planning techniques to determine the optimal trajectory during the mission. These techniques can be classified as classical, meta heuristic, or machine learning-based. The choice of each technique for a mission depends on its specific requirements, such as finding the shortest path, completing the mission in the minimum time, or/and exploring the environment, among others. Therefore, the path planning algorithms analysis is essential to assist in selecting the appropriate technique. In the literature, the path planning algorithms are typically compared within the same category, and a general analysis is conducted to decide which technique to employ for a particular mission. However, this paper aims to delve deeper into the behavior and performance of these three path planning techniques. The analysis is based on simulations in various environments to understand how each technique behaves and performs, specifically focusing on computation costs, time, and path length efficiency.