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.