Well-Connected Set and Its Application to Multi-Robot Path Planning (2402.11766v1)
Abstract: Parking lots and autonomous warehouses for accommodating many vehicles/robots adopt designs in which the underlying graphs are \emph{well-connected} to simplify planning and reduce congestion. In this study, we formulate and delve into the \emph{largest well-connected set} (LWCS) problem and explore its applications in layout design for multi-robot path planning. Roughly speaking, a well-connected set over a connected graph is a set of vertices such that there is a path on the graph connecting any pair of vertices in the set without passing through any additional vertices of the set. Identifying an LWCS has many potential high-utility applications, e.g., for determining parking garage layout and capacity, as prioritized planning can be shown to be complete when start/goal configurations belong to an LWCS. In this work, we establish that computing an LWCS is NP-complete. We further develop optimal and near-optimal LWCS algorithms, with the near-optimal algorithm targeting large maps. A complete prioritized planning method is given for planning paths for multiple robots residing on an LWCS.
- 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.
- T. Guo and J. Yu, “Toward efficient physical and algorithmic design of automated garages,” arXiv preprint arXiv:2302.01305, 2023.
- K. Azadeh, R. De Koster, and D. Roy, “Robotized and automated warehouse systems: Review and recent developments,” Transportation Science, vol. 53, no. 4, pp. 917–945, 2019.
- F. Caron, G. Marchet, and A. Perego, “Optimal layout in low-level picker-to-part systems,” International Journal of Production Research, vol. 38, no. 1, pp. 101–117, 2000.
- 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.
- Z. Yan, N. Jouandeau, and A. A. Cherif, “A survey and analysis of multi-robot coordination,” International Journal of Advanced Robotic Systems, vol. 10, no. 12, p. 399, 2013.
- W. Sheng, Q. Yang, J. Tan, and N. Xi, “Distributed multi-robot coordination in area exploration,” Robotics and autonomous systems, vol. 54, no. 12, pp. 945–955, 2006.
- H. Ma, J. Li, T. K. S. Kumar, and S. Koenig, “Lifelong multi-agent path finding for online pickup and delivery tasks,” in AAMAS, 2017.
- H. Ma, D. Harabor, P. J. Stuckey, J. Li, and S. Koenig, “Searching with consistent prioritization for multi-agent path finding,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, 2019, pp. 7643–7650.
- M. Čáp, J. Vokřínek, and A. Kleiner, “Complete decentralized method for on-line multi-robot trajectory planning in well-formed infrastructures,” in Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015.
- 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.
- 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.
- M. A. Erdmann and T. Lozano-Pérez, “On multiple moving objects,” Algorithmica, vol. 2, no. 4, pp. 477–521, 1987.
- D. Silver, “Cooperative pathfinding.” Aiide, vol. 1, pp. 117–122, 2005.
- R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM journal on computing, vol. 1, no. 2, pp. 146–160, 1972.
- H. W. Kuhn, “The hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, no. 1-2, pp. 83–97, 1955.
- J. Yu and S. M. LaValle, “Multi-agent path planning and network flow,” in Algorithmic foundations of robotics X. Springer, 2013, pp. 157–173.
- 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.
- L. R. Ford and D. R. Fulkerson, “Maximal flow through a network,” Canadian journal of Mathematics, vol. 8, pp. 399–404, 1956.
- N. Sturtevant, “Benchmarks for grid-based pathfinding,” Transactions on Computational Intelligence and AI in Games, vol. 4, no. 2, pp. 144 – 148, 2012. [Online]. Available: http://web.cs.du.edu/~sturtevant/papers/benchmarks.pdf
- K. Okumura, M. Machida, X. Défago, and Y. Tamura, “Priority inheritance with backtracking for iterative multi-agent path finding,” in IJCAI, 2019.