Abstract
This paper investigates the relation between graph signal processing and consensus of multi-agent systems. The graph signal processing is a technique to process graph signals, that is, signals whose values are on the vertices of graphs and whose structures are specified by the edges. By considering the combination of the states of agents and the graph describing the network structure between them as a graph signal, we show that the multi-agent consensus corresponds to low-pass filtering of the graph signal. This reveals a connection between the two distinct areas, i.e., the graph signal processing and the control of multi-agent systems. In addition, we provide a design method of consensus controllers based on the graph signal processing. In the proposed method, the controllers of agents are designed so that the spatial frequency of the states of the agents becomes a desired one. This enables us to construct controllers of multi-agent systems in the spatial frequency domain.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.