Achieving consensus in robot swarms. Design and analysis of strategies for the best-of-\(n\) problem
From MaRDI portal
Publication:1681307
DOI10.1007/978-3-319-53609-5zbMath1375.68009OpenAlexW2588573125MaRDI QIDQ1681307
Publication date: 23 November 2017
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53609-5
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)
Related Items (4)
Cucker-Smale model with finite speed of information propagation: well-posedness, flocking and mean-field limit ⋮ Asymptotic behavior of the linear consensus model with delay and anticipation ⋮ Optimal design for manipulation of random consensus over discrete information in networked systems ⋮ Well posedness and asymptotic consensus in the Hegselmann-Krause model with finite speed of information propagation
This page was built for publication: Achieving consensus in robot swarms. Design and analysis of strategies for the best-of-\(n\) problem
