Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.12879 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918204034514944 |
|---|---|
| author | Perukari, Ashish Kumar Khoroshevskaya, Polina |
| author_facet | Perukari, Ashish Kumar Khoroshevskaya, Polina |
| contents | Operating large autonomous fleets demands fast, resilient allocation of scarce resources (such as energy and fuel, charger access and maintenance slots, time windows, and communication bandwidth) under uncertainty. We propose a side-information-aware approach for resource allocation at scale that combines distributional predictions with decentralized coordination. Local side information shapes per-agent risk models for consumption, which are coupled through chance constraints on failures. A lightweight consensus-ADMM routine coordinates agents over a sparse communication graph, enabling near-centralized performance while avoiding single points of failure. We validate the framework on real urban road networks with autonomous vehicles and on a representative satellite constellation, comparing against greedy, no-side-information, and oracle central baselines. Our method reduces failure rates by 30-55% at matched cost and scales to thousands of agents with near-linear runtime, while preserving feasibility with high probability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12879 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Resilient and Efficient Allocation for Large-Scale Autonomous Fleets via Decentralized Coordination Perukari, Ashish Kumar Khoroshevskaya, Polina Computer Science and Game Theory Operating large autonomous fleets demands fast, resilient allocation of scarce resources (such as energy and fuel, charger access and maintenance slots, time windows, and communication bandwidth) under uncertainty. We propose a side-information-aware approach for resource allocation at scale that combines distributional predictions with decentralized coordination. Local side information shapes per-agent risk models for consumption, which are coupled through chance constraints on failures. A lightweight consensus-ADMM routine coordinates agents over a sparse communication graph, enabling near-centralized performance while avoiding single points of failure. We validate the framework on real urban road networks with autonomous vehicles and on a representative satellite constellation, comparing against greedy, no-side-information, and oracle central baselines. Our method reduces failure rates by 30-55% at matched cost and scales to thousands of agents with near-linear runtime, while preserving feasibility with high probability. |
| title | Resilient and Efficient Allocation for Large-Scale Autonomous Fleets via Decentralized Coordination |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2511.12879 |