Robot convergence via center-of-gravity algorithms

Reuven Cohen, David Peleg

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

57 Scopus citations

Abstract

Consider a group of N robots aiming to converge towards a single point. The robots cannot communicate, and their only input is obtained by visual sensors. A natural algorithm for the problem is based on requiring each robot to move towards the robots' center of gravity. The paper proves the correctness of the center-of-gravity algorithm in the semi-synchronous model for any number of robots, and its correctness in the fully asynchronous model for two robots.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRastislav Kralovic, Ondrej Sykora
PublisherSpringer Verlag
Pages79-88
Number of pages10
ISBN (Print)3540222308
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

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

Fingerprint

Dive into the research topics of 'Robot convergence via center-of-gravity algorithms'. Together they form a unique fingerprint.

Cite this