<p>This work presents the curvature-continuous path planning of a car-like robot for its turning motion around an obstacle. For the smoothness of the path, we adopt a <i>cubic parabola</i> whose curvature increases proportional to the location of the robot from its initial pose. We define multi-stage path planning problems. In the base stage, we assume a fixed initial and a fixed target configuration of a robot in an <i>SE</i>(2) state space and present an analytic formula for the curvature-continuous path and its deterministic way of checking a collision with a polygonal obstacle. In the inductive stage, we move our focus to the closed-form expression of a distance-optimal, collision-free path under flexible target orientation. In both stages, we provide in-depth performance analysis and validations with various case studies. The resulting paths in the base stage comply curvature-continuity constraint (less than 0.2&#xa0;rad/m curvature changes) with 5.5&#xa0;ms computation time, which is suitable for real-time applications. Regarding the inductive stage, the distance-optimal paths formed by our method satisfy the curvature-continuity constraint (0.2&#xa0;rad/m maximum curvature) and consume less time (maximum 2.34&#xa0;ms) while still showing similar path lengths (average 23.8&#xa0;m), compared to those by an existing method (<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11370_2025_588_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\infty \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>∞</mi> </math></EquationSource> </InlineEquation>&#xa0;rad/m maximum curvature, 110.7&#xa0;ms maximum computation time, and 24.6&#xa0;m average path length).</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Local path planning scheme for car-like robots’ shortest turning motion using geometric analysis

  • Seoung Kyou Lee,
  • Nakju Doh

摘要

This work presents the curvature-continuous path planning of a car-like robot for its turning motion around an obstacle. For the smoothness of the path, we adopt a cubic parabola whose curvature increases proportional to the location of the robot from its initial pose. We define multi-stage path planning problems. In the base stage, we assume a fixed initial and a fixed target configuration of a robot in an SE(2) state space and present an analytic formula for the curvature-continuous path and its deterministic way of checking a collision with a polygonal obstacle. In the inductive stage, we move our focus to the closed-form expression of a distance-optimal, collision-free path under flexible target orientation. In both stages, we provide in-depth performance analysis and validations with various case studies. The resulting paths in the base stage comply curvature-continuity constraint (less than 0.2 rad/m curvature changes) with 5.5 ms computation time, which is suitable for real-time applications. Regarding the inductive stage, the distance-optimal paths formed by our method satisfy the curvature-continuity constraint (0.2 rad/m maximum curvature) and consume less time (maximum 2.34 ms) while still showing similar path lengths (average 23.8 m), compared to those by an existing method ( \(\infty \)  rad/m maximum curvature, 110.7 ms maximum computation time, and 24.6 m average path length).