default search action
Dor Atzmon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles. AAMAS 2024: 1038-1046 - [c32]Jirí Svancara, Dor Atzmon, Klaus Strauch, Roland Kaminski, Torsten Schaub:
Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends. ICAART (3) 2024: 23-33 - [c31]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Theoretical Study on Multi-objective Heuristic Search. IJCAI 2024: 7021-7028 - [c30]Shahar Bardugo, Dor Atzmon:
Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 259-260 - [c29]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). SOCS 2024: 273-274 - 2023
- [j5]Dor Atzmon, Ariel Felner, Jiaoyang Li
, Shahaf S. Shperberg
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322: 103950 (2023) - [c28]Reza Mashayekhi, Dor Atzmon, Nathan R. Sturtevant:
Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks. AAAI 2023: 12473-12481 - [c27]Dor Atzmon, Sara Bernardini, Fabio Fagnani, David Fairbairn
Exploiting Geometric Constraints in Multi-Agent Pathfinding. ICAPS 2023: 17-25 - [c26]Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant:
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. ICAPS 2023: 26-30 - [c25]Gilad Fine, Dor Atzmon, Noa Agmon:
Anonymous Multi-Agent Path Finding with Individual Deadlines. AAMAS 2023: 869-877 - [c24]Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner:
Optimally Solving the Multiple Watchman Route Problem with Heuristic Search. AAMAS 2023: 905-913 - [c23]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - 2022
- [j4]Anton Andreychuk, Konstantin S. Yakovlev
Multi-agent pathfinding with continuous time. Artif. Intell. 305: 103662 (2022) - [j3]Shawn Skyler, Dor Atzmon, Tamir Yaffe, Ariel Felner:
Solving the Watchman Route Problem with Heuristic Search. J. Artif. Intell. Res. 75: 747-793 (2022) - [c22]Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig:
On Merging Agents in Multi-Agent Pathfinding Algorithms. SOCS 2022: 11-19 - [c21]Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski:
Online Multi-Agent Path Finding: New Results. SOCS 2022: 229-233 - [c20]Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Bounded-Cost Bi-Objective Heuristic Search. SOCS 2022: 239-243 - [c19]Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner:
Meeting at the Border of Two Separate Domains. SOCS 2022: 244-248 - [c18]Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner:
Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract). SOCS 2022: 302-304 - 2021
- [j2]Tomer Shahar, Shashank Shekhar, Dor Atzmon, Abdallah Saffidine, Brendan Juba, Roni Stern:
Safe Multi-Agent Pathfinding with Time Uncertainty. J. Artif. Intell. Res. 70: 923-954 (2021) - [c17]Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. ICAPS 2021: 16-24 - [c16]Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. SOCS 2021: 147-149 - [c15]Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski:
Studying Online Multi-Agent Path Finding. SOCS 2021: 228-230 - 2020
- [j1]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67: 549-579 (2020) - [c14]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c13]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c12]Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner:
Generalizing Multi-Agent Path Finding for Heterogeneous Agents. SOCS 2020: 101-105 - [c11]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122
2010 – 2019
- 2019
- [c10]Jirí Svancara
Online Multi-Agent Pathfinding. AAAI 2019: 7732-7739 - [c9]Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern:
Multi-Agent Pathfinding with Continuous Time. IJCAI 2019: 39-45 - [c8]Dor Atzmon, Amit Diei, Daniel Rave:
Multi-Train Path Finding. SOCS 2019: 125-129 - [c7]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-158 - [c6]Dor Atzmon, Ariel Felner, Roni Stern:
Probabilistic Robust Multi-Agent Path Finding. SOCS 2019: 162-163 - [c5]Rotem Yoeli, Roni Stern, Dor Atzmon:
Measuring the Vulnerability of a Multi-Agent Pathfinding Solution. SOCS 2019: 208-209 - [i2]Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern:
Multi-Agent Pathfinding (MAPF) with Continuous Time. CoRR abs/1901.05506 (2019) - [i1]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - 2018
- [c4]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. AAMAS 2018: 1862-1864 - [c3]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. SOCS 2018: 2-9 - [c2]Dor Atzmon, Roni Stern, Abdallah Saffidine:
Bounded Suboptimal Game Tree Search. SOCS 2018: 10-18 - 2017
- [c1]Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. SOCS 2017: 157-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: