Robot Convergence via Center-of-Gravity Algorithms

R. Cohen, David Peleg

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

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 languageAmerican English
Title of host publicationStructural Information and Communication Complexity
EditorsRatislav Královic̆, Ondrej Sýkora
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages79-88
Volume3104
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science

Fingerprint

Dive into the research topics of 'Robot Convergence via Center-of-Gravity Algorithms'. Together they form a unique fingerprint.

Cite this