Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs | Zendy

Yu Zhao | Zendy; Yongfang Liu | Zendy; Guanghui Wen | Zendy; Wei Ren | Zendy; Guanrong Chen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs

Author(s) -

Yu Zhao,

Yongfang Liu,

Guanghui Wen,

Wei Ren,

Guanrong Chen

Publication year - 2019

Publication title -

ieee transactions on automatic control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.436

H-Index - 294

eISSN - 1558-2523

pISSN - 0018-9286

DOI - 10.1109/tac.2018.2872534

Subject(s) - multi agent system , consensus , computer science , protocol (science) , distributed computing , class (philosophy) , directed graph , theoretical computer science , algorithm , artificial intelligence , medicine , alternative medicine , pathology

This technical note addresses the distributed specified-time consensus protocol design problem for multiagent systems with general linear dynamics over directed graphs. By using motion planning approaches, a novel class of distributed consensus protocols are developed. With a prespecified settling time, the proposed protocols solve the consensus problem of linear multiagent systems over directed graphs containing a directed spanning tree. In particular, the settling time can be offline prespecified, according to task requirements. Compared with the existing results for multiagent systems, to our best knowledge, this is the first time specified-time consensus problems are raised and solved for general linear multiagent systems over directed graphs. Extensions to the specified-time formation flying are further studied for multiple satellites described by Hill equations.

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