Finite‐Time Scaled Consensus in Discrete‐Time Networks of Agents | Zendy

Shang Yilun | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Finite‐Time Scaled Consensus in Discrete‐Time Networks of Agents

Author(s) -

Shang Yilun

Publication year - 2018

Publication title -

asian journal of control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.769

H-Index - 53

eISSN - 1934-6093

pISSN - 1561-8625

DOI - 10.1002/asjc.1727

Subject(s) - consensus , topology (electrical circuits) , discrete time and continuous time , state (computer science) , computer science , consensus algorithm , network topology , control theory (sociology) , mathematics , mathematical optimization , algorithm , multi agent system , control (management) , computer network , artificial intelligence , combinatorics , statistics

This brief paper deals with finite‐time scaled consensus to assigned portions using linear iterations. If the network topology is modeled by a connected bidirectional network, we show that scaled consensus can always be reached in a finite time using state‐transition matrices consistent with the network structure. The final scaled consensus states are also identified. A numerical example is given to illustrate the theoretical result.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research