pith. sign in

arxiv: 1011.6171 · v1 · pith:2YOYGIFRnew · submitted 2010-11-29 · 🧮 math.OC

Synchronization with partial state coupling on SO(n)

classification 🧮 math.OC
keywords agentsreferencestatessynchronizationcoupledcouplingfixedinformation
0
0 comments X
read the original abstract

This paper studies autonomous synchronization of k agents whose states evolve on SO(n), but which are only coupled through the action of their states on one "reference vector" in Rn for each link. Thus each link conveys only partial state information at each time, and to reach synchronization agents must combine this information over time or throughout the network. A natural gradient coupling law for synchronization is proposed. Extensive convergence analysis of the coupled agents is provided, both for fixed and time-varying reference vectors. The case of SO(3) with fixed reference vectors is discussed in more detail. For comparison, we also treat the equivalent setting in Rn, i.e. with states in Rn and connected agents comparing scalar product of their states with a reference vector.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.