|
|
- Y. Livne, D. Atzmon, S. Skyler, E. Boyarski, A. Shapiro and A. Felner. Optimally Solving the Multiple Watchman Route Problem with Heuristic Search. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 905-913, 2023.
- J. Morag, A. Felner, R. Stern, D. Atzmon and E. Boyarski. Online Multi-Agent Path Finding: New Results. In Proceedings of the Symposium on Combinatorial Search (SoCS), 229-233, 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.
- E. Boyarski, A. Felner, P. Le Bodic, D. Harabor, P. Stuckey and S. Koenig. f-Aware Conflict Prioritization & Improved Heuristics for Conflict-Based Search. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 12241-12248, 2021.
- E. Boyarski, A. Felner, P. Le Bodic, D. Harabor, P. Stuckey and S. Koenig. Further Improved Heuristics for Conflict-Based Search [Doctoral Dissertation Abstract]. In Proceedings of the Symposium on Combinatorial Search (SoCS), 213-215, 2021.
- E. Boyarski, A. Felner, D. Harabor, P. Stuckey, L. Cohen, J. Li and S. Koenig. Iterative-Deepening Conflict-Based Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2020.
- J. Li, A. Felner, E. Boyarski, H. Ma and S. Koenig. Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2019.
- 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 Proceedings of the Symposium on Combinatorial Search (SoCS), (in print), 2019.
- A. Felner, J. Li, E. Boyarski, H. Ma, L. Cohen, S. Kumar and S. Koenig. Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 83-87, 2018.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. In Proceedings of the Symposium on Combinatorial Search (SoCS), 90-105, 2018.
- P. Surynek, J. Svancara, A. Felner and E. Boyarski. Integration of Independence Detection into SAT-Based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 85-95, 2017.
- P. Surynek, J. Svancara, A. Felner and E. Boyarski. Variants of Independence Detection in SAT-Based Optimal Multi-Agent Path Finding. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 116-136, 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 Proceedings of the Symposium on Combinatorial Search (SoCS), 169-170, 2017.
- R. Barak, N. Zhou, R. Stern, E. Boyarski and P. Surynek. Modeling and Solving the Multi-Agent Pathfinding Problem in Picat. In Proceedings of the 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 Proceedings of the 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 Proceedings of the 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 Proceedings of the Symposium on Combinatorial Search (SoCS), 145-147, 2016.
- E. Boyarski, A. Felner, G. Sharon and R. Stern. Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding. In Proceedings of the 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 Proceedings of the Symposium on Combinatorial Search (SoCS), 223-225, 2015.
|
