A geometric approach to collective motion

Authors:
Bernard Chazelle
Affiliations:
Princeton University, Princeton, NJ, USA
Venue:
Proceedings of the twenty-sixth annual symposium on Computational geometry
Year:
2010

Citing 8
Cited 1

Fundamental problems of algorithmic algebra

Fundamental problems of algorithmic algebra
From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators

Physica D
Lectures on Discrete Geometry

Lectures on Discrete Geometry
Natural algorithms

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Convergence Speed in Distributed Consensus and Averaging

SIAM Journal on Control and Optimization
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
A convergence result for multiagent systems subject to noise

ACC'09 Proceedings of the 2009 conference on American Control Conference
The geometry of flocking

Proceedings of the twenty-sixth annual symposium on Computational geometry

The geometry of flocking

Proceedings of the twenty-sixth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the total s-energy of a multiagent system and bound its maximum asymptotic value. This gives us a new analytical device to study the convergence rate of bidirectional agreement dynamics. We use it to bound the convergence rate of dynamical systems for synchronization, flocking, opinion dynamics, and social epistemology.