Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots

  title={Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots},
  author={Stephen L. Smith and Mireille E. Broucke and Bruce A. Francis},
  journal={IEEE Transactions on Automatic Control},
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… Expand
Rendezvous of unicycles: A bearings-only and perimeter shortening approach
It is proved that under the proposed control law, the perimeter of the convex hull defined by the positions of robots decays all the time and all the robots converge to a common point. Expand
Energy Efficient Robot Rendezvous
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous is minimized. WeExpand
A Distributed Heuristic for Energy-Efficient Multirobot Multiplace Rendezvous
A simple heuristic controller that runs independently on each robot, yet is guaranteed to achieve an approximation to global solution in bounded time linear in population size is presented. Expand
A contribution to collision-free trajectory planning for handling systems in varying environments
A new approach for trajectory planning based on curve shortening flows combined with potential fields is described, which will enable collision-free motion planning of handling system manipulators from the start to the end position within a changing environment. Expand
Bayesian rendezvous for distributed robotic systems
  • Sven Gowal, A. Martinoli
  • Computer Science
  • 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2011
This paper states sufficient conditions to perform a rendezvous maneuver with a group of differential-wheeled robots endowed with an on-board, noisy, local positioning system and extends the existing framework of noise-free, graph-based distributed control with a layer of Bayesian reasoning to solve the rendezvous problem more efficiently. Expand
Geometry of cyclic pursuit
An n-agent cyclic pursuit scheme in which each agent employs a constant bearing pursuit strategy is explored, demonstrating the existence of an invariant submanifold, and state necessary and sufficient conditions for theexistence of rectilinear and circling relative equilibria on that sub manifold. Expand
Distance optimal formation control on graphs with a tight convergence time guarantee
  • Jingjin Yu, S. LaValle
  • Computer Science, Mathematics
  • 2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
  • 2012
This work proposes a fast distance optimal control algorithm that guides the agents into the desired formation and shows that the algorithm also provides a tight convergence time guarantee. Expand
Distributed optimal cooperative tracking control of multiple autonomous robots
An inverse optimal control strategy is employed to design cost functions such that three cooperative control objectives including cooperative tracking, obstacle avoidance, and control effort minimization, can be addressed in one optimal control design process. Expand
Minimal time splines on the sphere
An interesting problem in geometric control theory arises from robotics and space science: find a smooth curve, controlled by a bounded acceleration, connecting in minimum time two prescribed tangentExpand
About simple variational splines from the Hamiltonian viewpoint
In this paper, we study simple splines on a Riemannian manifold $Q$ from the point of view of the Pontryagin maximum principle (PMP) in optimal control theory. The control problem consists in findingExpand


Curve Shortening and its Application to Multi-Agent Systems
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 EuclideanExpand
A discrete curve-shortening equation
The usual "curve-shortening equation" describes the planar motion of a smooth curve that moves in a direction normal to itself with a speed proportional to its local curvature. We present here anExpand
Evolutions of Planar Polygons
Experimental results show that an arbitrary initial polygon converges to either regular or irregular polygonal approximations of circles when evolving according to the proposed Euclidean flows. Expand
Formations of vehicles in cyclic pursuit
This paper shows that the system's equilibrium formations are generalized regular polygons and it is exposed how the multivehicle system's global behavior can be shaped through appropriate controller gain assignments. Expand
The Curve Shortening Problem
BASIC RESULTS Short Time Existence Facts from Parabolic Theory Evolution of Geometric Quantities INVARIANT SOLUTIONS FOR THE CURVE SHORTENING FLOW Travelling Waves Spirals The Support Function of aExpand
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
The results of computer simulation under a more realistic model give convincing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error. Expand
Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions
The novel correctness proof relies on proximity graphs and their properties and on a general LaSalle invariance principle for nondeterministic discrete-time dynamical systems. Expand
The multi-agent rendezvous problem
  • J. Lin, A. Morse, B. Anderson
  • Engineering
  • 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
  • 2003
This paper is concerned with the collective behavior of a group of n > 1 mobile autonomous agents, labelled 1 through n, which can all move in the plane. Each agent is able to continuously track theExpand
We show that an analog of the Gage-Grayson-Hamilton Theorem for curves moving according to their mean curvature holds for the motion of quadrilaterals according to their Menger curva- ture.
Eventually consistent compasses for robust gathering of asynchronous mobile robots with limited visibility
This paper defines a model with unreliable compasses and, focusing on the gathering problem, gives a gathering algorithm that solves the problem in a system where compasses are unstable for some arbitrary long periods, provided that they stabilize eventually. Expand