Path Planning

Computing a collision-free route from a start configuration to a goal configuration. Path planning algorithms include: grid-based (A*, Dijkstra), sampling-based (RRT, PRM), and optimization-based (trajectory optimization). In manipulation, path planning operates in high-dimensional joint space; in navigation, it operates in 2D or 3D workspace. The distinction between path planning and motion planning is that the latter also considers time and dynamics.