Optimizing Robot Pathways for Energy Efficiency: Dijkstra and A* Approaches

Trajectory planning is a critical issue in the implementation of mobile robots for both human and industrial applications. Algorithms have been developed using various methodologies and heuristics to enhance their efficiency. This work presents an analysis of the Dijkstra and A* algorithms in trajectory planning for robots, focusing on energy efficiency within a simulated environment. The study considers the complexity of the search space, the cost of the route, and the number of turns in the obtained trajectory. Cost values for graphs and grids are input, and the environment is represented as a matrix. Finally, the performance of both algorithms is compared to identify the most energy-efficient one and to determine the route with the lowest cost.