The path planning problem is a computational problem which is directed to search for sequences of positions (or, equivalently, movements) that can take a vehicle from a starting point to an end point, or even allow the vehicle to pass through a predefined sequence of points. The simplest versions have the sole objective of avoiding areas where the vehicle could not physically travel or where it would sustain damages, but this almost always generates more than one valid solution. For this reason, many algorithms also deal at the very least with choosing the shortest, fastest or safest of these alternatives to adopt.