有界曲率的凸游程
Convex Tours of Bounded Curvature
摘要:
研究了一点沿有界曲率光滑闭凸路径运动的运动规划问题。移动点的工作空间由具有m个顶点的凸多边形限定,该凸多边形包含具有$n$顶点的简单多边形形式的障碍。我们提出了一个O(m+n)的时间算法找到的路径,去周围的障碍,其曲率是最小的可能。
英文摘要:
We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with $n$ vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。