Almost sure consensus for multi-agent systems with two level switching

In most literatures on the consensus of multi-agent systems (MASs), the agents considered are time-invariant. However in many cases, for example in airplane formation, the agents have switching dynamics and the connections between them are also changing. This is called two-level switching in this paper. We study almost sure (AS) consensus for a class of two-level switching systems. At the low level of agent dynamics, switching is determin- istic and controllable. The upper level topology switching is random and follows a Markov chain. The transition probability of the Markov chain is not fixed, but varies when low level dynamics changes. For this class of MASs, a sufficient condition for AS consensus is developed in this paper

On Endogenous Random Consensus and Averaging Dynamics

Motivated by various random variations of Hegselmann-Krause model for opinion dynamics and gossip algorithm in an endogenously changing environment, we propose a general framework for the study of endogenously varying random averaging dynamics, i.e.\ an averaging dynamics whose evolution suffers from history dependent sources of randomness. We show that under general assumptions on the averaging dynamics, such dynamics is convergent almost surely. We also determine the limiting behavior of such dynamics and show such dynamics admit infinitely many time-varying Lyapunov functions

Consensus reaching in swarms ruled by a hybrid metric-topological distance

Recent empirical observations of three-dimensional bird flocks and human crowds have challenged the long-prevailing assumption that a metric interaction distance rules swarming behaviors. In some cases, individual agents are found to be engaged in local information exchanges with a fixed number of neighbors, i.e. a topological interaction. However, complex system dynamics based on pure metric or pure topological distances both face physical inconsistencies in low and high density situations. Here, we propose a hybrid metric-topological interaction distance overcoming these issues and enabling a real-life implementation in artificial robotic swarms. We use network- and graph-theoretic approaches combined with a dynamical model of locally interacting self-propelled particles to study the consensus reaching pro- cess for a swarm ruled by this hybrid interaction distance. Specifically, we establish exactly the probability of reaching consensus in the absence of noise. In addition, simulations of swarms of self-propelled particles are carried out to assess the influence of the hybrid distance and noise

Safety Barrier Certificates for Heterogeneous Multi-Robot Systems

This paper presents a formal framework for collision avoidance in multi-robot systems, wherein an existing controller is modified in a minimally invasive fashion to ensure safety. We build this framework through the use of control barrier functions (CBFs) which guarantee forward invariance of a safe set; these yield safety barrier certificates in the context of heterogeneous robot dynamics subject to acceleration bounds. Moreover, safety barrier certificates are extended to a distributed control framework, wherein neighboring agent dynamics are unknown, through local parameter identification. The end result is an optimization-based controller that formally guarantees collision free behavior in heterogeneous multi-agent systems by minimally modifying the desired controller via safety barrier constraints. This formal result is verified in simulation on a multi-robot system consisting of both cumbersome and agile robots, is demonstrated experimentally on a system with a Magellan Pro robot and three Khepera III robots.Comment: 8 pages version of 2016ACC conference paper, experimental results adde

Distributed Linear Parameter Estimation: Asymptotically Efficient Adaptive Strategies

The paper considers the problem of distributed adaptive linear parameter estimation in multi-agent inference networks. Local sensing model information is only partially available at the agents and inter-agent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which the agents adaptively assess their relative observation quality over time and fuse the innovations accordingly. Under rather weak assumptions on the statistical model and the inter-agent communication, it is shown that, by properly tuning the consensus potential with respect to the innovation potential, the asymptotic information rate loss incurred in the learning process may be made negligible. As such, it is shown that the agent estimates are asymptotically efficient, in that their asymptotic covariance coincides with that of a centralized estimator (the inverse of the centralized Fisher information rate for Gaussian systems) with perfect global model information and having access to all observations at all times. The proof techniques are mainly based on convergence arguments for non-Markovian mixed time scale stochastic approximation procedures. Several approximation results developed in the process are of independent interest.Comment: Submitted to SIAM Journal on Control and Optimization journal. Initial Submission: Sept. 2011. Revised: Aug. 201