{"paper":{"title":"The Cost of Bounded Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Hyo-Sil Kim, Otfried Cheong","submitted_at":"2011-06-30T12:58:49Z","abstract_excerpt":"We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations $\\sigma, \\sigma'$, let $\\ell(\\sigma, \\sigma')$ be the shortest bounded-curvature path from $\\sigma$ to $\\sigma'$. For $d \\geq 0$, let $\\ell(d)$ be the supremum of $\\ell(\\sigma, \\sigma')$, over all pairs $(\\sigma, \\sigma')$ that are at Euclidean distance $d$. We study the function $\\dub(d) = \\ell(d) - d$, which expresses the difference between the bounded-curvature path length and the Euc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6214","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}