相关论文: Continuous-time quantized consensus: convergence o…
We study synchronization for linearly coupled temporal networks of heterogeneous time-dependent nonlinear agents via the convergence of attracting trajectories of each node. The results are obtained by constructing and studying the…
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we…
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates.…
This paper investigates the problem of securing exponentially fast consensus (exponential consensus for short) for identical agents with finite-dimensional linear system dynamics over dynamic network topology. Our aim is to find the weakest…
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…
This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed…
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and controllability of…
This paper is devoted to distributed continuous-time and discrete-time optimization problems with nonuniform convex constraint sets and nonuniform stepsizes for general differentiable convex objective functions. The communication graphs are…
This paper is concerned with the study of continuous-time, non-smooth dynamical systems which arise in the context of time-varying non-convex optimization problems, as for example the feedback-based optimization of power systems. We…
Stability and stabilization for linear state feedback control systems in the presence of sensor quantization are studied. As the closed-loop system is described by a discontinuous right-hand side differential equation, Krasovskii solutions…
We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication…
A distributed adaptive control strategy is developed for heterogeneous multiagent systems in nonlinear Brunovsky form with \({\pd}\)-dimensional $n^{\text{th}}$-order dynamics, operating under time-triggered switching communication…
The stochastic Kuramoto model defined on a sequence of graphs is analyzed: the emphasis is posed on the relationship between the mean field limit, the connectivity of the underlying graph and the long time behavior. We give an explicit…
In many settings it is appropriate to treat the evolution of pairwise interactions over continuous time. We show that new Katz-style centrality measures can be derived in this context via solutions to a nonautonomous ODE driven by the…
The event-triggered consensus problem of first-order multi-agent systems under directed topology is investigated. The event judgements are only implemented at periodic time instants. Under the designed consensus algorithm, the sampling…
In this paper, the fast consensus problem of high-order multi-agent systems under undirected topologies is considered. The direct link between the consensus convergence rate and the control gains is established. An accelerated consensus…
Coordinating multiple autonomous agents to reach a target region while avoiding collisions and maintaining communication connectivity is a core problem in multi-agent systems. In practice, agents have a limited communication range. Thus,…
The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by B\'en\'ezit et al.. In the initial setting, each node in the network has one of two possible states ("yes" or…
Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions…
Distributed optimization finds applications in large-scale machine learning, data processing and classification over multi-agent networks. In real-world scenarios, the communication network of agents may encounter latency that may affect…