Eli Boyarski

According to our database¹, Eli Boyarski authored at least 28 papers between 2015 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Online Multi-Agent Path Finding: New Results.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

On Merging Agents in Multi-Agent Pathfinding Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

2021

Studying Online Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Experimental Evaluation of Classical Multi Agent Path Finding Algorithms.

[BibT_eX]

[DOI]

Omri Kaduri

Eli Boyarski

Roni Stern

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Further Improved Heuristics For Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Improving Continuous-time Conflict Based Search.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Eli Boyarski

Roni Stern

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

F-Cardinal Conflicts in Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Iterative-Deepening Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Algorithm Selection for Optimal Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Omri Kaduri

Eli Boyarski

Roni Stern

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017

Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Modeling and Solving the Multi-agent Pathfinding Problem in Picat.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Agents and Artificial Intelligence - 9th International Conference, 2017

Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

2016

An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Eli Boyarski

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...