Consensus Analysis of High-Order Multiagent Systems with General Topology and Asymmetric Time-Delays | Zendy

Fangcui Jiang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Consensus Analysis of High-Order Multiagent Systems with General Topology and Asymmetric Time-Delays

Author(s) -

Fangcui Jiang

Publication year - 2014

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2014/136205

Subject(s) - multi agent system , network topology , bounded function , computer science , order (exchange) , topology (electrical circuits) , consensus , uniform consensus , protocol (science) , lyapunov function , spanning tree , selection (genetic algorithm) , distributed computing , mathematical optimization , mathematics , computer network , discrete mathematics , artificial intelligence , nonlinear system , combinatorics , medicine , mathematical analysis , physics , alternative medicine , finance , pathology , quantum mechanics , economics

This paper focuses on the consensus problem for high-order multiagent systems (MAS) with directed network and asymmetric time-varying time-delays. It is proved that the high-order multiagent system can reach consensus when the network topology contains a spanning tree and time-delay is bounded. The main contribution of this paper is that a Lyapunov-like design framework for the explicit selection of protocol parameters is provided. The Lyapunov-like design guarantees the robust consensus of the high-order multiagent system with respect to asymmetric time-delays and is independent of the exact knowledge of the topology when the communication linkages among agents are undirected and connected

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research