pith. sign in

arxiv: 1604.05553 · v2 · pith:YEZMY4Y2new · submitted 2016-04-19 · 🧮 math.OC · math.FA

Asymptotic behaviour in the robot rendezvous problem

classification 🧮 math.OC math.FA
keywords problemrendezvousrobotauthorsconditionconvergencefeintuchfrancis
0
0 comments X
read the original abstract

We present a non-technical overview of the results obtained by the authors (2015) concerning the so-called robot rendezvous problem studied by Feintuch and Francis (2012). In particular, we present a necessary and sufficient condition for convergence of the solution in terms of Ces\`aro convergence of the translates $S^k x_0$, $k\ge0$, of the sequence $x_0$ of initial positions under the right-shift operator $S$, thus shedding new light on questions left open in by Feintuch and Francis. We also formulate a stronger ergodic condition on $x_0$ which ensures that the corresponding solution converges to its limit at the rate $O(t^{-1/2})$ as $t\to\infty$. We conclude with a brief discussion of a natural two-sided variant of the robot rendezvous problem and by relating the robot rendezvous problem to a more realistic model of vehicle platoons, for which the authors' earlier general results lead to analogous statements.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.