Fetching the paper…
Reading the bibliography…
Multi-Agent Reinforcement Learning (MARL) based Multi-Agent Path Finding (MAPF) has recently gained attention due to its efficiency and scalability.
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine learning , 1992
1992
Earlier work this paper cites.
D. Silver, “Cooperative pathfinding,” in AAAI conference on artificial intelligence and interactive digital entertainment , 2005
2005
Earlier work this paper cites.
P. R. Wurman, R. D’Andrea, and M. Mountz, “Coordinating hundreds of cooperative, autonomous vehicles in warehouses,” AI magazine , vol. 29, no. 1, pp. 9–9, 2008
2008
Earlier work this paper cites.
Y. Bengio, J. Louradour, R. Collobert, and J. Weston, “Curriculum learning,” in Proceedings of the 26th annual international conference on machine learning , 2009, pp. 41–48
2009
Earlier work this paper cites.
H. Hasselt, “Double q-learning,” Advances in neural information processing systems , vol. 23, 2010
2010
Earlier work this paper cites.
J.-C. Latombe, Robot motion planning . Springer Science & Business Media, 2012, vol. 124
2012
Earlier work this paper cites.
J. Yu and S. LaValle, “Structure and intractability of optimal multi-robot path planning on graphs,” in AAAI Conference on Artificial Intelligence , 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
C. Ferner, G. Wagner, and H. Choset, “Odrm* optimal multirobot path planning in low dimensional search spaces,” in ICRA . IEEE, 2013
2013
Earlier work this paper cites.
M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” in Proceedings of the International Symposium on Combinatorial Search , vol. 5, no. 1, 2014, pp. 19–27
2014
Earlier work this paper cites.
G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,” Artificial Intelligence , vol. 219, pp. 40–66, 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
R. Morris, C. S. Pasareanu, K. S. Luckow, W. Malik, H. Ma, T. S. Kumar, and S. Koenig, “Planning, scheduling and monitoring for airport surface operations.” in AAAI Workshop: Planning for Hybrid Systems , 2016, pp. 608–614
2016
Earlier work this paper cites.
Z. Wang, T. Schaul, M. Hessel, H. Hasselt, M. Lanctot, and N. Freitas, “Dueling network architectures for deep reinforcement learning,” in International conference on machine learning . PMLR, 2016
2016
Earlier work this paper cites.
H. Van Hasselt, A. Guez, and D. Silver, “Deep reinforcement learning with double q-learning,” in AAAI conference on artificial intelligence , 2016
2016
Earlier work this paper cites.
H. Ma, J. Yang, L. Cohen, T. Kumar, and S. Koenig, “Feasibility study: Moving non-homogeneous teams in congested video game environments,” in AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment , 2017
2017
Earlier work this paper cites.
J. Banfi, N. Basilico, and F. Amigoni, “Intractability of time-optimal multirobot path planning on 2d grid graphs with holes,” IEEE Robotics and Automation Letters , vol. 2, no. 4, pp. 1941–1947, 2017
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems , vol. 30, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, T. Kumar et al. , “Multi-agent pathfinding: Definitions, variants, and benchmarks,” in Proceedings of the International Symposium on Combinatorial Search , vol. 10, no. 1, 2019, pp. 151–158
2019
Cited alongside, same era.
Z. He, L. Dong, C. Sun, and J. Wang, “Asynchronous multithreading reinforcement-learning-based path planning and tracking for unmanned underwater vehicle,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 52, no. 5, pp. 2757–2769, 2021
2021
Later among the works it cites.
L. Chen, Y. Wang, Y. Mo, Z. Miao, H. Wang, M. Feng, and S. Wang, “Multiagent path finding using deep reinforcement learning coupled with hot supervision contrastive loss,” IEEE Transactions on Industrial Electronics , vol. 70, no. 7, pp. 7032–7040, 2022
2022
Later among the works it cites.
W. Li, H. Chen, B. Jin, W. Tan, H. Zha, and X. Wang, “Multi-agent path finding with prioritized communication learning,” in 2022 International Conference on Robotics and Automation (ICRA) . IEEE, 2022, pp. 10 695–10 701
2022
Later among the works it cites.
L. Chen, Y. Wang, Z. Miao, Y. Mo, M. Feng, and Z. Zhou, “Multi-agent path finding using imitation-reinforcement learning with transformer,” in 2022 IEEE International Conference on Robotics and Biomimetics (ROBIO) . IEEE, 2022, pp. 445–450
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Sartoretti, J. Kerr, Y. Shi, G. Wagner, T. S. Kumar, S. Koenig, and H. Choset, “Primal: Pathfinding via reinforcement and imitation multi-agent learning,” IEEE Robotics and Automation Letters , 2019
2019
Cited alongside, same era.
G. Gange, D. Harabor, and P. J. Stuckey, “Lazy cbs: implicit conflict-based search using lazy clause generation,” in ICAPS , 2019
2019
Cited alongside, same era.
H. Ma, D. Harabor, P. J. Stuckey, J. Li, and S. Koenig, “Searching with consistent prioritization for multi-agent path finding,” in AAAI conference on artificial intelligence , 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
J. Li, G. Gange, D. Harabor, P. J. Stuckey, H. Ma, and S. Koenig, “New techniques for pairwise symmetry breaking in multi-agent path finding,” in Proceedings of the International Conference on Automated Planning and Scheduling , vol. 30, 2020, pp. 193–201
2020
Cited alongside, same era.
D. Wang, H. Deng, and Z. Pan, “Mrcdrl: Multi-robot coordination with deep reinforcement learning,” Neurocomputing , 2020
2020
Cited alongside, same era.
E. Parisotto, F. Song, J. Rae, R. Pascanu, C. Gulcehre, S. Jayakumar, M. Jaderberg, R. L. Kaufman, A. Clark, S. Noury et al. , “Stabilizing transformers for reinforcement learning,” in International conference on machine learning . PMLR, 2020, pp. 7487–7498
2020
Cited alongside, same era.
J. Li, W. Ruml, and S. Koenig, “Eecbs: A bounded-suboptimal search for multi-agent path finding,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 35, no. 14, 2021, pp. 12 353–12 362
2021
Cited alongside, same era.
2022
Later among the works it cites.
K. Okumura, M. Machida, X. Défago, and Y. Tamura, “Priority inheritance with backtracking for iterative multi-agent path finding,” Artificial Intelligence , vol. 310, p. 103752, 2022
2022
Later among the works it cites.
W. Kool, L. Bliek, D. Numeroso, Y. Zhang, T. Catshoek, K. Tierney, T. Vidal, and J. Gromicho, “The euro meets neurips 2022 vehicle routing competition,” in NeurIPS 2022 Competition Track . PMLR, 2022, pp. 35–49
2022
Later among the works it cites.
2023
Later among the works it cites.
Q. Lin and H. Ma, “SACHA: Soft actor-critic with heuristic-based attention for partially observable multi-agent path finding,” IEEE Robotics and Automation Letters , 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
H. Tang, F. Berto, Z. Ma, C. Hua, K. Ahn, and J. Park, “HiMAP: Learning heuristics-informed policies for large-scale multi-agent pathfinding,” in AAMAS , 2024
2024
Closest in time.
2024
Closest in time.
H. Ye, J. Wang, H. Liang, Z. Cao, Y. Li, and F. Li, “Glop: Learning global partition and local construction for solving large-scale routing problems in real-time,” AAAI 2024 , 2024
2024
Closest in time.
H. Ye, J. Wang, Z. Cao, H. Liang, and Y. Li, “Deepaco: Neural-enhanced ant systems for combinatorial optimization,” Advances in Neural Information Processing Systems , vol. 36, 2024
2024
Closest in time.
2024
Closest in time.