AI & ML
Dynamic Multi-Robot Task Allocation under Uncertainty and Communication Constraints: A Game-Theoretic Approach
arXiv cs.RO0 views
arXiv:2604.11954v2 Announce Type: replace-cross Abstract: We study dynamic multi-robot task allocation under uncertain task completion, time-window constraints, and incomplete information. Tasks arrive online over a finite horizon and must be completed within specified deadlines, while agents operate from distributed hubs with limited sensing and communication. We model incomplete information through hub-based sensing regions that determine task visibility and a communication graph that governs inter-hub information exchange. Using this framework, we propose Iterative Best Response (IBR), a decentralized policy in which each agent selects the task that maximizes its marginal contribution to the locally observed welfare. We compare IBR against three baselines: Earliest Due Date first (EDD), Hungarian algorithm, and Stochastic Conflict-Based Allocation (SCoBA), on a city-scale package-delivery domain with up to 100 drones and varying task arrival scenarios. Under full and sparse communication, IBR achieves competitive task-completion performance with lower computation time.
Source:https://arxiv.org/abs/2604.11954PreviousSpatial Calibration of Diffuse LiDARsNextAAC: Admissible-by-Architecture Differentiable Landmark Compression for ALT
Related posts

The UN fails to agree on rules regulating ‘killer robots’
0The Verge

This was a Saturday fun project, this is not a benchmark. Its exploratory. When is the last time you spoke to a LLM like a human companion? This experiment cost me $3.17! Have a read and try this your
0dev.to
Pill to treat pancreatic cancer hailed as 'biggest breakthrough in decades'
0Hacker News
Three AI agents have until midnight Sunday to earn money or get wiped
0Hacker News New
Are all of these outages a coincidence – or a glimpse of our AI future?
0Hacker News New
Agents as End Users
0Hacker News New