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
NATO Burns 300B Tokens A Month On OpenAI's Cyber Defense AI
0dev.to Machine Learning
Samsung Lets Galaxy S26 Owners Lock Apps And Track Pills In Beta
0dev.to Machine Learning
ChatGPT And Claude Can Now Shop For You, But Stores Still Block Bots
0dev.to Machine Learning
Trust Is the Deployment Obstacle: Why African AI Projects Stall After the Demo
0dev.to Machine Learning
How to Trim Audio for an Island Breeze Video — Free, in Your Browser
0dev.to Tutorial
Why Your Paycheck Never Matches Your Offer Letter
0dev.to Tutorial