000			03755nam a22004455i 4500
999			_c387308 _d387308
001			387308
003			ES-MaUEC
005			20230312125734.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2012 sz | s |||| 0|eng d
020			_a9783031020087
024	7		_a10.1007/978-3-031-02008-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTJ211.415 _b2012 EB
100	1		_aFlocchini, Paola _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687266
245	1	0	_aDistributed Computing by Oblivious Mobile Robots _cby Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
250			_a1st edition 2012
264		1	_aCham _bSpringer International Publishing _c2012
300			_a1 recurso en línea (XIII, 171 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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.
988			_aSynthesis Collection of Technology_2012
650		7	_2embne _9160722 _aRobots móviles
650		7	_2embne _9156434 _aProceso distribuido (Informática)
650		7	_2embne _9670875 _aRobots autónomos
700	1		_aPrencipe, Giuseppe, _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687268 _d1972-
700	1		_aSantoro, N. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687267 _d1951- _q(Nicola),
776	0	8	_iPrinted edition: _z9783031008801
776	0	8	_iPrinted edition: _z9783031031366
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02008-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI