A Lifting method for analyzing distributed synchronization on the unit sphere

05/07/2018
by   Johan Thunberg, et al.
0

This paper introduces a new lifting method for analyzing convergence of continuous-time distributed synchronization/consensus systems on the unit sphere. Points on the d-dimensional unit sphere are lifted to the (d+1)-dimensional Euclidean space. The consensus protocol on the unit sphere is the classical one, where agents move toward weighted averages of their neighbors in their respective tangent planes. Only local and relative state information is used. The directed interaction graph topologies are allowed to switch as a function of time. The dynamics of the lifted variables are governed by a nonlinear consensus protocol for which the weights contain ratios of the norms of state variables. We generalize previous convergence results for hemispheres. For a large class of consensus protocols defined for switching uniformly quasi-strongly connected time-varying graphs, we show that the consensus manifold is uniformly asymptotically stable relative to closed balls contained in a hemisphere. Compared to earlier projection based approaches used in this context such as the gnomonic projection, which is defined for hemispheres only, the lifting method applies globally. With that, the hope is that this method can be useful for future investigations on global convergence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2018

Lifting method for analyzing distributed synchronization on the unit sphere

This paper introduces a new lifting method for analyzing convergence 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
01/02/2022

Algorithm-Level Confidentiality for Average Consensus on Time-Varying Directed Graphs

Average consensus plays a key role in distributed networks, with applica...
research
01/01/2020

Single-Bit Consensus with Finite-Time Convergence: Theory and Applications

In this brief paper, a new consensus protocol based on the sign of innov...
research
11/29/2020

FROCC: Fast Random projection-based One-Class Classification

We present Fast Random projection-based One-Class Classification (FROCC)...
research
09/07/2023

A cutting-surface consensus approach for distributed robust optimization of multi-agent systems

A novel and fully distributed optimization method is proposed for the di...
research
08/06/2023

Self-Directed Linear Classification

In online classification, a learner is presented with a sequence of exam...

Please sign up or login with your details

Forgot password? Click here to reset