Fetching the paper…
Reading the bibliography…
Optimal Multi-Robot Path Planning (MRPP) has garnered significant attention due to its many applications in domains including warehouse automation, transportation, and swarm robotics.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE transactions on Systems Science and Cybernetics , vol. 4, no. 2, pp. 100–107, 1968
1968
Earlier work this paper cites.
J. Pearl and J. H. Kim, “Studies in semi-admissible heuristics,” IEEE transactions on pattern analysis and machine intelligence , no. 4, pp. 392–399, 1982
1982
Earlier work this paper cites.
D. Kornhauser, G. Miller, and P. Spirakis, “Coordinating pebble motion on graphs, the diameter of permutation groups, and applications,” in Proceedings IEEE Symposium on Foundations of Computer Science , 1984, pp. 241–250
1984
Earlier work this paper cites.
M. A. Erdmann and T. Lozano-Pérez, “On multiple moving objects,” in Proceedings IEEE International Conference on Robotics & Automation , 1986, pp. 1419–1424
1986
Earlier work this paper cites.
D. Rus, B. Donald, and J. Jennings, “Moving furniture with teams of autonomous robots,” in Proceedings IEEE/RSJ International Conference on Intelligent Robots & Systems , 1995, pp. 235–242
1995
Earlier work this paper cites.
S. M. LaValle and S. A. Hutchinson, “Optimal motion planning for multiple robots having independent goals,” IEEE Transactions on Robotics & Automation , vol. 14, no. 6, pp. 912–925, Dec. 1998
1998
Earlier work this paper cites.
Y. Guo and L. E. Parker, “A distributed and optimal motion planning approach for multiple mobile robots,” in Proceedings IEEE International Conference on Robotics & Automation , 2002, pp. 2612–2619
2002
Earlier work this paper cites.
S. Poduri and G. S. Sukhatme, “Constrained coverage for mobile sensor networks,” in Proceedings IEEE International Conference on Robotics & Automation , 2004
2004
Earlier work this paper cites.
D. Silver, “Cooperative pathfinding.” AIIDE , vol. 1, pp. 117–122, 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.
P. Surynek, “An optimization variant of multi-robot path planning is intractable,” in Proceedings AAAI National Conference on Artificial Intelligence , 2010, pp. 1261–1263
2010
Earlier work this paper cites.
P. Surynek, “An optimization variant of multi-robot path planning is intractable,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 24, no. 1, 2010
2010
Earlier work this paper cites.
R. J. Luna and K. E. Bekris, “Push and swap: Fast cooperative path-finding with completeness guarantees,” in Twenty-Second International Joint Conference on Artificial Intelligence , 2011
2011
Earlier work this paper cites.
J. Yu and M. LaValle, “Distance optimal formation control on graphs with a tight convergence time guarantee,” in 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) . IEEE, 2012, pp. 4023–4028
2012
Earlier work this paper cites.
J. Yu and S. M. LaValle, “Structure and intractability of optimal multi-robot path planning on graphs,” in Proceedings AAAI National Conference on Artificial Intelligence , 2013, pp. 1444–1449
2013
Cited alongside, same era.
F. A. A. Cheein and R. Carelli, “Agricultural robotics: Unmanned robotic service units in agricultural tasks,” IEEE industrial electronics magazine , vol. 7, no. 3, pp. 48–58, 2013
2013
Cited alongside, same era.
J. Yu and S. M. LaValle, “Structure and intractability of optimal multi-robot path planning on graphs,” in Twenty-Seventh AAAI Conference on Artificial Intelligence , 2013
2013
Cited alongside, same era.
E. Erdem, D. G. Kisa, U. Öztok, and P. Schueller, “A general formal framework for pathfinding problems with multiple agents.” in AAAI , 2013
2013
Cited alongside, same era.
K.-C. Ma, L. Liu, and G. S. Sukhatme, “An information-driven and disturbance-aware planning method for long-term ocean monitoring,” in Intelligent Robots and Systems (IROS), 2016 IEEE/RSJ International Conference on . IEEE, 2016, pp. 2102–2108
2016
Later among the works it cites.
J. A. Preiss, W. Hönig, G. S. Sukhatme, and N. Ayanian, “Crazyswarm: A large nano-quadcopter swarm,” in IEEE Int. Conf. on Robotics and Automation (ICRA) , 2017
2017
Later among the works it cites.
Q. Wan, C. Gu, S. Sun, M. Chen, H. Huang, and X. Jia, “Lifelong multi-agent path finding in a dynamic environment,” in 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV) . IEEE, 2018, pp. 875–882
2018
Later among the works it cites.
R. Mason, “Developing a profitable online grocery logistics business: Exploring innovations in ordering, fulfilment, and distribution at ocado,” in Contemporary Operations and Logistics . Springer, 2019, pp. 365–383
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
J. Yu and S. M. LaValle, “Multi-agent path planning and network flow,” in Algorithmic foundations of robotics X . Springer, 2013, pp. 157–173
2013
Cited alongside, same era.
M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” in Seventh Annual Symposium on Combinatorial Search , 2014
2014
Cited alongside, same era.
E. Boyarski, A. Felner, R. Stern, G. Sharon, O. Betzalel, D. Tolpin, and E. Shimony, “Icbs: The improved conflict-based search algorithm for multi-agent pathfinding,” in Eighth Annual Symposium on Combinatorial Search , 2015
2015
Cited alongside, same era.
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
Cited alongside, same era.
J. Yu, “Intractability of optimal multi-robot path planning on planar graphs,” IEEE Robotics and Automation Letters , vol. 1, no. 1, pp. 33–40, 2016
2016
Cited alongside, same era.
J. Yu and S. M. LaValle, “Optimal multi-robot path planning on graphs: Complete algorithms and effective heuristics,” IEEE Transactions on Robotics , vol. 32, no. 5, pp. 1163–1177, 2016
2016
Cited alongside, same era.
L. Cohen, T. Uras, T. Kumar, H. Xu, N. Ayanian, and S. Koenig, “Improved bounded-suboptimal multi-agent path finding solvers,” in International Joint Conference on Artificial Intelligence , 2016
2016
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Szegedy and J. Yu, “On rearrangement of items stored in stacks,” in The 14th International Workshop on the Algorithmic Foundations of Robotics , 2020
2020
Later among the works it cites.
T. Guo, S. D. Han, and J. Yu, “Spatial and temporal splitting heuristics for multi-robot motion planning,” in 2021 IEEE International Conference on Robotics and Automation (ICRA) , 2021, pp. 8009–8015
2021
Later among the works it cites.
A. Okoso, K. Otaki, S. Koide, and T. Nishi, “High density automated valet parking via multi-agent path finding,” in 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) . IEEE, 2022, pp. 2146–2153
2022
Later among the works it cites.
T. Guo and J. Yu, “Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time,” in Proceedings of Robotics: Science and Systems , New York City, NY, USA, June 2022
2022
Later among the works it cites.
T. Guo, S. W. Feng, and J. Yu, “Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , 2022
2022
Later among the works it cites.