Consensus problems for linear time-invariant multi-agent systems with saturation constraints
نویسندگان
چکیده
A class of networked multi-agent systems is studied in this study where each agent has an identical dynamics of a simple integrator and the topology of the connections is fixed. It is proved that, when there are saturation constraints, a general consensus protocol widely used in the literatures for this class of multi-agent systems remains valid. As an extension, a ‘bang-bang’ type of consensus protocol is proposed to achieve the finite-time consensus, which relaxes the previous undirected connection assumption.
منابع مشابه
Global consensus for discrete-time multi-agent systems with input saturation constraints
In this paper, we consider the global consensus problem for discrete-time multi-agent systems with input saturation constraints under fixed undirected topologies. We first give necessary conditions for achieving global consensus via a distributed protocol based on relative state measurements of the agent itself and its neighboring agents. We then focus on two special cases, where the agent mode...
متن کاملOutput Consensus Control of Nonlinear Non-minimum Phase Multi-agent Systems Using Output Redefinition Method
This paper concerns the problem of output consensus in nonlinear non-minimum phase systems. The main contribution of the paper is to guarantee achieving consensus in the presence of unstable zero dynamics. To achieve this goal, an output redefinition method is proposed. The new outputs of agents are functions of original outputs and internal states and defined such that the dynamics of agents a...
متن کاملOptimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics
In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...
متن کاملSemi-global Leaderless Consensus with Input Saturation Constraints via Adaptive Protocols
In this paper, the problems of semi-global leaderless consensus for continuous-time multi-agent systems under input saturation restraints are investigated. We consider the leaderless consensus problems under fixed undirected communication topology. New necessary synthesis conditions are established for achieving semi-global leaderless consensus via the distributed adaptive protocols, which is d...
متن کاملOn Non-Consensus Motions of Dynamical Linear Multi-Agent Systems
The non-consensus problems of high order linear time-invariant dynamical homogeneous multi-agent systems are concerned. Based on the conditions of consensus achievement, the mechanisms that lead to non-consensus motions are analyzed. Besides, a comprehensive classification for diverse types of non-consensus phases in accordance to the different conditions is conducted, which is jointly dependin...
متن کامل