Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots
Stephen L. Smith, Mireille E. Broucke, Bruce A. Francis
Abstract
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.
Create a lesson
Related papers
CLAP: Cross-Embodiment Video World Models are Zero-Shot Physical Simulators
Kechen Liu, Ola Shorinwa
FlashVLA: Streaming Action Decoding for Fast and Asynchronous VLA Inference
Zekai Li, Jiaming Tang, Zhijian Liu
Embodied Scene Rearrangement Planning
Canzhi Chen, Zan Wang, Siqi Zhu et al.
STEP: State-Aware Task Estimation and Planning with Multi-Modal LLMs for Human-Robot Collaboration
Maitrey Gramopadhye, Prakash Baskaran, Xiao Liu et al.
Tensegrity Continuum Robots Enable Task-Adaptive Morphologies for Cooperative Behaviors
Mahmud Hasan Saikot, Sydney Spiegel, Sudheera Akalanka Kariyawasam et al.
Task-space model-based control of pneumatic soft actuators
Nithin S. Kumar, Joshua Gaston, D. Caleb Rucker et al.