Consensus of Hybrid Multi-Agent Systems

Zheng, Yufan; Ma, Jingying; Wang, Long

doi:10.1109/tnnls.2017.2651402

Cited by 335 publications

(173 citation statements)

References 38 publications

Supporting

Mentioning

169

Contrasting

Unclassified

Order By: Relevance

“…Remark 2. Through the above three-step progressive model conversion techniques (4), (7), and (10), the high-order system under the asynchronous setting is equivalently converted into an augmented system (11). In this way, the high-order asynchronous scaled consensus problem is equivalently transformed into a consensus problem of the augmented system with row-stochastic coefficient matrices.…”

Section: Model Transformationsmentioning

confidence: 99%

“…In order to realize consensus, a suitable distributed control protocol needs to be designed to ensure that all agents converge to a common point or state value asymptotically over time. Based on matrix theory, graph theory, Lyapunov functions, and other effective tools, the consensus problems for a team of agents with first‐order or second‐order dynamics have been deeply studied in the literature …”

Section: Introductionmentioning

confidence: 99%

“…Based on matrix theory, graph theory, Lyapunov functions, and other effective tools, the consensus problems for a team of agents with first-order or second-order dynamics have been deeply studied in the literature. [7][8][9][10][11][12][13] Recently, many new consensus problems have emerged, such as group consensus [14][15][16][17][18] and scaled consensus, [19][20][21][22][23] etc. In the problem of scaled consensus, which was proposed by Roy, 19 each agent has a unique scale that is independent of other agents'.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Cheng

Zhou

Bai

et al. 2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper investigates the distributed scaled consensus problem of multiple agents with high‐order dynamics under the asynchronous setting, where each agent measures the neighbors' information at certain discrete time instants according to its own clock rather than the whole discrete process and all agents' clocks are independent of each other. Assume that the communication topology can be arbitrarily switched and the information transfer between agents has a time‐varying delay. Under the designed asynchronous distributed control protocol, it is shown that the agents with the same scale will reach a common final state, while the agents with different scales will reach different final states. Moreover, an effective parameters selection strategy is presented for a large number of gain parameters in high‐order multiagent systems based on novel model transformation techniques. Simulation examples are provided to demonstrate the high‐order scaled consensus performances for the agents in the presence of asynchronous setting.

show abstract

Section: Model Transformationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Cheng

Zhou

Bai

et al. 2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

show abstract

“…Applications of such systems arise in various fields including cyber‐physical systems, multicell wireless data networks, power grid, among others. Along with this fact, consensus problems of hybrid multiagent systems, in which continuous‐time dynamic agents (CT‐agents) and discrete‐time agents (DT‐agents) coexist, were explored in the works of Zheng et al Inspired by Zheng et al, this paper intends to propose a new consensus protocol for hybrid multiagent systems, which contain two groups of agents: a group of CT‐agents and a group of DT‐agents. Different from the works of Zheng et al, a game‐theoretic model is adopted in this paper to describe the interactions among the agents in distinct groups.…”

Section: Introductionmentioning

confidence: 99%

Consensus analysis of hybrid multiagent systems: A game‐theoretic approach

Zheng

et al. 2019

Intl J Robust & Nonlinear

Self Cite

View full text Add to dashboard Cite

Summary This paper considers a consensus problem for hybrid multiagent systems, which comprise two groups of agents: a group of continuous‐time dynamic agents and a group of discrete‐time dynamic agents. Firstly, a game‐theoretic approach is adopted to model the interactions between the two groups of agents. To achieve consensus for the considered hybrid multiagent systems, the cost functions are designed. Moreover, it is shown that the designed game admits a unique Nash equilibrium. Secondly, sufficient/necessary conditions of solving consensus are established. Thirdly, we find that the convergence speed of the system depends on the game. By the mechanism design of the game, the convergence speed is increased. Finally, simulation examples are given to validate the effectiveness of the theoretical results.

show abstract

“…Different from leaderless consensus, states of all followers track the state of the leader when leader-following consensus is achieved. Zheng et al [11] addressed the Manuscript received September 29, 2017; revised January 11, 2018; accepted February 6, 2018.…”

Section: Introductionmentioning

confidence: 99%

Guaranteed‐Performance Consensualization for High‐Order Lipschitz Nonlinear Multi‐Agent Systems with Balanced Directed Switching Topologies

Tang

Zhang

et al. 2018

Asian Journal of Control

View full text Add to dashboard Cite

Guaranteed-performance consensus design problems for both the leaderless and leader-following high-order multi-agent systems with balanced directed switching topologies and Lipschitz nonlinear dynamics are investigated. Consensus protocols and quadratic performance functions based on state errors are proposed to obtain the guaranteed-performance consensus. By a state decomposition method, the consensualization problems for leaderless cases are transformed into asymptotic stability ones of a reduced-order subsystem and the guaranteed-performance cost is determined by the Lyapunov stability analysis of the reduced-order subsystem, and the state error method is utilized to deal with the guaranteed-performance consensualization problems for leader-following cases. Then, by using the structure property of the transformation matrix and the Lipschitz condition, the impacts of Lipschitz nonlinear terms can be determined. Moreover, guaranteed-performance consensualization criteria are presented based on linear matrix inequalities for both leaderless and leader-following cases with directed switching topologies. Furthermore, the guaranteed-performance costs are determined, which can respectively reflect the structures of the interaction topologies of leaderless and leader-following cases. Finally, two numerical simulations are presented to verify the validity of theoretical results.

show abstract

Consensus of Hybrid Multi-Agent Systems

Cited by 335 publications

References 38 publications

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Consensus analysis of hybrid multiagent systems: A game‐theoretic approach

Guaranteed‐Performance Consensualization for High‐Order Lipschitz Nonlinear Multi‐Agent Systems with Balanced Directed Switching Topologies

Contact Info

Product

Resources

About