Mathematics – Optimization and Control
Scientific paper
2008-11-26
Mathematics
Optimization and Control
Preprint submitted to SIAM/SICON September 2006; revised November 2007; accepted for publication April 2008; publication date
Scientific paper
The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e. maximizing the consensus) or balance (i.e. minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO(n) and the Grassmann manifold Gr(p,n) are treated as original examples. A link is also drawn with the many existing results on the circle.
Sarlette Alain
Sepulchre Rodolphe
No associations
LandOfFree
Consensus optimization on manifolds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Consensus optimization on manifolds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consensus optimization on manifolds will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-274365