This work addresses the synchronization/consensus problem of identical multi-agent system (MAS) where the agents' dynamics are linear and the communication network is arbitrarily switching among connected topologies. The approach uses a gain matrix of a special structure in a dynamic compensator for each agent. Under reasonable conditions, the approach ensures that consensus is reached when the gain is sufficiently large. This result holds for general linear systems including the case where agents have repeated unstable eigenvalues. The proposed controller structure can be seen as a special case of the existing MAS controller structures but offers consensus conditions that are simpler than existing results, especially for the case when the network is switching among connected graphs. The works shows its application to three communication settings: fixed graph, switching among undirected and connected graphs and switching among directed and connected graphs. An example is provided to illustrate the results.
Some of the issues associated with the practical applications of consensus of multi-agent systems (MAS) include switching topologies, attrition and inclusion of agents from an existing network, and model uncertainties of agents. In this paper, a single distributed dynamic state-feedback protocol referred to as the Robust Attrition-Inclusion Distributed Dynamic (RAIDD) consensus protocol, is synthesized for achieving the consensus of MAS with attrition and inclusion of linear time-invariant higher-order uncertain homogeneous agents and switching topologies. A state consensus problem termed as t…
This paper examines the cluster consensus problem of multi-agent systems on matrix-weighted switching networks. Necessary and/or sufficient conditions under which cluster consensus can be achieved are obtained and quantitative characterization of the steady-state of the cluster consensus are provided as well. Specifically, if the underlying network switches amongst finite number of networks, a necessary condition for cluster consensus of multi-agent system on switching matrix-weighted networks is firstly presented, it is shown that the steady-state of the system lies in the intersection of the…
Distributed Economic Dispatch Scheme of A BESS Network with A Switching Utility Grid in Energy Internet Paradigm via Reset Consensus Method
College of Electrical Engineering, Zhejiang University（浙江大学电气工程学院）；College of Artificial Intelligence, Nankai University（南开大学人工智能学院）；Hainan Institute, Zhejiang University（浙江大学海南研究院）
This paper investigates the distributed event-based consensus problem of switching networks satisfying the jointly connected condition. Both the state consensus of homogeneous linear networks and output consensus of heterogeneous networks are studied. Two kinds of event-based protocols based on local sampled information are designed, without the need to solve any matrix equation or inequality. Theoretical analysis indicates that the proposed event-based protocols guarantee the achievement of consensus and the exclusion of Zeno behaviors for jointly connected undirected switching graphs. These …
This paper addresses the robust consensus problem under switching topologies. Contrary to existing methods, the proposed approach provides decentralized protocols that achieve consensus for networked multi-agent systems in a predefined time. Namely, the protocol design provides a tuning parameter that allows setting the convergence time of the agents to a consensus state. An appropriate Lyapunov analysis exposes the capability of the current proposal to achieve predefined-time consensus over switching topologies despite the presence of bounded perturbations. Finally, the paper presents a compa…
The current paper deals with limited-budget output consensus for descriptor multiagent systems with two types of switching communication topologies; that is, switching connected ones and jointly connected ones. Firstly, a singular dynamic output feedback control protocol with switching communication topologies is proposed on the basis of the observable decomposition, where an energy constraint is involved and protocol states of neighboring agents are utilized to derive a new two-step design approach of gain matrices. Then, limited-budget output consensus problems are transformed into asymptoti…
Reaching a Consensus in Networks of High-Order Integral Agents under Switching Directed Topology
State Key Laboratory of Intelligent Control and Management of Complex Systems, Institute of Automation, Chinese Academy of Sciences（中国科学院自动化研究所复杂系统智能控制与管理国家重点实验室）
In this article, we present a finite time stopping criterion for consensus algorithms in networks with dynamic communication topology. Recent results provide asymptotic convergence to the consensus algorithm. However, the asymptotic convergence of these algorithms pose a challenge in the practical settings where the response from agents is required in finite time. To this end, we propose a Maximum-Minimum protocol which propagates the global maximum and minimum values of agent states (while running consensus algorithm) in the network. We establish that global maximum and minimum values are str…
Time-varying hierarchical multi-agent systems are common in many applications. A well-known solution to control these systems is to use state feedback controllers that depend on the adjacency matrix to reach consensus. This solution has been applied so far to multi-agent systems with fixed or time-varying communication topologies. In this paper, we consider single-integrator multi-agent systems where only a subset of the agents are active at any given time and the set of active agents is time-varying. This type of multi-agent system is relevant in applications such as modular multilevel conver…
In this paper, we study the leaderless consensus problem for multiple Lagrangian systems in the presence of parametric uncertainties and external disturbances under directed graphs. For achieving asymptotic behavior, a robust continuous term with adaptive varying gains is added to alleviate the effects of the external disturbances with unknown bounds. In the case of a fixed directed graph, by introducing an integrate term in the auxiliary variable design, the final consensus equilibrium can be explicitly derived. We show that the agents achieve weighted average consensus, where the final equil…
We propose predefined-time consensus-based cooperative guidance laws for a swarm of interceptors to simultaneously capture a target capable of executing various kinds of motions. Unlike leader-follower cooperative guidance techniques, the swarm of interceptors has no leader and each interceptor executes its own guidance command in a distributive fashion, thus obviating the residency of the mission over a single interceptor. We first design cooperative guidance commands subject to target's mobility, followed by the same when the target is stationary, and also account for interceptors' changing …
This paper aims at proposing a procedure to derive distributed algorithms for distributed consensus-based optimization by using distributed algorithms for network resource allocation and vice versa over switching networks with/without synchronous protocol. It is shown that first-order gradient distributed consensus-based optimization algorithms can be used for finding an optimal solution of distributed resource allocation with synchronous protocol under weaker assumptions than those given in the literature for non-switching (static) networks. It is shown that first-order gradient distributed r…
This paper examines the consensus problem on time-varying matrix-weighed undirected networks. First, we introduce the matrix-weighted integral network for the analysis of such networks. Under mild assumptions on the switching pattern of the time-varying network, necessary and/or sufficient conditions for which average consensus can be achieved are then provided in terms of the null space of matrix-valued Laplacian of the corresponding integral network. In particular, for periodic matrix-weighted time-varying networks, necessary and sufficient conditions for reaching average consensus is obtain…
This paper proposes a method of transferring physical continuous and switching/converter circuits working in continuous conduction mode (CCM) and discontinuous conduction mode (DCM) to graph representation, independent of the connection or the number of circuit components, so that machine learning (ML) algorithms and applications can be easily applied. Such methodology is generalized and is applicable to circuits with any number of switches, components, sources and loads, and can be useful in applications such as artificial intelligence (AI) based circuit design automation, layout optimization…
The topic of this paper is achieving finite-time max-consensus in a multi-agent system that communicates over a fading wireless channel and exploits its interference property. This phenomenon corrupts the desired information when data is transmitted synchronously. In fact, each transmitted signal is attenuated by an unknown and time-varying factor (fading coefficient), then, by interference, all such attenuated signals are summed up at a receiver. Rather than combatting interference, we design a communication system that exploits it. Our strategy yields a more efficient usage of wireless resou…
On Non-Consensus Motions of Dynamical Linear Multi-Agent Systems
Northwest University for Nationalities（西北民族大学）；Key Laboratory of National Language Intelligent Processing, Gansu Province（甘肃省国家语言智能处理重点实验室）；Huazhong University of Science and Technology（华中科技大学）；Hangzhou Dianzi University（杭州电子科技大学）
Research School of Engineering, College of Engineering and Computer Science, The Australian National University（澳大利亚国立大学工程与计算机科学学院工程学院）；National ICT Australia (NICTA)（国家ICT澳大利亚有限公司）；Institute of Mathematics, University of Würzburg（维尔茨堡大学数学研究所）
Achieving average consensus without disclosing sensitive information can be a critical concern for multi-agent coordination. This paper examines privacy-preserving average consensus (PPAC) for vector-valued multi-agent networks. In particular, a set of agents with vector-valued states aim to collaboratively reach an exact average consensus of their initial states, while each agent's initial state cannot be disclosed to other agents. We show that the vector-valued PPAC problem can be solved via associated matrix-weighted networks with the higher-dimensional agent state. Specifically, a novel di…
Laplacian dynamics on signed digraphs have a richer behavior than those on nonnegative digraphs. In particular, for the so-called "repelling" signed Laplacians, the marginal stability property (needed to achieve consensus) is not guaranteed a priori and, even when it holds, it does not automatically lead to consensus, as these signed Laplacians may loose rank even in strongly connected digraphs. Furthermore, in the time-varying case, instability can occur even when switching in a family of systems each of which corresponds to a marginally stable signed Laplacian with the correct corank. In thi…
This paper presents new classes of consensus protocols with fixed-time convergence, which enable the definition of an upper bound for consensus state as a parameter of the consensus protocol, ensuring its independence from the initial condition of the nodes. We demonstrate that our methodology subsumes current classes of fixed-time consensus protocols that are based on homogeneous in the bi-limit vector fields. Moreover, the proposed framework enables for the development of independent consensus protocols that are not needed to be homogeneous in the bi-limit. This proposal offers extra degrees…
Many algorithms have been proposed in prior literature to guarantee resilient multi-agent consensus in the presence of adversarial attacks or faults. The majority of prior work present excellent results that focus on discrete-time or discretized continuous-time systems. Fewer authors have explored applying similar resilient techniques to continuous-time systems without discretization. These prior works typically consider asymptotic convergence and make assumptions such as continuity of adversarial signals, the existence of a dwell time between switching instances for the system dynamics, or th…
Stability margins for linear time-varying (LTV) and switched-linear systems are traditionally computed via quadratic Lyapunov functions, and these functions certify the stability of the system under study. In this work, we show how the more general class of homogeneous polynomial Lyapunov functions is used to compute stability margins with reduced conservatism, and we show how these Lyapunov functions aid in the search for periodic trajectories for marginally stable LTV systems. Our work is premised on the recent observation that the search for a homogeneous polynomial Lyapunov function for so…
