Distributed models and algorithms for mobile robot systems

Asaf Efrima, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

30 Scopus citations

Abstract

Systems consisting of a collection of independently operating mobile robots (a.k.a. robot swarms) have recently been studied from a distributed computing point of view. The paper reviews the basic model developed for such systems and some recent algorithmic results on a number of coordination and control tasks for robot swarms. The paper then discusses various possibilities for modifications in the basic model, and examines their effects via the example of the partitioning problem.

Original languageEnglish
Title of host publicationSOFSEM 2007
Subtitle of host publicationTheory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
PublisherSpringer Verlag
Pages70-87
Number of pages18
ISBN (Print)9783540695066
DOIs
StatePublished - 2007
Externally publishedYes
Event33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007 - Harrachov, Czech Republic
Duration: 20 Jan 200726 Jan 2007

Publication series

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

Conference

Conference33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007
Country/TerritoryCzech Republic
CityHarrachov
Period20/01/0726/01/07

Fingerprint

Dive into the research topics of 'Distributed models and algorithms for mobile robot systems'. Together they form a unique fingerprint.

Cite this