arXiv · 0909.3475
Multi-agent Coordination in Directed Moving Neighborhood Random Networks
Abstract
In this paper, we consider the consensus problem of dynamical multiple agents that communicate via a directed moving neighborhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Some existed consensus schemes are shown to be reduced versions of the current model.
Explore related subjects
Keep this discovery
Yilun Shang. 2009-09-18. Multi-agent Coordination in Directed Moving Neighborhood Random Networks. https://doi.org/10.1088/1674-1056/19/7/070201
Cite the original work for its findings. Save a collection to share your selection of sources.