arXiv:2607. 17724v1 Announce Type: cross Abstract: Coordinating payload transfers between subsystems is a critical challenge in lifelong Multi-Agent Pickup and Delivery (MAPD).
Coordinating payload transfers between subsystems is a critical challenge in lifelong Multi-Agent Pickup and Delivery (MAPD). We study systems where agents are confined to separate regions and must exchange payloads through shared handover stations.
arXiv:2608. 06702v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires generating collision-free paths for large agent fleets under strict real-time constraints.
arXiv:2608. 07734v1 Announce Type: cross Abstract: Automated warehouses face a fundamental trade-off between maximizing storage density and achieving high retrieval throughput.
arXiv:2608. 04590v1 Announce Type: new Abstract: The growing deployment of delay-tolerant networks (DTNs) has made store-carry-forward (SCF) communication indispensable under sparse connectivity.
arXiv:2606. 30694v1 Announce Type: cross Abstract: Traffic signal control at urban intersections inherently introduces stop-and-go behavior, resulting in increased delays and reduced traffic efficiency, especially under high traffic demand.
The paper presents a theoretical analysis of the Rolling‑Horizon Collision Resolution (RHCR) framework for Lifelong Multi‑Agent Path Finding (L‑MAPF), proving its near‑optimality in a discounted MDP setting. Building on this, the authors introduce Group Decentralized RHCR (GD‑RHCR), which partitions agents via a transitive communication scheme and plans each partition in parallel, achieving similar optimality guarantees while reducing per‑plan computational cost. Experiments across various maps demonstrate that GD‑RHCR scales to higher agent counts with high throughput and lower cost compared to vanilla RHCR.
arXiv:2608.30512v1 Announce Type: cross Abstract: Large-scale industrial robot fleets share constrained physical infrastructure, making vehicle travel times dependent on safety separation, intersecti...
The paper demonstrates that autonomous AI agents (rApps) in an O-RAN control plane can independently close control loops over shared radio resources, leading to unsafe interactions when multiple agents pursue different objectives. The authors introduce AURA, a lightweight arbitration layer that enforces feasibility invariants, dwell times, and a deadband to ensure stable operation. Implemented on an OpenAirInterface testbed, AURA reduces shared-state excursions by more than an order of magnitude and virtually eliminates cross-slice throughput starvation while maintaining latency compliance for the protected slice.
arXiv:2607. 03694v1 Announce Type: new Abstract: Large-scale Capacitated Vehicle Routing Problems (CVRPs) are commonly solved by partitioning customers into smaller routing problems that can be optimized independently.
HiRAD is a hierarchical reinforcement learning framework designed for continuous-space routing of large-scale AGV fleets, offering real-time guarantees. It introduces a step-level spatiotemporal representation, separates heading selection from velocity control to shrink the action space, and employs an asynchronous event-driven decision pipeline that reduces inference complexity from O(n²) to O(n) and cuts per-step latency by up to 71%. Experiments on random graphs and two warehouse maps show that HiRAD decreases makespan by 45% to 63% and shortens overall runtime.
arXiv:2609.35916v1 Announce Type: cross Abstract: Real-world embodied agents often pursue independent objectives within a shared physical environment, where their actions can alter the conditions fac...
arXiv:2601. 04884v3 Announce Type: replace Abstract: Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents.