path op• 데이터 종류: matrix → table
• 호출: import fullseye as fs; fs.ledger.car_reeds_shepp_path(poses, radius=1.0, step=0.05)(구현을 직접 호출하려면 import carpath; carpath.car_reeds_shepp_path(poses, radius=1.0, step=0.05), 원장에서 가져오려면 opsgraph.get("car_reeds_shepp_path"))
> 이 연산자의 설명은 아직 번역이 없습니다. 원문을 그대로 싣습니다.
Shortest path of a car that may reverse, between two poses (Reeds and Shepp 1990), by closed form.
`poses is [[x, y, theta], [x', y', theta']]` (start, goal). The car turns with minimum radius
`radius` and may change gear. Reeds and Shepp proved the shortest path has at most five segments
drawn from 48 words (Sussmann and Tang 1991: 46 suffice); the 44 formulas used here (the 12 base
words of the paper expanded by time reversal, reflection and backwards reading, as in OMPL) generate
every candidate. Each candidate is verified by forward integration and discarded if it misses the
goal (counted in `n_rejected`); the shortest survivor is the answer. Reversed segments carry
`gear = -1`.
Returns `word (letters L/S/R; reversed segments are lower-case), length` (metres, sum of
absolute segment lengths), `segments [(kind, gear, length)], points (N, 3)` poses
sampled every `step metres, candidates [(word, length)] sorted, n_candidates`,
`n_rejected, lower_bound (Euclidean distance), radius`.
Raises `ValueError: poses not (2, 3) finite; radius or step` not positive; no word
reached the goal.
• 샘플 데이터 카탈로그(DL URL / 라이선스) —— 2-D 는 skimage.data(BSD/public)+ 합성, 3-D 는 실데이터 소스(Stanford/PDS 등)의 DL URL.
• 연산자의 내력·참고문헌 —— 이 연산자 족의 바탕이 된 연구/기법의 출처.
• 알고리즘의 정전(저자·연도)과 용도는 위의 패밀리 사용 가이드에 적혀 있습니다.
• poc_car_parking — py -3.11 examples/poc_car_parking.py
table 를 입력으로 받는 것)graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length
path)car_dubins_path · car_hybrid_astar
*Provenance: carpath.py — GRAPH 연산자 레지스트리. 이 op 노트는 tools/opdocs.py md 가 자동 생성합니다(직접 편집하지 마세요).*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.