What are global path planning algorithms?

Global path planning algorithms are computational methods used to determine an optimal path for an agent to move from a starting point to a destination within a given environment, considering obstacles and constraints. These algorithms typically analyze the entire space to generate a path that minimizes cost, distance, or time while avoiding collisions. Common examples include A*, Dijkstra's algorithm, and Rapidly-exploring Random Trees (RRT). They are essential in robotics, autonomous vehicles, and computer games for navigation tasks.