Подписаться
Jiaoyang Li
Jiaoyang Li
Assistant Professor at Robotics Institute, Carnegie Mellon University
Подтвержден адрес электронной почты в домене cmu.edu - Главная страница
Название
Процитировано
Процитировано
Год
Multi-agent pathfinding: Definitions, variants, and benchmarks
R Stern, N Sturtevant, A Felner, S Koenig, H Ma, T Walker, J Li, D Atzmon, ...
Proceedings of the International Symposium on Combinatorial Search 10 (1 …, 2019
7752019
Lifelong multi-agent path finding for online pickup and delivery tasks
H Ma, J Li, TK Kumar, S Koenig
arXiv preprint arXiv:1705.10868, 2017
3382017
Lifelong multi-agent path finding in large-scale warehouses
J Li, A Tinka, S Kiesel, JW Durham, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 35 (13), 11272 …, 2021
3072021
Searching with consistent prioritization for multi-agent path finding
H Ma, D Harabor, PJ Stuckey, J Li, S Koenig
Proceedings of the AAAI conference on artificial intelligence 33 (01), 7643-7650, 2019
2622019
Task and path planning for multi-agent pickup and delivery
M Liu, H Ma, J Li, S Koenig
Proceedings of the International Joint Conference on Autonomous Agents and …, 2019
1992019
Eecbs: A bounded-suboptimal search for multi-agent path finding
J Li, W Ruml, S Koenig
Proceedings of the AAAI conference on artificial intelligence 35 (14), 12353 …, 2021
1982021
Adding heuristics to conflict-based search for multi-agent path finding
A Felner, J Li, E Boyarski, H Ma, L Cohen, TKS Kumar, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2018
1792018
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.
J Li, A Felner, E Boyarski, H Ma, S Koenig
IJCAI 2019, 442-449, 2019
1632019
Multi-agent path finding for large agents
J Li, P Surynek, A Felner, H Ma, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7627-7634, 2019
1492019
MAPF-LNS2: Fast repairing for multi-agent path finding via large neighborhood search
J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 10256 …, 2022
1042022
Disjoint splitting for multi-agent path finding with conflict-based search
J Li, D Harabor, PJ Stuckey, A Felner, H Ma, S Koenig
Proceedings of the international conference on automated planning and …, 2019
97*2019
Pairwise symmetry reasoning for multi-agent path finding search
J Li, D Harabor, PJ Stuckey, H Ma, G Gange, S Koenig
Artificial Intelligence 301, 103574, 2021
962021
Anytime multi-agent path finding via large neighborhood search
J Li, Z Chen, D Harabor, PJ Stuckey, S Koenig
International Joint Conference on Artificial Intelligence 2021, 4127-4135, 2021
962021
New techniques for pairwise symmetry breaking in multi-agent path finding
J Li, G Gange, D Harabor, PJ Stuckey, H Ma, S Koenig
Proceedings of the International Conference on Automated Planning and …, 2020
922020
Symmetry-breaking constraints for grid-based multi-agent path finding
J Li, D Harabor, PJ Stuckey, H Ma, S Koenig
Proceedings of the AAAI conference on artificial intelligence 33 (01), 6087-6095, 2019
882019
Multi-agent path finding with deadlines
H Ma, G Wagner, A Felner, J Li, TK Kumar, S Koenig
arXiv preprint arXiv:1806.04216, 2018
802018
Scalable rail planning and replanning: Winning the 2020 flatland challenge
J Li, Z Chen, Y Zheng, SH Chan, D Harabor, PJ Stuckey, H Ma, S Koenig
Proceedings of the international conference on automated planning and …, 2021
622021
Multi-agent path finding with mutex propagation
H Zhang, J Li, P Surynek, TKS Kumar, S Koenig
Artificial Intelligence 311, 103766, 2022
482022
Multi-goal multi-agent pickup and delivery
Q Xu, J Li, S Koenig, H Ma
2022 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2022
422022
Anytime multi-agent path finding via machine learning-guided large neighborhood search
T Huang, J Li, S Koenig, B Dilkina
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 9368-9376, 2022
412022
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20