Skip to content

Latest commit

 

History

History
26 lines (21 loc) · 1.22 KB

README.md

File metadata and controls

26 lines (21 loc) · 1.22 KB

An Optimal Baseline Algorithm to Solve the Combined Task Allocation and Path Finding Problem

The Paper

bibtex:

@misc{henkel2019optimal,
    title={An Optimal Algorithm to Solve the Combined Task Allocation and Path Finding Problem},
    author={Christian Henkel and Jannik Abbenseth and Marc Toussaint},
    year={2019},
    eprint={1907.10360},
    archivePrefix={arXiv},
    primaryClass={cs.RO}
}

Download PDF from arxiv

Presentation video

youtube

Video Attachment

youtube

The Implementation

Feel free to browse the code at the moment of submission or the latest version.

The scripts that created the figures in the paper can be found here.