path op• 資料種類:matrix → table
• 呼叫: import fullseye as fs; fs.ledger.car_dubins_path(poses, radius=1.0, step=0.05)(要直接呼叫實作,import carpath; carpath.car_dubins_path(poses, radius=1.0, step=0.05);從台帳取用則 opsgraph.get("car_dubins_path"))
> 該運算子的說明尚無譯文,以下照原文給出。
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).
• 範例資料目錄(下載 URL / 授權) —— 2-D 用 skimage.data(BSD/公有領域)加合成圖,3-D 給出真實資料源(Stanford/PDS 等)的下載 URL。
• 運算子來歷與參考文獻 —— 該運算子族所依據的研究/方法出處。
• 演算法的正典(作者・年份)與用途見上面的族使用指南。
• poc_car_parking — py -3.11 examples/poc_car_parking.py
• poc_driving_school — py -3.11 examples/poc_driving_school.py
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 運算子登記表。本條目由 tools/opdocs.py md 自動產生(請勿手動編輯)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.