arXiv · 1010.4999
On the Stability of Swarm Consensus Under Noisy Control
Abstract
Representation of a swarm of independent robotic agents under graph-theoretic constructs allows for more formal analysis of convergence properties. We consider the local and global convergence behavior of an N-member swarm of agents in a modified consensus problem wherein the connectivity of agents is governed by probabilistic functions. The addition of a random walk control ensures Lyapunov stability of the swarm consensus. Simulation results are given and planned experiments are described.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gregory K. Fricke, Bruce W. Rogers, Devendra P. Garg. 2010-10-24. On the Stability of Swarm Consensus Under Noisy Control. https://arxiv.org/abs/1010.4999
Cite the original work for its findings. Save a collection to share your selection of sources.