Equidistant arrangement of agents on line: Analysis of the algorithm and its generalization

Ya I. Kvinto, S. E. Parsegov

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

Consideration was given to generalization of one of the formation control algorithms, that of equidistant arrangement of agents over a fixed interval. In distinction to the earlier approaches that are based on the equations of the first order, a second-order algorithm was proposed. It was proved to be stable and with proper selection of the adjusted parameter able to provide a higher rate of convergence in comparison with its first-order counterparts. Relation was demonstrated between the problem of arrangement over an interval and the classical problem of consensus. Examples of the results of modeling were presented.

Original languageEnglish
Pages (from-to)1784-1793
Number of pages10
JournalAutomation and Remote Control
Volume73
Issue number11
DOIs
Publication statusPublished - Nov 2012
Externally publishedYes

Cite this