arXiv (All)
open access
Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control
This paper addresses time-varying coverage control for multi-agent systems, formulated as the tracking of an evolving target density via entropy-regularized semi-discrete optimal transport. Unlike the hard Laguerre partition of the unregularized formulation, entropic regularization assigns fractions
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strategy-proof choice on strictly convex frontiers#1062200
- Young Wild West at "Forbidden Pass" and, How Arietta Paid the Toll#40485
- A Market-Based Virus Monitoring Strategy Complementary to Epidemiological Surveillance in Urban Settings#307239
- Global Optimality for Constrained Exploration via Penalty Regularization#1130540
- Fully Decentralized and Safety-Aware Multi-Agent Reinforcement Learning for Control on Networks#1131134
Record · ID 996647
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive