| 000 | 05689nam a2200757 i 4500 | ||
|---|---|---|---|
| 001 | 6813466 | ||
| 003 | IEEE | ||
| 005 | 20200413152907.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 120921s2012 caua foab 001 0 eng d | ||
| 020 | _a9781608456871 (electronic bk.) | ||
| 020 | _z9781608456864 (pbk.) | ||
| 024 | 7 |
_a10.2200/S00440ED1V01Y201208DCT010 _2doi |
|
| 035 | _a(CaBNVSL)swl00401364 | ||
| 035 | _a(OCoLC)810486056 | ||
| 040 |
_aCaBNVSL _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aTJ211.415 _b.F563 2012 |
|
| 082 | 0 | 4 |
_a629.892 _223 |
| 100 | 1 | _aFlocchini, Paola. | |
| 245 | 1 | 0 |
_aDistributed computing by oblivious mobile robots _h[electronic resource] / _cPaola Flocchini, Giuseppe Prencipe, and Nicola Santoro. |
| 260 |
_aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : _bMorgan & Claypool, _cc2012. |
||
| 300 |
_a1 electronic text (xiii, 171 p.) : _bill., digital file. |
||
| 490 | 1 |
_aSynthesis lectures on distributed computing theory, _x2155-1634 ; _v# 10 |
|
| 538 | _aMode of access: World Wide Web. | ||
| 538 | _aSystem requirements: Adobe Acrobat Reader. | ||
| 500 | _aPart of: Synthesis digital library of engineering and computer science. | ||
| 500 | _aSeries from website. | ||
| 504 | _aIncludes bibliographical references (p. 153-165) and index. | ||
| 505 | 0 | _a1. Introduction -- 1.1 Distributed computing and mobility -- 1.2 Mobile robots and obliviousness -- 1.3 Structure of book -- | |
| 505 | 8 | _a2. Computational models -- 2.1 General capabilities -- 2.2 Behavior -- 2.3 Activation and operation schedule -- 2.4 Visibility -- 2.5 Memory -- 2.6 Movements and collisions -- 2.7 Geometric agreement and accuracy -- 2.8 Reliability and fault tolerance -- 2.9 Geometric definitions and terminology -- | |
| 505 | 8 | _a3. Gathering and convergence -- 3.1 Basic results -- 3.2 Rendezvous -- 3.3 Gathering with unlimited visibility -- 3.4 Convergence and gathering with limited visibility -- 3.5 Near-gathering -- 3.6 Gathering with inaccurate measurements -- 3.7 Gathering with faulty robots -- | |
| 505 | 8 | _a4. Pattern formation -- 4.1 Views and symmetricity -- 4.2 Arbitrary pattern formation -- 4.3 Pattern formation and initial configuration -- 4.4 Circle formation -- 4.5 Forming a sequence of patterns in SSYNC -- | |
| 505 | 8 | _a5. Scatterings and coverings -- 5.1 Removing dense points -- 5.2 Uniform covering of the line -- 5.3 Uniform covering of the ring -- 5.4 Filling of orthogonal spaces -- | |
| 505 | 8 | _a6. Flocking -- 6.1 Definitions and general strategy -- 6.2 Guided flocking in ASYNC -- 6.3 Guided flocking: the intruder problem -- 6.4 Homogeneous flocking in ASYNC -- 6.5 Homogeneous flocking with obstacles -- | |
| 505 | 8 | _a7. Other directions -- 7.1 Computing with colors -- 7.2 Solid robots -- 7.3 Oblivious computations in discrete spaces -- | |
| 505 | 8 | _aBibliography -- Authors' biographies -- Index. | |
| 506 | 1 | _aAbstract freely available; full-text restricted to subscribers or individual document purchasers. | |
| 510 | 0 | _aCompendex | |
| 510 | 0 | _aINSPEC | |
| 510 | 0 | _aGoogle scholar | |
| 510 | 0 | _aGoogle book search | |
| 520 | 3 | _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. | |
| 530 | _aAlso available in print. | ||
| 588 | _aTitle from PDF t.p. (viewed on September 21, 2012). | ||
| 650 | 0 | _aMobile robots. | |
| 650 | 0 | _aAutonomous robots. | |
| 650 | 0 |
_aElectronic data processing _xDistributed processing. |
|
| 653 | _aautonomous mobile robots | ||
| 653 | _adistributed computing | ||
| 653 | _adistributed algorithms | ||
| 653 | _acomputability | ||
| 653 | _aobliviousness | ||
| 653 | _aasynchrony | ||
| 653 | _acoordination tasks | ||
| 653 | _agathering | ||
| 653 | _apattern formation | ||
| 653 | _ascattering | ||
| 653 | _aflocking | ||
| 700 | 1 |
_aPrencipe, Giuseppe, _d1972- |
|
| 700 | 1 |
_aSantoro, N. _q(Nicola), _d1951- |
|
| 776 | 0 | 8 |
_iPrint version: _z9781608456864 |
| 830 | 0 | _aSynthesis digital library of engineering and computer science. | |
| 830 | 0 |
_aSynthesis lectures on distributed computing theory ; _v# 10. _x2155-1634 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6813466 |
| 999 |
_c561932 _d561932 |
||