Second-Order Agents on Ring Digraphs
| Autor: | Parsegov, Sergei, Chebotarev, Pavel |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Proceedings of the 22nd International Conference on System Theory, Control, and Computing (ICSTCC 2018, Sinaia, Romania). Sinaia, Romania: IEEE, 2018. P. 609-614 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1109/ICSTCC.2018.8540656 |
| Popis: | The paper addresses the problem of consensus seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network. Comment: 6 pages, 10 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|