default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAriel Felner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c191]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles. AAMAS 2024: 1038-1046- [c190]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. AAMAS 2024: 2540-2542 - [c189]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. ICAPS 2024: 643-652 - [c188]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: 680-688 - [c187]Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern:
Prioritised Planning with Guarantees. SOCS 2024: 82-90 - [c186]Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant:
On the Properties of All-Pair Heuristics. SOCS 2024: 127-133 - [c185]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. SOCS 2024: 152-160 - [c184]Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS 2024: 179-187 - [c183]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: 208-212 - [c182]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: 228-232 - [c181]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). SOCS 2024: 273-274 - [c180]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search (Extended Abstract). SOCS 2024: 283-284 - [e4]Ariel Felner, Jiaoyang Li:
Seventeenth International Symposium on Combinatorial Search, SOCS 2024, Kananaskis, Alberta, Canada, June 6-8, 2024. AAAI Press 2024 [contents] - 2023
- [j40]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: 103950 (2023) - [c179]Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant:
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. ICAPS 2023: 26-30 - [c178]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: 452-461 - [c177]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 - [c176]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. ECAI 2023: 2607-2614 - [c175]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: 5631-5638 - [c174]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: 6759-6768 - [c173]Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig:
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS 2023: 11-19 - [c172]Jonathan Morag, Roni Stern, Ariel Felner:
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. SOCS 2023: 47-55 - [c171]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: 101-109 - [c170]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search. SOCS 2023: 158-162 - [c169]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 - [i14]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. CoRR abs/2308.08453 (2023) - [i13]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. CoRR abs/2312.16106 (2023) - 2022
- [j39]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: 553-618 (2022) - [j38]Shawn Skyler, Dor Atzmon, Tamir Yaffe, Ariel Felner:
Solving the Watchman Route Problem with Heuristic Search. J. Artif. Intell. Res. 75: 747-793 (2022) - [c168]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: 394-403 - [c167]Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig:
On Merging Agents in Multi-Agent Pathfinding Algorithms. SOCS 2022: 11-19 - [c166]Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner:
Generalized Longest Path Problems. SOCS 2022: 56-64 - [c165]Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner:
Optimal Search with Neural Networks: Challenges and Approaches. SOCS 2022: 109-117 - [c164]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. SOCS 2022: 199-207 - [c163]Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski:
Online Multi-Agent Path Finding: New Results. SOCS 2022: 229-233 - [c162]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 - [c161]Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner:
Meeting at the Border of Two Separate Domains. SOCS 2022: 244-248 - [c160]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
- [j37]Roni Stern, Meir Goldenberg, Abdallah Saffidine, Ariel Felner:
Heuristic search for one-to-many shortest path queries. Ann. Math. Artif. Intell. 89(12): 1175-1214 (2021) - [c159]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: 12241-12248 - [c158]Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. ICAPS 2021: 16-24 - [c157]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory. ICAPS 2021: 331-339 - [c156]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. ICAPS 2021: 385-395 - [c155]Tamir Yaffe, Shawn Skyler, Ariel Felner:
Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. SOCS 2021: 106-114 - [c154]Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish:
The Closed List is an Obstacle Too. SOCS 2021: 121-125 - [c153]Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. SOCS 2021: 147-149 - [c152]Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. SOCS 2021: 194-196 - [c151]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. SOCS 2021: 213-215 - [c150]Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski:
Studying Online Multi-Agent Path Finding. SOCS 2021: 228-230 - 2020
- [j36]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: 549-579 (2020) - [c149]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. AAAI 2020: 7277-7284 - [c148]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c147]Yossi Cohen, Roni Stern, Ariel Felner:
Solving the Longest Simple Path Problem with Heuristic Search. ICAPS 2020: 75-79 - [c146]Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner:
Solving the Watchman Route Problem on a Grid with Heuristic Search. ICAPS 2020: 249-257 - [c145]Nathan R. Sturtevant, Shahaf S. Shperberg, Ariel Felner, Jingwei Chen:
Predicting the Effectiveness of Bidirectional Heuristic Search. ICAPS 2020: 281-290 - [c144]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. AAMAS 2020: 726-734 - [c143]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c142]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c141]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound. IJCAI 2020: 4775-4779 - [c140]Shahaf S. Shperberg, Ariel Felner:
On the Differences and Similarities of fMM and GBFHS. SOCS 2020: 66-74 - [c139]Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner:
Generalizing Multi-Agent Path Finding for Heterogeneous Agents. SOCS 2020: 101-105 - [c138]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122 - [c137]Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner:
F-Cardinal Conflicts in Conflict-Based Search. SOCS 2020: 123-124 - [c136]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. SOCS 2020: 131-132 - [c135]Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner:
Solving the Watchman Route Problem on a Grid with Heuristic Search. SOCS 2020: 139-140
2010 – 2019
- 2019
- [j35]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): 1447-1480 (2019) - [c134]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms. AAAI 2019: 2379-2386 - [c133]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c132]Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS 2019: 273-278 - [c131]Reuth Mirsky, Ya'ar Shalom, Ahmad Majadly, Kobi Gal, Rami Puzis, Ariel Felner:
New Goal Recognition Algorithms Using Attack Graphs. CSCML 2019: 260-278 - [c130]Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. IJCAI 2019: 442-449 - [c129]Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein:
Optimally Efficient Bidirectional Search. IJCAI 2019: 6221-6225 - [c128]Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun:
Improving Bidirectional Heuristic Search by Bounds Propagation. SOCS 2019: 106-114 - [c127]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 - [c126]Dor Atzmon, Ariel Felner, Roni Stern:
Probabilistic Robust Multi-Agent Path Finding. SOCS 2019: 162-163 - [c125]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: 182-183 - [c124]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c123]Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun:
Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. SOCS 2019: 196-197 - [c122]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. SOCS 2019: 204-205 - [i12]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
- [j34]Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin, Ariel Felner:
Rational deployment of multiple heuristics in optimal state-space search. Artif. Intell. 256: 181-210 (2018) - [c121]Nathan R. Sturtevant, Ariel Felner:
A Brief History and Recent Achievements in Bidirectional Search. AAAI 2018: 8000-8007 - [c120]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: 83-87 - [c119]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. AAMAS 2018: 1862-1864 - [c118]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS 2018: 2004-2006 - [c117]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [c116]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Extended Increasing Cost Tree Search for Non-Unit Cost Domains. IJCAI 2018: 534-540 - [c115]Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Anytime Focal Search with Applications. IJCAI 2018: 1434-1441 - [c114]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. SOCS 2018: 2-9 - [c113]Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein:
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. SOCS 2018: 81-89 - [c112]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS 2018: 99-105 - [c111]Ariel Felner:
Position Paper: Using Early Goal Test in A. SOCS 2018: 153-157 - [i11]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR abs/1805.04961 (2018) - [i10]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. CoRR abs/1806.04216 (2018) - 2017
- [j33]Robert C. Holte, Ariel Felner, Guni Sharon, Nathan R. Sturtevant, Jingwei Chen:
MM: A bidirectional search algorithm that is guaranteed to meet in the middle. Artif. Intell. 252: 232-266 (2017) - [j32]Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan R. Sturtevant, Jonathan Schaeffer:
The compressed differential heuristic. AI Commun. 30(6): 393-418 (2017) - [c110]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Value Compression of Pattern Databases. AAAI 2017: 912-918 - [c109]Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski:
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. ICAART (2) 2017: 85-95 - [c108]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: 116-136 - [c107]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: 29-37 - [c106]Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant:
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search. SOCS 2017: 82-90 - [c105]Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search on Weighted Graphs. SOCS 2017: 119-123 - [c104]Malte Helmert, Nathan R. Sturtevant, Ariel Felner:
On Variable Dependencies and Compressed Pattern Databases. SOCS 2017: 129-133 - [c103]Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. SOCS 2017: 157-158 - [c102]Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Shortest Path for K Goals. SOCS 2017: 167-168 - [c101]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS 2017: 169-170 - [c100]Shahaf S. Shperberg, Solomon Eyal Shimony, Ariel Felner:
Monte-Carlo Tree Search using Batch Value of Perfect Information. UAI 2017 - [i9]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. CoRR abs/1707.00228 (2017) - 2016
- [j31]Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte:
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces. Artif. Intell. 230: 51-73 (2016) - [j30]Marco Lippi, Marco Ernandes, Ariel Felner:
Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search. AI Commun. 29(4): 513-536 (2016) - [j29]Ariel Felner:
The Israeli AI Community. AI Mag. 37(3): 118-122 (2016) - [c99]Robert C. Holte, Ariel Felner, Guni Sharon, Nathan R. Sturtevant:
Bidirectional Search That Is Guaranteed to Meet in the Middle. AAAI 2016: 3411-3417 - [c98]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). AAMAS 2016: 1435-1436 - [c97]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. ECAI 2016: 810-818 - [c96]Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search - A New Bounded Suboptimal Search. SOCS 2016: 36-44 - [c95]Vitali Sepetnitsky, Ariel Felner, Roni Stern:
Repair Policies for Not Reopening Nodes in Different Search Settings. SOCS 2016: 81-88 - [c94]Guni Sharon, Robert C. Holte, Ariel Felner, Nathan R. Sturtevant:
Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search. SOCS 2016: 139-140 - [c93]