Abstract
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, it is the first time to raise and solve 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.
| Original language | English |
|---|---|
| Pages (from-to) | 2945-2952 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 64 |
| Issue number | 7 |
| Online published | 1 Oct 2018 |
| DOIs | |
| Publication status | Published - Jul 2019 |
Research Keywords
- Directed spanning tree
- distributed protocol
- linear multi-agent system
- specified-time consensus
ESI Highly Cited Papers
- Highly Cited Paper 2020
- Highly Cited Paper 2021
- Highly Cited Paper 2024
- Highly Cited Paper 2022
- Highly Cited Paper 2023
ESI Hot Papers
- Hot Paper 2020
Fingerprint
Dive into the research topics of 'Designing Distributed Specified-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver