Distributed methods for synchronization of orthogonal matrices over graphs

01/25/2017
by   Johan Thunberg, et al.
0

This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as a least-squares optimization problem with nonlinear constraints. The synchronization problem appears as one of the key components in applications ranging from 3D-localization to image registration. The main contributions of this work can be summarized as the introduction of two novel algorithms; one for symmetric graphs and one for graphs that are possibly asymmetric. Under general conditions, the former has guaranteed convergence to the solution of a spectral relaxation to the synchronization problem. The latter is stable for small step sizes when the graph is quasi-strongly connected. The proposed methods are verified in numerical simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2015

On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems

Transitive consistency is an intrinsic property for collections of linea...
research
04/07/2019

Global Synchronization of Clocks in Directed Rooted Acyclic Graphs: A Hybrid Systems Approach

In this paper, we study the problem of robust global synchronization of ...
research
08/11/2017

Dynamic controllers for column synchronization of rotation matrices: a QR-factorization approach

In the multi-agent systems setting, this paper addresses continuous-time...
research
02/11/2020

Schur decomposition of several matrices

Schur decompositions and the corresponding Schur forms of a single matri...
research
06/28/2022

Prescribed-Time Synchronization of Multiweighted and Directed Complex Networks

In this note, we study the prescribed-time (PT) synchronization of multi...
research
10/25/2021

Parallel Feedforward Compensation for Output Synchronization: Fully Distributed Control and Indefinite Laplacian

This work is associated with the use of parallel feedforward compensator...
research
02/22/2020

Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms

We investigate numerically efficient approximations of eigenspaces assoc...

Please sign up or login with your details

Forgot password? Click here to reset