{"paper":{"title":"Markov-Dubins Interpolating Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C. Yal\\c{c}{\\i}n Kaya","submitted_at":"2018-01-19T07:42:21Z","abstract_excerpt":"A realistic generalization of the Markov--Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a number of prescribed intermediate points/nodes. We refer to this generalization as the Markov--Dubins interpolation problem. We formulate this interpolation problem as an optimal control problem and obtain results about the structure of its solution using optimal control theory. The Markov--Dubins interpolants consist of a concatenation of circular ($C$) and st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06325","kind":"arxiv","version":2},"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"}