0
Your cart

Your cart is empty

Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology

Buy Now

Distributed Computing by Oblivious Mobile Robots (Paperback) Loot Price: R1,283
Discovery Miles 12 830
Distributed Computing by Oblivious Mobile Robots (Paperback): Paola Flocchini, Giuseppe Prencipe, Nicola Santoro

Distributed Computing by Oblivious Mobile Robots (Paperback)

Paola Flocchini, Giuseppe Prencipe, Nicola Santoro

Series: Synthesis Lectures on Distributed Computing Theory

 (sign in to rate)
Loot Price R1,283 Discovery Miles 12 830 | Repayment Terms: R120 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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

General

Imprint: Springer International Publishing AG
Country of origin: Switzerland
Series: Synthesis Lectures on Distributed Computing Theory
Release date: August 2012
First published: 2012
Authors: Paola Flocchini • Giuseppe Prencipe • Nicola Santoro
Dimensions: 235 x 191mm (L x W)
Format: Paperback
Pages: 171
ISBN-13: 978-3-03-100880-1
Languages: English
Subtitles: English
Categories: Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
LSN: 3-03-100880-4
Barcode: 9783031008801

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners