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

Multi-agent Path Finding for Cooperative Autonomous Driving (2402.00334v1)

Published 1 Feb 2024 in cs.MA, cs.AI, and cs.RO

Abstract: Anticipating possible future deployment of connected and automated vehicles (CAVs), cooperative autonomous driving at intersections has been studied by many works in control theory and intelligent transportation across decades. Simultaneously, recent parallel works in robotics have devised efficient algorithms for multi-agent path finding (MAPF), though often in environments with simplified kinematics. In this work, we hybridize insights and algorithms from MAPF with the structure and heuristics of optimizing the crossing order of CAVs at signal-free intersections. We devise an optimal and complete algorithm, Order-based Search with Kinematics Arrival Time Scheduling (OBS-KATS), which significantly outperforms existing algorithms, fixed heuristics, and prioritized planning with KATS. The performance is maintained under different vehicle arrival rates, lane lengths, crossing speeds, and control horizon. Through ablations and dissections, we offer insight on the contributing factors to OBS-KATS's performance. Our work is directly applicable to many similarly scaled traffic and multi-robot scenarios with directed lanes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. A. Andreychuk, K. Yakovlev, E. Boyarski, and R. Stern, “Improving continuous-time conflict based search,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, 2021, pp. 11 220–11 227.
  2. A. Andreychuk, K. Yakovlev, P. Surynek, D. Atzmon, and R. Stern, “Multi-agent pathfinding with continuous time,” Artificial Intelligence, vol. 305, p. 103662, 2022.
  3. S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,” Journal of Machine Learning Research, vol. 17, no. 83, pp. 1–5, 2016.
  4. K. Dresner and P. Stone, “A multiagent approach to autonomous intersection management,” Journal of artificial intelligence research, vol. 31, pp. 591–656, 2008.
  5. M. Erdmann and T. Lozano-Perez, “On multiple moving objects,” Algorithmica, vol. 2, pp. 477–521, 1987.
  6. 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.
  7. W. Hönig, J. A. Preiss, T. S. Kumar, G. S. Sukhatme, and N. Ayanian, “Trajectory planning for quadrotor swarms,” IEEE Transactions on Robotics, vol. 34, no. 4, pp. 856–869, 2018.
  8. T. Huang, J. Li, S. Koenig, and B. Dilkina, “Anytime multi-agent path finding via machine learning-guided large neighborhood search,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, 2022, pp. 9368–9376.
  9. K. Kasaura, M. Nishimura, and R. Yonetani, “Prioritized safe interval path planning for multi-agent pathfinding with continuous time on 2d roadmaps,” IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 10 494–10 501, 2022.
  10. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE transactions on Robotics and Automation, vol. 12, no. 4, pp. 566–580, 1996.
  11. J. Kottinger, S. Almagor, and M. Lahijanian, “Conflict-based search for multi-robot motion planning with kinodynamic constraints,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).   IEEE, 2022, pp. 13 494–13 499.
  12. E. Leurent, “An environment for autonomous driving decision-making,” https://github.com/eleurent/highway-env, 2018.
  13. J. Li, Z. Chen, D. Harabor, P. Stuckey, and S. Koenig, “Anytime multi-agent path finding via large neighborhood search,” in International Joint Conference on Artificial Intelligence (IJCAI), 2021.
  14. J. Li, Z. Chen, D. Harabor, P. J. Stuckey, and S. Koenig, “Mapf-lns2: fast repairing for multi-agent path finding via large neighborhood search,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 9, 2022, pp. 10 256–10 265.
  15. J. Li, E. Lin, H. L. Vu, S. Koenig et al., “Intersection coordination with priority-based search for autonomous vehicles,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 10, 2023, pp. 11 578–11 585.
  16. J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. S. Kumar, and S. Koenig, “Lifelong multi-agent path finding in large-scale warehouses,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, 2021, pp. 11 272–11 281.
  17. 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, 2019, pp. 7643–7650.
  18. K. Okumura, “Improving lacam for scalable eventually optimal multi-agent pathfinding,” International Joint Conference on Artificial Intelligence (IJCAI), 2023.
  19. K. Okumura and X. Défago, “Quick multi-robot motion planning by combining sampling and search,” International Joint Conference on Artificial Intelligence (IJCAI), 2023.
  20. K. Okumura, M. Machida, X. Défago, and Y. Tamura, “Priority inheritance with backtracking for iterative multi-agent path finding,” Artificial Intelligence, vol. 310, p. 103752, 2022.
  21. M. Phillips and M. Likhachev, “Sipp: Safe interval path planning for dynamic environments,” in 2011 IEEE International Conference on Robotics and Automation.   IEEE, 2011, pp. 5628–5635.
  22. 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.
  23. D. Silver, “Cooperative pathfinding,” in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, vol. 1, 2005, pp. 117–122.
  24. R. Stern, N. R. Sturtevant, A. Felner, S. Koenig, H. Ma, T. T. Walker, J. Li, D. Atzmon, L. Cohen, T. S. Kumar et al., “Multi-agent pathfinding: Definitions, variants, and benchmarks,” in Twelfth Annual Symposium on Combinatorial Search, 2019.
  25. B. Van Arem, C. J. Van Driel, and R. Visser, “The impact of cooperative adaptive cruise control on traffic-flow characteristics,” IEEE Transactions on intelligent transportation systems, vol. 7, no. 4, pp. 429–436, 2006.
  26. C. Wu, A. Kreidieh, K. Parvate, E. Vinitsky, and A. M. Bayen, “Flow: A modular learning framework for mixed autonomy traffic,” IEEE Transactions on Robotics, 2021.
  27. H. Xu, C. G. Cassandras, L. Li, and Y. Zhang, “Comparison of cooperative driving strategies for cavs at signal-free intersections,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 7, pp. 7614–7627, 2022.
  28. H. Xu, Y. Zhang, L. Li, and W. Li, “Cooperative driving at unsignalized intersections using tree search,” IEEE Transactions on Intelligent Transportation Systems, vol. 21, no. 11, pp. 4563–4571, 2019.
  29. Z. Yan, A. R. Kreidieh, E. Vinitsky, A. M. Bayen, and C. Wu, “Unified automatic control of vehicular systems with reinforcement learning,” IEEE Transactions on Automation Science and Engineering, vol. 20, no. 2, pp. 789–804, 2022.
  30. J. Yu and S. LaValle, “Structure and intractability of optimal multi-robot path planning on graphs,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 27, no. 1, 2013, pp. 1443–1449.
  31. Y. Zhang and C. G. Cassandras, “A decentralized optimal control framework for connected automated vehicles at urban intersections with dynamic resequencing,” in 2018 IEEE Conference on Decision and Control (CDC).   IEEE, 2018, pp. 217–222.
Citations (2)
View on Semantic Scholar

Summary

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

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