Fetching the paper…
Reading the bibliography…
Multi-agent path finding (MAPF) is an abstract model for the navigation of multiple robots in warehouse automation, where multiple robots plan collision-free paths from the start to goal positions.
M. L. Littman, “Markov games as a framework for multi-agent reinforcement learning,” in Machine learning proceedings , 1994, pp. 157–163
1994
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 , 2016, pp. 1995–2003
2003
Earlier work this paper cites.
D. Silver, “Cooperative pathfinding,” in Proc. AAAI Conf. Artif. Intell. Interact. Digit. Entertain. , 2005, pp. 117–122
2005
Earlier work this paper cites.
P. R. Wurman, R. D’Andrea, and M. Mountz, “Coordinating hundreds of cooperative, autonomous vehicles in warehouses,” AI Mag. , vol. 29, no. 1, pp. 9–9, 2008
2008
Earlier work this paper cites.
H. Wang, Y. Yu, and Q. Yuan, “Application of dijkstra algorithm in robot path-planning,” in Proc. IEEE Int. Conf. Mech. Automat. Control Eng. , 2011, pp. 1067–1069
2011
Earlier work this paper cites.
P. Surynek, “Towards optimal cooperative path planning in hard setups through satisfiability solving,” in Pacific Rim Int. Conf. Artif. Intell. , 2012, pp. 564–576
2012
Earlier work this paper cites.
C. Ferner, G. Wagner, and H. Choset, “ODrM ∗ optimal multirobot path planning in low dimensional search spaces,” in Proc. IEEE Int. Conf. Robot. Autom. , 2013, pp. 3854–3859
2013
Earlier work this paper cites.
J. Yu and S. LaValle, “Structure and intractability of optimal multi-robot path planning on graphs,” in Proc. AAAI Conf. Artif. Intell. , 2013, pp. 1443–1449
2013
Earlier work this paper cites.
G. Sharon, R. Stern, M. Goldenberg, and A. Felner, “The increasing cost tree search for optimal multi-agent pathfinding,” Artif. Intell. , vol. 195, pp. 470–495, 2013
2013
Earlier work this paper cites.
F. Aljalaud and N. Sturtevant, “Finding bounded suboptimal multi-agent path planning solutions using increasing cost tree search,” in Int. Symp. Comb. Search, SoCS , 2013, pp. 203–204
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 Proc. Int. Symp. Comb. Search , 2014, pp. 19–27
2014
Earlier work this paper cites.
C. Wilt and A. Botea, “Spatially distributed multiagent path planning,” in Proc. Int. Conf. Automated Plan. Sched., ICAPS , 2014, pp. 332–340
2014
Earlier work this paper cites.
J. Berger and N. Lo, “An innovative multi-agent search-and-rescue path planning approach,” Computers & Operations Research , vol. 53, pp. 24–31, 2015
2015
Earlier work this paper cites.
G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,” Artif. Intell. , vol. 219, pp. 40–66, 2015
2015
Cited alongside, same era.
G. Wagner and H. Choset, “Subdimensional expansion for multirobot path planning,” Artif. Intell. , vol. 219, pp. 1–24, 2015
2015
Cited alongside, same era.
J. Yu and S. M. LaValle, “Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics,” IEEE Trans. Robot. , vol. 32, no. 5, pp. 1163–1177, 2016
2016
Cited alongside, same era.
H. Ma, C. Tovey, G. Sharon, T. S. Kumar, and S. Koenig, “Multi-agent path finding with payload transfers and the package-exchange robot-routing problem,” in Proc. AAAI Conf. Artif. Intell. , 2016, pp. 3166–3173
2016
Cited alongside, same era.
Z. Ma, Y. Luo, and H. Ma, “Distributed heuristic multi-agent path finding with communication,” in Proc. IEEE Int. Conf. Robot. Autom. , 2021, pp. 8699–8705
2021
Later among the works it cites.
Z. Ma, Y. Luo, and J. Pan, “Learning selective communication for multi-agent path finding,” IEEE Robot. Autom. Lett. , vol. 7, no. 2, pp. 1455–1462, 2021
2021
Later among the works it cites.
J. Li, Z. Chen, D. Harabor, P. J. Stuckey, and S. Koenig, “Anytime multi-agent path finding via large neighborhood search,” in Proc. Int. Joint Conf. Auton. Agents Multiagent Syst. , 2021, pp. 1581–1583
2021
Later among the works it cites.
Q. Li, W. Lin, Z. Liu, and A. Prorok, “Message-aware graph attention networks for large-scale multi-robot path planning,” IEEE Robot. Autom. Lett. , vol. 6, no. 3, pp. 5533–5540, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
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,” 2017
2017
Cited alongside, same era.
L. Cohen, M. Greco, H. Ma, C. Hernandez, A. Felner, T. S. Kumar, and S. Koenig, “Anytime focal search with applications,” in Proc. Int. Joint Conf. Artif. Intell. , 2018, pp. 1434–1441
2018
Cited alongside, same era.
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 Robot. Autom. Lett. , vol. 4, no. 3, pp. 2378–2385, 2019
2019
Cited alongside, same era.
K. Okumura, M. Machida, X. Défago, and Y. Tamura, “Priority inheritance with backtracking for iterative multi-agent path finding,” in Proc. Int. Joint Conf. Artif. Intell. , 2019, pp. 535–542
2019
Cited alongside, same era.
Z. Liu, B. Chen, H. Zhou, G. Koushik, M. Hebert, and D. Zhao, “MAPPER: Multi-agent path planning with evolutionary reinforcement learning in mixed dynamic environments,” in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst. , 2020, pp. 11 748–11 754
2020
Cited alongside, same era.
B. Wang, Z. Liu, Q. Li, and A. Prorok, “Mobile robot path planning in dynamic environments through globally guided reinforcement learning,” IEEE Robot. Autom. Lett. , vol. 5, no. 4, pp. 6932–6939, 2020
2020
Cited alongside, same era.
Q. Li, F. Gama, A. Ribeiro, and A. Prorok, “Graph neural networks for decentralized multi-robot path planning,” in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst. , 2020, pp. 11 785–11 792
2020
Cited alongside, same era.
J. Li, Z. Chen, Y. Zheng, S.-H. Chan, D. Harabor, P. J. Stuckey, H. Ma, and S. Koenig, “Scalable rail planning and replanning: Winning the 2020 flatland challenge,” in Proc. Int. Conf. Automated Plan. Sched. , 2021, pp. 477–485
2021
Later among the works it cites.
H. Zhang, M. Yao, Z. Liu, J. Li, L. Terr, S.-H. Chan, T. S. Kumar, and S. Koenig, “A hierarchical approach to multi-agent path finding,” in Int. Symp. Comb. Search, SoCS , 2021, pp. 209–211
2021
Later among the works it cites.
Y. Xu, Y. Li, Q. Liu, J. Gao, Y. Liu, and M. Chen, “Multi-agent pathfinding with local and global guidance,” in 2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) , vol. 1, 2021, pp. 1–7
2021
Later among the works it cites.
H. Ma, “Graph-based multi-robot path finding and planning,” Current Robot. Reports , vol. 3, pp. 77–84, 2022
2022
Later among the works it cites.
M. Rahman, M. A. Alam, M. M. Islam, I. Rahman, M. M. Khan, and T. Iqbal, “An adaptive agent-specific sub-optimal bounding approach for multi-agent path finding,” IEEE Access , vol. 10, pp. 22 226–22 237, 2022
2022
Later among the works it cites.
——, “Mapf-lns2: Fast repairing for multi-agent path finding via large neighborhood search,” in Proc. AAAI Conf. Artif. Intell. , 2022, pp. 10 256–10 265
2022
Later among the works it cites.
Z. Li, F. Liu, W. Yang, S. Peng, and J. Zhou, “A survey of convolutional neural networks: Analysis, applications, and prospects,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 12, pp. 6999–7019, 2022
2022
Later among the works it cites.
H. Guan, Y. Gao, M. Zhao, Y. Yang, F. Deng, and T. L. Lam, “Ab-mapper: Attention and bicnet based multi-agent path planning for dynamic environment,” in Proc. IEEE/RSJ Int. Conf. Intell. Robots Syst. , 2022, pp. 13 799–13 806
2022
Later among the works it cites.
L. Chen, Y. Wang, Z. Miao, Y. Mo, M. Feng, Z. Zhou, and H. Wang, “Transformer-based imitative reinforcement learning for multirobot path planning,” IEEE Trans. Industr. Inform. , vol. 19, no. 10, pp. 10 233–10 243, 2023
2023
Closest in time.