首页> 外文会议> >A globally convergent numerical algorithm for computing the centre of mass on compact Lie groups
【24h】

A globally convergent numerical algorithm for computing the centre of mass on compact Lie groups

机译:紧凑李群上重心计算的全局收敛数值算法

获取原文

摘要

Motivated by applications in fuzzy control, robotics and vision, this paper considers the problem of computing the centre of mass (precisely, the Karcher mean) of a set of points defined on a compact Lie group, such as the special orthogonal group consisting of all orthogonal matrices with unit determinant. An iterative algorithm, whose derivation is based on the geometry of the problem, is proposed. It is proved to be globally convergent. Interestingly, the proof starts by showing the algorithm is actually a Riemannian gradient descent algorithm with fixed step size.
机译:受模糊控制,机器人技术和视觉应用的启发,本文考虑了计算在紧凑的李群上定义的一组点的质心(精确地为Karcher均值)的问题,例如由所有行列式的正交矩阵。提出了一种迭代算法,其推导基于问题的几何形状。它被证明是全球收敛的。有趣的是,从证明该算法实际上是步长固定的黎曼梯度下降算法开始。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号