Information Topology-independent Consensus Criteria for Second-order Systems under Directed Graph
| Autor: | Xibin Cao, Hai-Bo Guo, Shijie Zhang |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Theoretical computer science
business.industry Materials Science (miscellaneous) Topology (electrical circuits) Directed graph Directed acyclic graph General Business Management and Accounting Feedback arc set Industrial and Manufacturing Engineering Uniform consensus Robustness (computer science) Convergence (routing) Artificial intelligence Business and International Management General Agricultural and Biological Sciences business Mathematics Moral graph |
| Zdroj: | Acta Automatica Sinica. 39:995-1002 |
| ISSN: | 1874-1029 |
| DOI: | 10.1016/s1874-1029(13)60064-6 |
| Popis: | In this paper, consensus seeking of second-order systems without leaders is investigated under possibly switching directed graphs. Two consensus algorithms using different cooperative schemes are proposed and some information topology-independent criteria are obtained. For the first one, an eigenvalue-based analysis is taken to attain a sufficient and necessary condition for consensus seeking under fixed directed graph. For the second one, consensus can be achieved as long as the union of the switching graphs has a directed spanning tree frequently enough. Convergence analysis is presented, which is facilitated by an equivalent model transformation into a cascaded system. A novel sufficient and necessary condition for consensus seeking under switching undirected graph is also obtained using the same strategy. Moreover, robustness of both the algorithms to time-delays is studied under fixed directed graph. Illustrative examples are also provided to show the effectiveness of the theoretical results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|