fullseye

car_dubins_path — GRAPH path op

使い方

Shortest forward-only path of a car between two poses (Dubins 1957) by the six closed-form words.

poses is [[x, y, theta], [x', y', theta']] (start, goal; theta in radians, counter-clockwise from the x axis). The car turns with minimum radius radius and never reverses. Dubins proved the shortest path is one of LSL, RSR, LSR, RSL, RLR, LRL (arcs of maximal curvature and straights); each word’s three segment lengths are closed-form (Shkel and Lumelsky 2001). Every candidate is verified by forward integration to the goal and discarded if it misses (fail-closed against formula slips; the count is returned as n_rejected), and the shortest survivor is the answer.

Returns word, length (metres), segments [(kind, gear, length)] (kind L/S/R, gear +1), points (N, 3) poses sampled every step metres along the path (start and goal included), candidates [(word, length)] for all verified words in increasing length, n_rejected, lower_bound (the Euclidean distance, never exceeded), radius.

Raises ValueError: poses not (2, 3) finite; radius or step not positive; no word reaches the goal (cannot happen for finite poses; reported rather than guessed).

参考(サンプルデータ・文献)

実行できる例(この op を実際に呼ぶ検証済みサンプル)

型が繋がる次の op(table を入力に取れる)

graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length

同カテゴリ(path)

car_reeds_shepp_path · car_hybrid_astar


Provenance: carpath.py — GRAPH operator registry. この per-op ノートは tools/opdocs.py md が自動生成(手編集しない)。

© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.