曲線短縮流と移動自律ロボットのランデブー問題
Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots
移動ロボットの集合問題に着想を得て、多角形を曲率に比例して縮小させる線形スキームを提案し、凸性保持や周長単調減少など曲線短縮との類似性質を示した。
著者: Stephen L. Smith, Mireille E. Broucke, Bruce A. Francis
分類: cs.RO, cs.MA
原文アブストラクト
If a smooth, closed, and embedded curve is deformed along its normal vector field at a rate proportional to its curvature, it shrinks to a circular point. This curve evolution is called Euclidean curve shortening and the result is known as the Gage-Hamilton-Grayson Theorem. Motivated by the rendezvous problem for mobile autonomous robots, we address the problem of creating a polygon shortening flow. A linear scheme is proposed that exhibits several analogues to Euclidean curve shortening: The polygon shrinks to an elliptical point, convex polygons remain convex, and the perimeter of the polygon is monotonically decreasing.
