Title: From undirected graphs to directed graphs: a new technique makes it possible for multi-agent systems
Abstract: This communique introduces a simple technique, which enables the Laplacian-like matrix of a directed graph to be diagonalisable. Thus many results on multi-agent systems over undirected graphs can be extended to directed graphs. As an example, we show how to make this extension of a popular Automatica paper.
Publication Year: 2021
Publication Date: 2021-08-17
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot