Second-Order Agents on Ring Digraphs
Multiagent Systems
2018-12-04 v1 Systems and Control
Optimization and Control
Abstract
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.
Cite
@article{arxiv.1811.09306,
title = {Second-Order Agents on Ring Digraphs},
author = {Sergei Parsegov and Pavel Chebotarev},
journal= {arXiv preprint arXiv:1811.09306},
year = {2018}
}
Comments
6 pages, 10 figures