arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.15942math.OCcs.SYeess.SY
收藏

具有Gromov-Wasserstein终端代价的线性系统最小能量密度引导

Minimum energy density steering of linear systems with Gromov-Wasserstein terminal cost

Kohei Morimoto, Kenji Kashima

AI总结:

本文针对离散时间线性高斯系统,提出以Gromov-Wasserstein距离作为终端代价的最优密度控制问题,利用其对平移和旋转不变的性质,将问题转化为凸差规划并用DC算法求解,从而以最小能量实现期望的终端分布形状。

摘要:

本文新提出并求解了离散时间线性高斯系统中带有Gromov-Wasserstein(GW)终端代价的最优密度控制问题。与现有工作中采用的Wasserstein距离或Kullback-Leibler距离不同,GW距离度量分布形状的差异,并且对平移和旋转具有不变性。因此,我们的公式化方法能够找到实现期望终端分布形状的小能量输入,这在例如机器人集群等场景中具有实际应用价值。我们证明该问题可以归结为凸差(DC)规划,并且可以通过DC算法高效求解。通过数值实验,我们确认状态分布能够到达在具有指定形状的分布中以最小控制能量实现的终端分布。

英文摘要:

In this paper, we newly formulate and solve the optimal density control problem with Gromov-Wasserstein (GW) terminal cost in discrete-time linear Gaussian systems. Differently from the Wasserstein or Kullback-Leibler distances employed in the existing works, the GW distance quantifies the difference in shapes of the distribution, which is invariant under translation and rotation. Consequently, our formulation allows us to find small energy inputs that achieve the desired shape of the terminal distribution, which has practical applications, e.g., robotic swarms. We demonstrate that the problem can be reduced to a Difference of Convex (DC) programming, which is efficiently solvable through the DC algorithm. Through numerical experiments, we confirm that the state distribution reaches the terminal distribution that can be realized with the minimum control energy among those having the specified shape.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑