平面多角形リンク機構の運動計画と制御
Motion planning and control of a planar polygonal linkage
多角形リンク機構の配置空間をセル分解の頂点-辺グラフで近似し、15ステップ以内で経路を計画する高速ナビゲーションアルゴリズムを提案した。各ステップは四辺形の変形として明示的に実行できる。
著者: Gaiane Panina, Dirk Siersma
分類: math.MG, cs.RO
原文アブストラクト
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The algorithm has three aspects: (1) the number of navigation steps does not exceed 15 (independent of the linkage), (2) each step is a disguised flex of a quadrilateral from one triangular configuration to another, which is a well understood type of flex, and (3) each step can be performed explicitly by adding some extra bars and obtaining a mechanism with one degree of freedom.
