arXiv (All)
open access
Semi-discrete Optimal Transport for Time-Varying Multi-Agent Coverage Control
Coverage control algorithms have traditionally focused on static target densities, where agents optimally cover a fixed spatial distribution. However, many applications, such as environmental monitoring, surveillance, and adaptive sensing, involve time-varying densities. While time-varying coverage
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
- A Hierarchical Coverage Path Planning Algorithm for Unknown Environments#1070084
- Coverage and Reliability of Randomly Distributed Sensor Systems with Heterogeneous Detection Range#16748
- 33 U.S.C. § 701i — Elimination from protection of areas subject to evacuation#585953
- ARCTAN: Arbitrary RF Containment Using Tactical Aerial Networks and Differentiable Ray Tracing#1160969
- ARCTAN: Arbitrary RF Containment Using Tactical Aerial Networks and Differentiable Ray Tracing#1155687
Record · ID 986817
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