Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Perfectly Controllable Multi-Agent Networks (1807.00479v1)

Published 2 Jul 2018 in cs.SY and cs.MA

Abstract: This note investigates how to design topology structures to ensure the controllability of multi-agent networks (MASs) under any selection of leaders. We put forward a concept of perfect controllability, which means that a multi-agent system is controllable with no matter how the leaders are chosen. In this situation, both the number and the locations of leader agents are arbitrary. A necessary and sufficient condition is derived for the perfect controllability. Moreover, a step-by-step design procedure is proposed by which topologies are constructed and are proved to be perfectly controllable. The principle of the proposed design method is interpreted by schematic diagrams along with the corresponding topology structures from simple to complex. We show that the results are valid for any number and any location of leaders. Both the construction process and the corresponding topology structures are clearly outlined.

Citations (2)

Summary

We haven't generated a summary for this paper yet.