Dor Atzmon

According to our database¹, Dor Atzmon authored at least 34 papers between 2017 and 2024.

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

2024

Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

Minimizing State Exploration While Searching Graphs with Unknown Obstacles.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Conflict-tolerant and conflict-free multi-agent meeting.

[BibT_eX]

[DOI]

Artif. Intell., September, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 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

Anonymous Multi-Agent Path Finding with Individual Deadlines.

[BibT_eX]

[DOI]

Gilad Fine

Dor Atzmon

Noa Agmon

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

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Exploiting Geometric Constraints in Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks.

[BibT_eX]

[DOI]

Reza Mashayekhi

Dor Atzmon

Nathan R. Sturtevant

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Solving the Watchman Route Problem with Heuristic Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Multi-agent pathfinding with continuous time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Pavel Surynek

Dor Atzmon

Roni Stern

Artif. Intell., 2022

Meeting at the Border of Two Separate Domains.

[BibT_eX]

[DOI]

Alexandru Paul Tabacaru

Dor Atzmon

Ariel Felner

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Bounded-Cost Bi-Objective Heuristic Search.

[BibT_eX]

[DOI]

Carlos Hernández Ulloa

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 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

Safe Multi-Agent Pathfinding with Time Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

Studying Online Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Conflict-Free Multi-Agent Meeting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Robust Multi-Agent Path Finding and Executing.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

Generalizing Multi-Agent Path Finding for Heterogeneous Agents.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Multi-Directional Search.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Multi-Directional Heuristic Search.

[BibT_eX]

[DOI]

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

Probabilistic Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

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

2019

Multi-Agent Pathfinding (MAPF) with Continuous Time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Dor Atzmon

Roni Stern

CoRR, 2019

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution.

[BibT_eX]

[DOI]

Rotem Yoeli

Roni Stern

Dor Atzmon

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Probabilistic Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Dor Atzmon

Ariel Felner

Roni Stern

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Train Path Finding.

[BibT_eX]

[DOI]

Dor Atzmon

Amit Diei

Daniel Rave

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Pathfinding with Continuous Time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Dor Atzmon

Roni Stern

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

Online Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Bounded Suboptimal Game Tree Search.

[BibT_eX]

[DOI]

Dor Atzmon

Roni Stern

Abdallah Saffidine

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

2017

k-Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Dor Atzmon

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...