Introduces and solves the under-specified Reeds-Shepp problem: find the vehicle orientation that results in the shortest path.
-
Updated
Aug 14, 2025 - C++
Introduces and solves the under-specified Reeds-Shepp problem: find the vehicle orientation that results in the shortest path.
Visibility-based Reeds-Shepp marching solver for locally optimal nonholonomic path planning on 2D occupancy grids.
Add a description, image, and links to the nonholonomic-planning topic page so that developers can more easily learn about it.
To associate your repository with the nonholonomic-planning topic, visit your repo's landing page and select "manage topics."