Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.15052 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916956411527168 |
|---|---|
| author | Gosrich, Walker Agarwal, Saurav Garg, Kashish Mayya, Siddharth Malencia, Matthew Yim, Mark Kumar, Vijay |
| author_facet | Gosrich, Walker Agarwal, Saurav Garg, Kashish Mayya, Siddharth Malencia, Matthew Yim, Mark Kumar, Vijay |
| contents | We propose a new formulation for the multi-robot task allocation problem that incorporates (a) complex precedence relationships between tasks, (b) efficient intra-task coordination, and (c) cooperation through the formation of robot coalitions. A task graph specifies the tasks and their relationships, and a set of reward functions models the effects of coalition size and preceding task performance. Maximizing task rewards is NP-hard; hence, we propose network flow-based algorithms to approximate solutions efficiently. A novel online algorithm performs iterative re-allocation, providing robustness to task failures and model inaccuracies to achieve higher performance than offline approaches. We comprehensively evaluate the algorithms in a testbed with random missions and reward functions and compare them to a mixed-integer solver and a greedy heuristic. Additionally, we validate the overall approach in an advanced simulator, modeling reward functions based on realistic physical phenomena and executing the tasks with realistic robot dynamics. Results establish efficacy in modeling complex missions and efficiency in generating high-fidelity task plans while leveraging task relationships. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_15052 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Online Multi-Robot Coordination and Cooperation with Task Precedence Relationships Gosrich, Walker Agarwal, Saurav Garg, Kashish Mayya, Siddharth Malencia, Matthew Yim, Mark Kumar, Vijay Robotics We propose a new formulation for the multi-robot task allocation problem that incorporates (a) complex precedence relationships between tasks, (b) efficient intra-task coordination, and (c) cooperation through the formation of robot coalitions. A task graph specifies the tasks and their relationships, and a set of reward functions models the effects of coalition size and preceding task performance. Maximizing task rewards is NP-hard; hence, we propose network flow-based algorithms to approximate solutions efficiently. A novel online algorithm performs iterative re-allocation, providing robustness to task failures and model inaccuracies to achieve higher performance than offline approaches. We comprehensively evaluate the algorithms in a testbed with random missions and reward functions and compare them to a mixed-integer solver and a greedy heuristic. Additionally, we validate the overall approach in an advanced simulator, modeling reward functions based on realistic physical phenomena and executing the tasks with realistic robot dynamics. Results establish efficacy in modeling complex missions and efficiency in generating high-fidelity task plans while leveraging task relationships. |
| title | Online Multi-Robot Coordination and Cooperation with Task Precedence Relationships |
| topic | Robotics |
| url | https://arxiv.org/abs/2509.15052 |