Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Efficient Heuristics for Multi-Robot Path Planning in Crowded Environments (2306.14409v1)

Published 26 Jun 2023 in cs.RO

Abstract: Optimal Multi-Robot Path Planning (MRPP) has garnered significant attention due to its many applications in domains including warehouse automation, transportation, and swarm robotics. Current MRPP solvers can be divided into reduction-based, search-based, and rule-based categories, each with their strengths and limitations. Regardless of the methodology, however, the issue of handling dense MRPP instances remains a significant challenge, where existing approaches generally demonstrate a dichotomy regarding solution optimality and efficiency. This study seeks to bridge the gap in optimal MRPP resolution for dense, highly-entangled scenarios, with potential applications to high-density storage systems and traffic congestion control. Toward that goal, we analyze the behaviors of SOTA MRPP algorithms in dense settings and develop two hybrid algorithms leveraging the strengths of existing SOTA algorithms: DCBS (database-accelerated enhanced conflict-based search) and SCBS (sparsified enhanced conflict-based search). Experimental validations demonstrate that DCBS and SCBS deliver a significant reduction in computational time compared to existing bounded-suboptimal methods and improve solution quality compared to existing rule-based methods, achieving a desirable balance between computational efficiency and solution optimality. As a result, DCBS and SCBS are particularly suitable for quickly computing good-quality solutions for multi-robot routing in dense settings

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. 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.
  2. P. Surynek, “An optimization variant of multi-robot path planning is intractable,” in Proceedings AAAI National Conference on Artificial Intelligence, 2010, pp. 1261–1263.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. S. Poduri and G. S. Sukhatme, “Constrained coverage for mobile sensor networks,” in Proceedings IEEE International Conference on Robotics & Automation, 2004.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. M. A. Erdmann and T. Lozano-Pérez, “On multiple moving objects,” in Proceedings IEEE International Conference on Robotics & Automation, 1986, pp. 1419–1424.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. T. Guo and J. Yu, “Toward efficient physical and algorithmic design of automated garages,” arXiv preprint arXiv:2302.01305, 2023.
  19. 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.
  20. S. D. Han and J. Yu, “Ddm: Fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics,” ArXiv, vol. abs/1904.02598, 2019.
  21. 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.
  22. 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.
  23. 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,” arXiv preprint arXiv:1906.08291, 2019.
  24. 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.
  25. 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.
  26. H. Ma, C. Tovey, G. Sharon, T. Kumar, and S. Koenig, “Multi-agent path finding with payload transfers and the package-exchange robot-routing problem,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30, no. 1, 2016.
  27. J. Yu and S. M. LaValle, “Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics,” IEEE Transactions on Robotics, vol. 32, no. 5, pp. 1163–1177, 2016.
  28. E. Erdem, D. G. Kisa, U. Öztok, and P. Schueller, “A general formal framework for pathfinding problems with multiple agents.” in AAAI, 2013.
  29. 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.
  30. 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.
  31. D. Silver, “Cooperative pathfinding.” AIIDE, vol. 1, pp. 117–122, 2005.
  32. G. Sharon, R. Stern, M. Goldenberg, and A. Felner, “The increasing cost tree search for optimal multi-agent pathfinding,” Artificial Intelligence, vol. 195, pp. 470–495, 2013.
  33. 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.
  34. K. Okumura, M. Machida, X. Défago, and Y. Tamura, “Priority inheritance with backtracking for iterative multi-agent path finding,” arXiv preprint arXiv:1901.11282, 2019.
  35. 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.
  36. M. Szegedy and J. Yu, “On rearrangement of items stored in stacks,” in The 14th International Workshop on the Algorithmic Foundations of Robotics, 2020.
  37. 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.
  38. 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.
  39. 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.
  40. J. Yu and S. M. LaValle, “Multi-agent path planning and network flow,” in Algorithmic foundations of robotics X.   Springer, 2013, pp. 157–173.
  41. 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.
  42. R. Stern, N. R. Sturtevant, A. Felner, S. Koenig, H. Ma, T. T. Walker, J. Li, D. Atzmon, L. Cohen, T. K. S. Kumar, E. Boyarski, and R. Bartak, “Multi-agent pathfinding: Definitions, variants, and benchmarks,” Symposium on Combinatorial Search (SoCS), pp. 151–158, 2019.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Youtube Logo Streamline Icon: https://streamlinehq.com

YouTube