Convergence properties of the gravitational algorithm in asynchronous robot systems

Reuven Cohen, David Peleg

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

17 Scopus citations

Abstract

This paper considers the convergence problem in autonomous mobile robot systems. A natural algorithm for the problem requires the robots to move towards their center of gravity. Previously it was known that the gravitational algorithm converges in the synchronous or semi-synchronous model, and that two robots converge in the asynchronous model. The current paper completes the picture by proving the correctness of the gravitational algorithm in the fully asynchronous model for any number of robots. It also analyses its convergence rate, and establishes its convergence in the presence of crash faults.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSusanne Albers, Tomasz Radzik
PublisherSpringer Verlag
Pages228-239
Number of pages12
ISBN (Print)3540230254, 9783540230250
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Convergence properties of the gravitational algorithm in asynchronous robot systems'. Together they form a unique fingerprint.

Cite this