Related papers: A necessary and sufficient condition for discrete-…
A generic feature of bounded confidence type models is the formation of clusters of agents. We propose and study a variant of bounded confidence dynamics with the goal of inducing unconditional convergence to a consensus. The defining…
In this paper, we consider the consensus problem of switched multi-agent system composed of continuous-time and discrete-time subsystems. By combining the classical consensus protocols of continuous-time and discrete-time multi-agent…
We consider discrete-time distributed averaging algorithms over multi-agent networks with measurement noises and time-varying random graph flows. Each agent updates its state by relative states between neighbours with both additive and…
In this paper, we propose an approximate projected consensus algorithm for a network to cooperatively compute the intersection of convex sets. Instead of assuming the exact convex projection proposed in the literature, we allow each node to…
This paper addresses the global consensus problems of a class of nonlinear multi-agent systems with Lipschitz nonlinearity and directed communication graphs, by using a distributed consensus protocol based on the relative states of…
In this paper, we study the robust consensus problem for a set of discrete-time linear agents to coordinate over an uncertain communication network, which is to achieve consensus against the transmission errors and noises resulted from the…
Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in…
In this paper, for any homogeneous system of agents with linear continuous time dynamics, we formulate an optimal control problem. In this problem a convex cost functional of the control signals of the agents shall be minimized, while the…
A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…
A semi-linear parabolic problem is considered in a thin $3D$ star-shaped junction that consists of several thin curvilinear cylinders that are joined through a domain (node) of diameter $\mathcal{O}(\varepsilon).$ The purpose is to study…
In this paper, we consider multiple mobile agents moving in Euclidean space with point mass dynamics. Using a coordination control scheme, we can make the group generate stable flocking motion. The control laws are a combination of…
Many mathematical models of interacting agents assume that individual interactions scale down in proportion to the network size, ensuring that the combined input received from the network does not diverge. In theoretical neuroscience,…
Suppose that an equilibrium is asymptotically stable when external inputs vanish. Then, every bounded trajectory which corresponds to a control which approaches zero and which lies in the domain of attraction of the unforced system, must…
A sufficient condition for the stability of a system resulting from the interconnection of dynamical systems is given by the small gain theorem. Roughly speaking, to apply this theorem, it is required that the gains composition is…
We give a complete study of the asymptotic behavior of a simple model of alignment of unit vectors, both at the level of particles , which corresponds to a system of coupled differential equations, and at the continuum level, under the form…
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…
This paper studies consensus of discrete-time multi-agent systems under time-varying directed communication, state and input constraints using a distributed multi-step model predictive control (MPC) framework. Consensus is recast as…
This papers studies multi-agent (convex and \emph{nonconvex}) optimization over static digraphs. We propose a general distributed \emph{asynchronous} algorithmic framework whereby i) agents can update their local variables as well as…
This paper considers the leader-follower control problem for a linear multi-agent system with directed communication topology and linear nonidentical uncertain coupling subject to integral quadratic constraints (IQCs). A consensus-type…
This paper investigates asymptotic fixed point results for nonlinear contractions, with emphasis on Kirk-type theorems and their generalizations. A central difficulty in the literature has been the requirement that the mapping possesses a…