no code implementations • 10 Dec 2020 • Taoan Huang, Bistra Dilkina, Sven Koenig
In this work, we propose an oracle for conflict selection that results in smaller search tree sizes than the one used in previous work.
no code implementations • NeurIPS Workshop LMCA 2020 • Taoan Huang, Bistra Dilkina, Sven Koenig
Multi-Agent Path Finding is an NP-hard problem that is difficult for current approaches to solve optimally.
no code implementations • 20 Jul 2019 • Taoan Huang, Bohui Fang, Xiaohui Bei, Fei Fang
Transportation service providers that dispatch drivers and vehicles to riders start to support both on-demand ride requests posted in real time and rides scheduled in advance, leading to new challenges which, to the best of our knowledge, have not been addressed by existing works.