.png){kind=icon}
.png){kind=icon}
Return
Designing Distributed Specified-Time Consensus Protocols for Linear Multiagent Systems Over Directed Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2018.2872534.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Directed spanning tree
distributed protocol
linear multiagent system
specified-time consensus
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
View more organizations