|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910254162503321 |
|
|
Autore |
Valentini Gabriele |
|
|
Titolo |
Achieving Consensus in Robot Swarms : Design and Analysis of Strategies for the best-of-n Problem / / by Gabriele Valentini |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2017.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 146 p. 46 illus., 37 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Studies in Computational Intelligence, , 1860-949X ; ; 706 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computational intelligence |
Robotics |
Automation |
Artificial intelligence |
Computational Intelligence |
Robotics and Automation |
Artificial Intelligence |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
Introduction -- Part 1:Background and Methodology -- Discrete Consensus Achievement in Artificial Systems -- Modular Design of Strategies for the Best-of-n Problem -- Part 2:Mathematical Modeling and Analysis -- Indirect Modulation of Majority-Based Decisions -- Direct Modulation of Voter-Based Decisions -- Direct Modulation of Majority-Based Decisions -- Part 3:Robot Experiments -- A Robot Experiment in Site Selection -- A Robot Experiment in Collective Perception -- Part 4:Discussion and Annexes -- Conclusions -- Background on Markov Chains. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book focuses on the design and analysis of collective decision-making strategies for the best-of-n problem. After providing a formalization of the structure of the best-of-n problem supported by a comprehensive survey of the swarm robotics literature, it introduces the functioning of a collective decision-making strategy and identifies a set of mechanisms that are essential for a strategy to solve the best-of-n problem. The best-of-n problem is an abstraction that captures |
|
|
|
|