Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.automatica.2017.02.025 | Automatica |
Keywords | DocType | Volume |
Multi-agent systems,Distributed optimization,Sensor networks,Consensus algorithms,Robust estimation,Measurement and instrumentation | Journal | 80 |
Issue | ISSN | Citations |
1 | 0005-1098 | 2 |
PageRank | References | Authors |
0.37 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johan Thunberg | 1 | 138 | 19.15 |
| Florian Bernard | 2 | 2 | 0.37 |
| Goncalves, J. | 3 | 404 | 42.24 |