Embedded Files
* These task types require execution by a single robot (SR, single-robot tasks), and robots are allowed to execute only one task at a time (ST, single-task robots). The task allocation and scheduling procedure considers both current and future assignments (TA, time-extended assignment). In terms of complexity, these tasks involve cross-schedule dependencies (XD), where various constraints relate tasks from plans of different robots.
Mission of the project
Mission of the project
The goal of this project is to establish a benchmark database for task planning (task allocation and scheduling) problems. Various solution approaches can be directly measured against each other using the same set of examples.
Benchmark examples
Benchmark examples
Benchmark examples for task planning problems of the class XD[ST-SR-TA] with precedence constraints. The problems consist of 4, 8, 16, 32, 64, 128, 256, 512 and 1024 tasks for 2 or 8 robots. Fifty random examples are devised for each setup.
The links to download are provided below and for more information on the structure of files, refer to this page.
Best known results
Best known results
Best known results are updated on this page. To report on improved solutions, please email us and provide the solution in a folder structures as described here.
[1] G. A. Korsah, A. Stentz, M. B. Dias, A comprehensive taxonomy for multi-robot task allocation, The International Journal of Robotics Research 32 (12) (2013) 1495-1512. doi: 10.1177/0278364913496484
Page updated
Google Sites
Report abuse