Dubins Shortest Path with Degenerate-Case Handling¶
- Task ID:
robotics.dubins_shortest_path - Domain:
robotics - Subdomain:
Motion Planning - Status:
test - Tags:
motion_planning,dubins_curves,optimal_control,degenerate_cases,path_planning,curvature_constraint,numerical_stability
Public Summary¶
This page is generated from task metadata and selected public-safe excerpts.
Example B1 Prompt Excerpt¶
# B1
## Goal
A car-like robot moves in the plane with **forward motion only** and a
**minimum turning radius** `rho` (maximum curvature magnitude `|kappa| = 1/rho`).
For each start pose `(x1, y1, theta1)` and goal pose `(x2, y2, theta2)` in
`data/configurations.csv`, compute the **shortest feasible** Dubins path length
and write all lengths to `results/path_lengths.npy`.
Implement your solution in `analysis.py` in the workspace root. The script
Notes¶
- This page is a generated site artifact.
- Higher-level prompt details and internal benchmark specifics may remain intentionally undisclosed.