Abstract
In this paper, we define a time-extended multirobot task allocation problem, design and analyze some heuristics to tackle the problem complexity in computational resource constrained settings. The robots (or agents) can perform a limited amount of work per unit of time, while the tasks have durations and deadlines by which they must be completed. These constraints, in addition to a relatively small number of agents, may not allow the allocation of all tasks. The heuristics we present are easy-to-implement, tuning free and fast. We analyze these heuristics theoretically with respect to computational complexity. Then, we empirically compare them with respect to performance criteria on a synthetic testset. In so doing, we offer solutions for devices with computation power limitations. The same algorithms can also be embedded into metaheuristics or hyper-heuristics to efficiently and effectively solve the problem.
| Original language | English (US) |
|---|---|
| Title of host publication | NTIC 2015 - 2015 1st International Conference on New Technologies of Information and Communication, Proceeding |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781467366854 |
| DOIs | |
| State | Published - Dec 29 2015 |
| Event | 1st International Conference on New Technologies of Information and Communication, NTIC 2015 - Mila, Algeria Duration: Nov 8 2015 → Nov 9 2015 |
Publication series
| Name | NTIC 2015 - 2015 1st International Conference on New Technologies of Information and Communication, Proceeding |
|---|
Other
| Other | 1st International Conference on New Technologies of Information and Communication, NTIC 2015 |
|---|---|
| Country/Territory | Algeria |
| City | Mila |
| Period | 11/8/15 → 11/9/15 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
Keywords
- Multi-robot systems
- heuristic algorithms
- vehicle routing and scheduling