arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.17885math.OC
收藏

通过Wasserstein哈密顿流实现移动介质中的多智能体路径规划

Multi-agent path-planning in a moving medium via Wasserstein Hamiltonian Flow

New Jersey Institute of Technology(新泽理工学院);Georgia Institute of Technology(佐治亚理工学院)

Christina Frederick, Haomin Zhou

AI总结:

本文提出了一种基于Wasserstein哈密顿流的有限维变分模型,用于在移动介质中实现多智能体路径规划,通过优化运行成本和初始速度来解决智能体位置与目标分布的不匹配问题。

摘要:

本文提出了一种有限维变分模型,用于多智能体路径规划,其中一组智能体从初始位置移动到目标分布。该模型基于基于智能体的Wasserstein哈密顿流公式,该公式在运输概率分布的同时优化运行成本。目标是智能体最终位置与目标分布之间的不匹配。约束是一组哈密顿方程,提供了智能体的轨迹。优化定义的自由变量形成一个有限向量,即智能体的初始速度。该模型通过L-BFGS方法结合射击策略进行数值求解。几个模拟示例,包括时间依赖的移动介质,展示了该模型的性能。

英文摘要:

We present a finite dimensional variational model for multi-agent path-planning in which a group of agents traverses from initial positions to a target distribution in a moving medium. The model is derived using the agent-based formulation of the Wasserstein Hamiltonian flows that transport between probability distributions while optimizing a running cost. The objective is the mismatch between their final positions and the target distribution. The constraints are a system of Hamiltonian equations that provide the trajectories of the agents. The free variables on which the optimization is defined form a finite vector of the initial velocities for the agents. The model is solved numerically by the L-BFGS method in conjunction with a shooting strategy. Several simulation examples, including a time-dependent moving medium, are presented to illustrate the performance of the model.

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

↑