Expand description
Reeds-Shepp Path Planner
Computes optimal paths for a car-like robot that can move both forward and backward, using combinations of straight and arc segments.
Structs§
Functions§
- reeds_
shepp_ path_ planning - reeds_
shepp_ paths - Every Reeds-Shepp path from
(sx, sy, syaw)to(gx, gy, gyaw)(not just the shortest), sampled everystep_size[m], with the direction of travel (+1 forward, -1 reverse) at each sample. Lets a caller pick by its own cost, e.g. the shortest collision-free path or one with fewer gear changes.