@inproceedings{b1433dae76414e5a9bd5173393521635,
title = "Fast, near-optimal computation for multi-robot path planning on graphs",
abstract = "We report a new method for computing near optimal makespan solutions to multi-robot path planning problem on graphs. Our focus here is with hard instances - those with up to 85% of all graph nodes occupied by robots. Our method yields 100-1000x speedup compared with existing methods. At the same time, our solutions have much smaller and often optimal makespans.",
author = "Jingjin Yu and {La Valle}, {Steven M.}",
year = "2013",
language = "English (US)",
isbn = "9781577356288",
series = "AAAI Workshop - Technical Report",
publisher = "AI Access Foundation",
pages = "155--157",
booktitle = "Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report",
note = "27th AAAI Conference on Artificial Intelligence, AAAI 2013 ; Conference date: 14-07-2013 Through 18-07-2013",
}