aiqbench analysis
This paper introduces Control Laguerre Tessellation (CLT), a mathematical framework that applies optimal transport theory to optimally controlled agents using motion-induced ground costs. By generalizing Laguerre tessellations for linear agents with minimum energy or time objectives, the research bridges systems control and machine learning through discrete target measure analysis. The work is significant for advancing multiagent system optimization where agent dynamics directly define the transport geometry.
Control Laguerre Tessellation: Semi-discrete Optimal Transport Over Control Systems
arXiv:2607.09139v2 Announce Type: replace-cross Abstract: We study the optimal transport of optimally controlled agents from a compactly supported absolutely continuous source to a discrete target measure. The ground cost for the transport is induced by the optimal cost of the agents' motion. When this ground cost satisfies the twist condition, the optimal transport map is given almost everywhere in terms of a Laguerre tessellation of the state space. We refer to this control-theoretic generalization of Laguerre tessellation as Control Laguerre Tessellation (CLT), and illustrate it for two ground costs induced by linear controlled agents with minimum energy and minimum time objectives.
Abstract:We study the optimal transport of optimally controlled agents from a compactly supported absolutely continuous source to a discrete target measure. The ground cost for the transport is induced by the optimal cost of the agents' motion. When this ground cost satisfies the twist condition, the optimal transport map is given almost everywhere in terms of a Laguerre tessellation of the state space. We refer to this control-theoretic generalization of Laguerre tessellation as Control Laguerre Tessellation (CLT), and illustrate it for two ground costs induced by linear controlled agents with minimum energy and minimum time objectives.
Optimization and Control (math.OC); Machine Learning (cs.LG); Multiagent Systems (cs.MA); Systems and Control (eess.SY)
arXiv:2607.09139 [math.OC]
(or arXiv:2607.09139v2 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2607.09139 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 199 words
Related coverage
Multi-Agent Coordination via Support-Preserving Distillation
arXiv · Oct 8, 2026
Optimal Transport for Machine Learners
arXiv · Jun 16, 2026
Statistical Rates for Entropic Optimal Transport in the Discrete to SubGaussian Regime
arXiv · Sep 23, 2026
Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning
arXiv · Jun 9, 2026