Global Planner

A path planning algorithm that computes a complete route from the robot's current position to the goal on a known map. Global planners (A*, Dijkstra, RRT, PRM) produce a reference path that the local planner then follows while avoiding dynamic obstacles. In ROS, the global planner runs on the static costmap at lower frequency than the local planner.