000 03966nam a22005415i 4500
001 978-3-031-02008-7
003 DE-He213
005 20240730164932.0
007 cr nn 008mamaa
008 220601s2012 sz | s |||| 0|eng d
020 _a9783031020087
_9978-3-031-02008-7
024 7 _a10.1007/978-3-031-02008-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM000000
_2bisacsh
072 7 _aUY
_2thema
082 0 4 _a004
_223
100 1 _aFlocchini, Paola.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_986744
245 1 0 _aDistributed Computing by Oblivious Mobile Robots
_h[electronic resource] /
_cby Paola Flocchini, Giuseppe Prencipe, Nicola Santoro.
250 _a1st ed. 2012.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2012.
300 _aXIII, 171 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
505 0 _aIntroduction -- Computational Models -- Gathering and Convergence -- Pattern Formation -- Scatterings and Coverings -- Flocking -- Other Directions.
520 _aThe study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions.
650 0 _aComputer science.
_99832
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aData structures (Computer science).
_98188
650 1 4 _aComputer Science.
_99832
650 2 4 _aCoding and Information Theory.
_986748
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aPrencipe, Giuseppe.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_986749
700 1 _aSantoro, Nicola.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_986751
710 2 _aSpringerLink (Online service)
_986753
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031008801
776 0 8 _iPrinted edition:
_z9783031031366
830 0 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
_986754
856 4 0 _uhttps://doi.org/10.1007/978-3-031-02008-7
912 _aZDB-2-SXSC
942 _cEBK
999 _c86001
_d86001