Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding (2404.03554v1)

Published 4 Apr 2024 in cs.MA

Abstract: Since more and more algorithms are proposed for multi-agent path finding (MAPF) and each of them has its strengths, choosing the correct one for a specific scenario that fulfills some specified requirements is an important task. Previous research in algorithm selection for MAPF built a standard workflow and showed that machine learning can help. In this paper, we study general solvers for MAPF, which further include suboptimal algorithms. We propose different groups of optimization objectives and learning tasks to handle the new tradeoff between runtime and solution quality. We conduct extensive experiments to show that the same loss can not be used for different groups of optimization objectives, and that standard computer vision models are no worse than customized architecture. We also provide insightful discussions on how feature-sensitive pre-processing is needed for learning for MAPF, and how different learning metrics are correlated to different learning tasks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. MAPFASTER: A Faster and Simpler take on Multi-Agent Path Finding Algorithm Selection. In IEEE/RSJ International Conference on Intelligent Robots and Systems,, 10088–10093. IEEE.
  2. ASlib: A benchmark library for algorithm selection. Artif. Intell., 41–58.
  3. XGBoost: A Scalable Tree Boosting System. In Proceedings of the Twenty-second ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 785–794. ACM.
  4. An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale. In Proceedings of the Ninth International Conference on Learning Representations (ICLR).
  5. Pitfalls and Best Practices in Algorithm Configuration. J. Artif. Intell. Res., 64: 861–893.
  6. DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics. IEEE Robotics Autom. Lett., (2): 1350–1357.
  7. Deep Residual Learning for Image Recognition. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 770–778. IEEE Computer Society.
  8. On the potential of normalized TSP features for automated algorithm selection. In Proceedings of the Sixteenth Conference on Foundations of Genetic Algorithms (FOGA), 7:1–7:15. ACM.
  9. Huber, P. J. 1992. Robust Estimation of a Location Parameter, 492–518. Springer. ISBN 978-1-4612-4380-9.
  10. Algorithm Selection for Optimal Multi-Agent Pathfinding. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (ICAPS), 161–165. AAAI Press.
  11. Experimental Evaluation of Classical Multi Agent Path Finding Algorithms. In Proceedings of the Fourteenth International Symposium on Combinatorial Search (SOCS), 126–130. AAAI Press.
  12. Leveraging TSP Solver Complementarity through Machine Learning. Evol. Comput., (4).
  13. Learning multiple layers of features from tiny images. Technical report, University of Toronto, Toronto, Ontario.
  14. ImageNet Classification with Deep Convolutional Neural Networks. In Advances in Neural Information Processing Systems 25 (NIPS 2012), 1106–1114.
  15. Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World. In Proceedings of the NeurIPS 2020 Competition and Demonstration Track, 275–301. PMLR.
  16. Anytime Multi-Agent Path Finding via Large Neighborhood Search. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI), 4127–4135. ijcai.org.
  17. MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. In Proceedings of the Thirty-Sixth Conference on Artificial Intelligence (AAAI), 10256–10265. AAAI Press.
  18. Open Algorithm Selection Challenge 2017: Setup and Scenarios. In Proceedings of the Open Algorithm Selection Challenge 2017, volume 79 of Proceedings of Machine Learning Research, 1–7. PMLR.
  19. Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI), 3166–3173. AAAI Press.
  20. Nebel, B. 2020. On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (ICAPS), 212–216. AAAI Press.
  21. Okumura, K. 2023a. Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding. arXiv preprint arXiv:2305.03632.
  22. Okumura, K. 2023b. Lacam: Search-based algorithm for quick multi-agent pathfinding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, 11655–11662.
  23. Priority inheritance with backtracking for iterative multi-agent path finding. Artif. Intell., 103752.
  24. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems 32, 8024–8035.
  25. MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings. In Proceedings of the Twentieth International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1055–1063. ACM.
  26. Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives. In Proceedings of the Fifth International Symposium on Combinatorial Search (SOCS), 88–96. AAAI Press.
  27. Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. In Proceedings of the Sixteenth International Conference of Parallel Problem Solving from Nature (PPSN), 48–64. Springer.
  28. Conflict-based search for optimal multi-agent pathfinding. Artif. Intell., 40–66.
  29. Automatic Algorithm Selection In Multi-agent Pathfinding. CoRR.
  30. Silver, D. 2005. Cooperative Pathfinding. In Proceedings of the Conference on First Artificial Intelligence and Interactive Digital Entertainment (AIIDE), 117–122. AAAI Press.
  31. Very Deep Convolutional Networks for Large-Scale Image Recognition. In Proceedings of the Third International Conference on Learning Representations (ICLR).
  32. Smith-Miles, K. 2008. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv., (1): 6:1–6:25.
  33. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. In Proceedings of the Twelfth Annual Symposium on Combinatorial Search (SoCS), 151–159. AAAI Press.
  34. Surynek, P. 2010. An optimization variant of multi-robot path planning is intractable. In Proceedings of the AAAI conference on artificial intelligence, volume 24, 1261–1263.
  35. Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. In 22nd European Conference on Artificial Intelligence (ECAI), volume 285 of Frontiers in Artificial Intelligence and Applications, 810–818. IOS Press.
  36. Going deeper with convolutions. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 1–9. IEEE Computer Society.
  37. Attention is All you Need. In Advances in Neural Information Processing Systems 30, 5998–6008.
  38. Wightman, R. 2019. PyTorch Image Models. https://github.com/rwightman/pytorch-image-models.
  39. Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors. In Proceedings of the Fifteenth International Conference of Theory and Applications of Satisfiability Testing (SAT), Lecture Notes in Computer Science, 228–241. Springer.
  40. Towards fairer datasets: filtering and balancing the distribution of the people subtree in the ImageNet hierarchy. In Proceedings of ACM Conference on Fairness, Accountability, and Transparency (ACM FAccT), 547–558. ACM.
  41. Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI), 1, 1443–1449. AAAI Press.

Summary

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