|
|
Click here for Roni's personal webpage.
- J. Morag, Y. Zhang, D. Koyfman, Z. Chen, A. Felner, D. Harabor and R. Stern. Prioritised Planning with Guarantees. In International Symposium on Combinatorial Search (SoCS), 82-90, 2024.
- A. Pertzovsky, R. Stern and R. Zivan. CGA: Corridor Generating Algorithm for Multi-Agent Environments. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 3455-3462, 2024.
- K. Yakovlev, A. Andreychuk and R. Stern. Optimal and Bounded Suboptimal Any-Angle Multi-Agent Pathfinding. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 7996-8001, 2024.
- N. Malka, G. Shani and R. Stern. Online Planning for Multi Agent Path Finding in Inaccurate Maps. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 10214-10221, 2024.
- S. Wang, V. Bulitko, T. Huang, S. Koenig and R. Stern. Synthesizing Priority Planning Formulae for Multi-Agent Pathfinding. In Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE), 360-369, 2023.
- S.-H. Chan, R. Stern, A. Felner and S. Koenig. Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. In Symposium on Combinatorial Search (SoCS), 2023.
- A. Natan, R. Stern and M. Kalech. Blame Attribution for Multi-Agent Pathfinding Execution Failures. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2358-2360, 2023.
- B. Shofer, G. Shani and R. Stern. Multi Agent Path Finding under Obstacle Uncertainty. In International Conference on Automated Planning and Scheduling (ICAPS), 402-410, 2023.
- J. Morag, R. Stern and A. Felner. Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. In Symposium on Combinatorial Search (SOCS), 47-55, 2023.
- J. Morag, A. Felner, R. Stern, D. Atzmon and E. Boyarski. Online Multi-Agent Path Finding: New Results. In Symposium on Combinatorial Search (SoCS), 229-233, 2022.
- A. Andreychuk, K. Yakovlev, P. Surynek, D. Atzmon and R. Stern. Multi-Agent Pathfinding with Continuous Time. Artificial Intelligence, 305, 103662, 2022.
- P. Surynek, R. Stern, E. Boyarski and A. Felner. Migrating Techniques from Search-Based Multi-Agent Path Finding Solvers to SAT-Based Approach. Journal of Artificial Intelligence Research (JAIR), 73, 553-618, 2022.
- T. Shahar, S. Shekhar, D. Atzmon, A. Saffidine, B. Juba and R. Stern. Safe Multi-Agent Pathfinding with Time Uncertainty. Journal of Artificial Intelligence Research (JAIR), 70, 923-954, 2021.
- D. Atzmon, R. Stern, A. Felner, N. Sturtevant and S. Koenig. Probabilistic Robust Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2020.
- O. Salzman and R. Stern. Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1711-1715, 2020.
- D. Atzmon, R. Stern, A. Felner, G. Wagner, R. Bartak and N.-F. Zhou. Robust Multi-Agent Path Finding and Executing. Journal of Artificial Intelligence Research (JAIR), 67, 549-579, 2020.
- R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, S. Kumar, E. Boyarski and R. Bartak. Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks [Position Paper]. In Symposium on Combinatorial Search (SoCS), (in print), 2019.
- J. Svancara, M. Vlk, R. Stern, D. Atzmon and R. Bartak. Online Multi-Agent Pathfinding. In AAAI Conference on Artificial Intelligence (AAAI), (in print), 2019.
- D. Atzmon, R. Stern, A. Felner, G. Wagner, R. Bartak and N. Zhou. Robust Multi-Agent Path Finding. In Symposium on Combinatorial Search (SoCS), 2-9, 2018.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. In Symposium on Combinatorial Search (SoCS), 90-105, 2018.
- A. Felner, R. Stern, E. Shimony, M. Goldenberg, G. Sharon, N. Sturtevant, G. Wagner and P. Surynek. Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. In Symposium on Combinatorial Search (SoCS), 28-37, 2017.
- D. Atzmon, A. Felner, R. Stern, G. Wagner, R. Bartak and N. Zhou. k-Robust Multi-Agent Path Finding. In Symposium on Combinatorial Search (SoCS), 157-158, 2017.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. In Symposium on Combinatorial Search (SoCS), 169-170, 2017.
- R. Bartak, N. Zhou, R. Stern, E. Boyarski and P. Surynek. Modeling and Solving the Multi-Agent Pathfinding Problem in Picat. In International Conference on Tools with Artificial Intelligence (ICTAI), 959-966, 2017.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Boolean Satisfiability Approach to Optimal Multi-Agent Path Finding under the Sum of Costs Objective. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1435-1436, 2016.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. In European Conference on Artificial Intelligence (ECAI), 810-818, 2016.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. In Symposium on Combinatorial Search (SoCS), 145-147, 2016.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Conflict-Based Search for Optimal Multi-Agent Pathfinding. Artificial Intelligence, 219, 40-66, 2015.
- E. Boyarski, A. Felner, G. Sharon and R. Stern. Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding. In International Conference on Automated Planning and Scheduling (ICAPS), 47-51, 2015.
- 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 Symposium on Combinatorial Search (SoCS), 223-225, 2015.
- M. Barer, G. Sharon, R. Stern and A. Felner. Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. In European Conference on Artificial Intelligence (ECAI), 961-962, 2014.
- G. Sharon, R. Stern, M. Goldenberg and A. Felner. The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. 470-495, 2013.
- Z. Bnaya, R. Stern, A. Felner, R. Zivan and S. Okamoto. Multi-Agent Path Finding for Self Interested Agents. In Symposium on Combinatorial Search (SoCS), 2013.
- M. Goldenberg, A. Felner, R. Stern, G. Sharon and J. Schaeffer. A* Variants for Optimal Multi-Agent Pathfinding. In AAAI-12 Workshop on Multi-Agent Pathfinding, 2012.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. In Symposium on Combinatorial Search (SoCS), 2012.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. Conflict-Based Search for Optimal Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), 2012.
- G. Sharon, R. Stern, A. Felner and N. Sturtevant. The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI), 662-667, 2011.
- G. Sharon, R. Stern, M. Goldenberg and A. Felner. Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. In Symposium on Combinatorial Search (SoCS), 2011.
|
