Ariel Felner

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 130

Top Venues

Publications

Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. AAMAS (2024)
Carlos Hernández Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. SOCS (2024)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. SOCS (2024)
Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner
Minimizing State Exploration While Searching Graphs with Unknown Obstacles. AAMAS (2024)
Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern
Prioritised Planning with Guarantees. SOCS (2024)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS (2024)
Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS (2024)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. SOCS (2024)
Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). SOCS (2024)
Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant
On Parallel External-Memory Bidirectional Search (Extended Abstract). SOCS (2024)
Eyal Weiss, Ariel Felner, Gal A. Kaminka
Tightest Admissible Shortest Path. ICAPS (2024)
Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant
On the Properties of All-Pair Heuristics. SOCS (2024)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. CoRR (2023)
Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant
Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds. IJCAI (2023)
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)
Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. ICAPS (2023)
Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS (2023)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS (2023)
Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven Koenig
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. IJCAI (2023)
Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS (2023)
Jonathan Morag, Roni Stern, Ariel Felner
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. SOCS (2023)
Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner
Optimally Solving the Multiple Watchman Route Problem with Heuristic Search. AAMAS (2023)
Eyal Weiss, Ariel Felner, Gal A. Kaminka
Tightest Admissible Shortest Path. CoRR (2023)
Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. ICAPS (2023)
Eyal Weiss, Ariel Felner, Gal A. Kaminka
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. ECAI (2023)
Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322 (2023)
Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner
Meeting at the Border of Two Separate Domains. SOCS (2022)
Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig
On Merging Agents in Multi-Agent Pathfinding Algorithms. SOCS (2022)
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)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
Anytime Approximate Bi-Objective Search. SOCS (2022)
Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner
Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. J. Artif. Intell. Res. 73 (2022)
Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner
Generalized Longest Path Problems. SOCS (2022)
Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner
Optimal Search with Neural Networks: Challenges and Approaches. SOCS (2022)
Shawn Skyler, Dor Atzmon, Tamir Yaffe, Ariel Felner
Solving the Watchman Route Problem with Heuristic Search. J. Artif. Intell. Res. 75 (2022)
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)
Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski
Online Multi-Agent Path Finding: New Results. SOCS (2022)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS (2022)
Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. SOCS (2021)
Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish
The Closed List is an Obstacle Too. SOCS (2021)
Tamir Yaffe, Shawn Skyler, Ariel Felner
Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. SOCS (2021)
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig
Further Improved Heuristics For Conflict-Based Search. SOCS (2021)
Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner
Conflict-Free Multi-Agent Meeting. SOCS (2021)
Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski
Studying Online Multi-Agent Path Finding. SOCS (2021)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar
Conflict-Based Increasing Cost Search. ICAPS (2021)
Roni Stern, Meir Goldenberg, Abdallah Saffidine, Ariel Felner
Heuristic search for one-to-many shortest path queries. Ann. Math. Artif. Intell. 89 (12) (2021)
Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory. ICAPS (2021)
Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig
f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. AAAI (2021)
Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner
Conflict-Free Multi-Agent Meeting. ICAPS (2021)
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig
Multi-Directional Heuristic Search. IJCAI (2020)
Nathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen
Predicting the Effectiveness of Bidirectional Heuristic Search. ICAPS (2020)
Shahaf S. Shperberg, Ariel Felner
On the Differences and Similarities of fMM and GBFHS. SOCS (2020)
Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner
Solving the Watchman Route Problem on a Grid with Heuristic Search. ICAPS (2020)
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig
Multi-Directional Search. SOCS (2020)
Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound. IJCAI (2020)
Yossi Cohen, Roni Stern, Ariel Felner
Solving the Longest Simple Path Problem with Heuristic Search. ICAPS (2020)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. AAAI (2020)
Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner
Solving the Watchman Route Problem on a Grid with Heuristic Search. SOCS (2020)
Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner
F-Cardinal Conflicts in Conflict-Based Search. SOCS (2020)
Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig
Probabilistic Robust Multi-Agent Path Finding. ICAPS (2020)
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Moving Agents in Formation in Congested Environments. SOCS (2020)
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Moving Agents in Formation in Congested Environments. AAMAS (2020)
Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner
Generalizing Multi-Agent Path Finding for Heterogeneous Agents. SOCS (2020)
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67 (2020)
Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig
Iterative-Deepening Conflict-Based Search. IJCAI (2020)
Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. IJCAI (2019)
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)
Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. SOCS (2019)
Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun
Enriching Non-Parametric Bidirectional Search Algorithms. AAAI (2019)
Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. SOCS (2019)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. SOCS (2019)
Rami Puzis, Liron Samama-Kachko, Barak Hagbi, Roni Stern, Ariel Felner
Target oriented network intelligence collection: effective exploration of social networks. World Wide Web 22 (4) (2019)
Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun
Improving Bidirectional Heuristic Search by Bounds Propagation. SOCS (2019)
Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein
Optimally Efficient Bidirectional Search. IJCAI (2019)
Dor Atzmon, Ariel Felner, Roni Stern
Probabilistic Robust Multi-Agent Path Finding. SOCS (2019)
Reuth Mirsky, Ya'ar Shalom, Ahmad Majadly, Kobi Gal, Rami Puzis, Ariel Felner
New Goal Recognition Algorithms Using Attack Graphs. CSCML (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. SOCS (2019)
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 (2019)
Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. AAAI (2019)
Ariel Felner
Position Paper: Using Early Goal Test in A. SOCS (2018)
Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin, Ariel Felner
Rational deployment of multiple heuristics in optimal state-space search. Artif. Intell. 256 (2018)
Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig
Anytime Focal Search with Applications. IJCAI (2018)
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
Robust Multi-Agent Path Finding. SOCS (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS (2018)
Nathan R. Sturtevant, Ariel Felner
A Brief History and Recent Achievements in Bidirectional Search. AAAI (2018)
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
Extended Increasing Cost Tree Search for Non-Unit Cost Domains. IJCAI (2018)
Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines. CoRR (2018)
Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. SOCS (2018)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS (2018)
Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou
Robust Multi-Agent Path Finding. AAMAS (2018)
Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Deadlines. IJCAI (2018)
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS (2017)
Daniel Gilon, Ariel Felner, Roni Stern
Dynamic Potential Search on Weighted Graphs. SOCS (2017)
Shahaf S. Shperberg, Solomon Eyal Shimony, Ariel Felner
Monte-Carlo Tree Search using Batch Value of Perfect Information. UAI (2017)
Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan R. Sturtevant, Jonathan Schaeffer
The compressed differential heuristic. AI Commun. 30 (6) (2017)
Nathan R. Sturtevant, Ariel Felner, Malte Helmert
Value Compression of Pattern Databases. AAAI (2017)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS (2017)
Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski
Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. ICAART (Revised Selected Papers) (2017)

Ariel Felner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ariel Felner