TY - GEN
T1 - Fast, near-optimal computation for multi-robot path planning on graphs
AU - Yu, Jingjin
AU - La Valle, Steven M.
N1 - Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84898889334&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84898889334&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84898889334
SN - 9781577356288
T3 - AAAI Workshop - Technical Report
SP - 155
EP - 157
BT - Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the 27th AAAI Conference on Artificial Intelligence, Technical Report
PB - AI Access Foundation
T2 - 27th AAAI Conference on Artificial Intelligence, AAAI 2013
Y2 - 14 July 2013 through 18 July 2013
ER -