Distributed Computing by Oblivious Mobile Robots (Record no. 86001)

000 -LEADER
fixed length control field 03966nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-02008-7
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730164932.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2012 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031020087
-- 978-3-031-02008-7
082 04 - CLASSIFICATION NUMBER
Call Number 004
100 1# - AUTHOR NAME
Author Flocchini, Paola.
245 10 - TITLE STATEMENT
Title Distributed Computing by Oblivious Mobile Robots
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2012.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XIII, 171 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Distributed Computing Theory,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Computational Models -- Gathering and Convergence -- Pattern Formation -- Scatterings and Coverings -- Flocking -- Other Directions.
520 ## - SUMMARY, ETC.
Summary, etc The 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.
700 1# - AUTHOR 2
Author 2 Prencipe, Giuseppe.
700 1# - AUTHOR 2
Author 2 Santoro, Nicola.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-02008-7
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2012.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding theory.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Information theory.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science).
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding and Information Theory.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data Structures and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2155-1634
912 ## -
-- ZDB-2-SXSC

No items available.