Welcome to the code archive for The League of Robot Runners competition! Each year we gather together all the best implementations from each team, as they appear on the final leaderboard of the main round. These implementations serve to lower the barrier of entry, for newcomers to the competition and to the field of Multi-Agent Path Finding (MAPF). They also allow established researchers in the area to make further progress, by building on successful ideas and by comparing their efforts against an established state-of-the-art.
Note that problem instances and best known solutions, produced by the implementations hosted here, can be found in our Benchmark Archive repository
The repository is organised by competition year. In the directory for a given year are found directories named after teams, housing their code submissions for different challenge categories.
Each team contributes one or more submissions, with each submission distinguished by a commit hash. We archive all submissions appearing on the final leaderboard of any challenge category. This includes any submission that contributed a virtual best solution by the end of the competition. A README file in the directory of each round provides a summary of all the teams and their submissions, with links to each commit, the achieved score of that entry, and the total errands finished on each evaluation instance.
Visit www.leagueofrobotrunners.org for more details about the competition, and email the organisers at league-of-robot-runnners [at] googlegroups [dot] com for any questions or feedback.
