球面上の時間最適凸化Reeds-Shepp経路
Time-optimal Convexified Reeds-Shepp Paths on a Sphere
球面上を前後進できる車両の時間最適経路計画を解析し、最適経路が3種類の基本動作からなる最大6区間で構成されることを示した。
著者: Sixu Li, Deepak Prakash Kumar, Swaroop Darbha, Yang Zhou
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
This article studies the time-optimal path planning problem for a convexified Reeds-Shepp (CRS) vehicle on a unit sphere, capable of both forward and backward motion, with speed bounded in magnitude by 1 and turning rate bounded in magnitude by a given constant. For the case in which the turning-rate bound is at least 1, using Pontryagin's Maximum Principle and a phase-portrait analysis, we show that the optimal path connecting a given initial configuration to a desired terminal configuration consists of at most six segments drawn from three motion primitives: tight turns, great circular arcs, and turn-in-place motions. A complete classification yields a finite sufficient list of 23 optimal path types with closed-form segment angles derived. The complementary case in which the turning-rate bound is less than 1 is addressed via an equivalent reformulation. The proposed formulation is applicable to underactuated satellite attitude control, spherical rolling robots, and mobile robots operating on spherical or gently curved surfaces. The source code for solving the time-optimal path problem and visualization is publicly available at https://github.com/sixuli97/Optimal-Spherical-Convexified-Reeds-Shepp-Paths.
