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

通过最优传输实现概率空间中的动态规划

Dynamic Programming in Probability Spaces via Optimal Transport

Antonio Terpin, Nicolas Lanzetti, Florian Dörfler

AI总结:

本文研究状态为概率测度的离散时间有限时域最优控制问题,证明其动态规划解可分解为基础空间动态规划与最优传输问题,并据此提出多智能体车队的低层与车队层级控制分离原理。

摘要:

我们研究概率空间中的离散时间有限时域最优控制问题,其中系统的状态是一个概率测度。我们表明,在许多情形下,概率空间中动态规划的解来自两个组成部分:(i)“基础空间”(即概率测度所栖居的空间)中动态规划的解,以及(ii)一个最优传输问题的解。从多智能体控制的视角来看,存在一条分离原理:“车队智能体的低层控制”(一个人如何到达目的地?)与“车队层级控制”(谁去往何处?)被解耦。

英文摘要:

We study discrete-time finite-horizon optimal control problems in probability spaces, whereby the state of the system is a probability measure. We show that, in many instances, the solution of dynamic programming in probability spaces results from two ingredients: (i) the solution of dynamic programming in the "ground space" (i.e., the space on which the probability measures live) and (ii) the solution of an optimal transport problem. From a multi-agent control perspective, a separation principle holds: The "low-level control of the agents of the fleet" (how does one reach the destination?) and "fleet-level control" (who goes where?) are decoupled.

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

↑