Robot Path Planning and Tracking with the Flower Pollination SearchOptimization Algorithm

Robot path planning and tracking involve two critical aspects of autonomous navigation systems: determining an optimal route for the robot to follow and ensuring that it accurately adheres to this path in real-time. Path planning focuses on generating a feasible and efficient trajectory from a starting point to a destination while considering obstacles, dynamic environments, and constraints. This paper investigates the effectiveness of the Flower Pollination Search Optimization (FPSO) algorithm for robot path planning and compares its performance with traditional algorithms such as A* Algorithm, Dijkstra, and Rapidlyexploring Random Tree (RRT). The FPSO algorithm was evaluated across three distinct scenarios, demonstrating superior performance in terms of path length, computation time, and path smoothness. In Scenario 1, FPSO achieved an optimized path length of 10.5 meters with a computation time of 3.2 seconds, a path smoothness score of 8.9, and a path efficiency of 95%. In Scenario 2, FPSO resulted in a path length of 12.3 meters and a computation time of 3.5 seconds, with a smoothness score of 8.7 and an efficiency of 93%. Scenario 3 showed FPSO's best performance, with a path length of 9.8 meters, computation time of 3.0 seconds, a smoothness score of 9.0, and a path efficiency of 96%. Comparatively, the A* Algorithm, Dijkstra, and RRT exhibited longer path lengths and higher computation times, with lower smoothness scores and efficiencies.