A new approach for analyzing convergence algorithms for mobile robots

  • Authors:

  • Andreas Cord-Landwehr;Bastian Degener;Matthias Fischer;Martina Hüllmann;Barbara Kempkes;Alexander Klaas;Peter Kling;Sven Kurras;Marcus Märtens;Friedhelm Meyer Auf Der Heide;Christoph Raupach;Kamil Swierkot;Daniel Warner;Christoph Weddemann;Daniel Wonisch

  • Affiliations:

  • Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany;Heinz Nixdorf Institute & Department of Computer Science, University of Paderborn, Germany

  • Venue:
  • ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [6], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n2) and Ω(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.