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
[c193]Daniel Koyfman, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner:
Minimizing State Exploration While Searching Graphs with Unknown Obstacles. AAMAS 2024: 1038-1046- [c192]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. AAMAS 2024: 2540-2542 - [c191]Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant:
On Parallel External-Memory Bidirectional Search. ECAI 2024: 4190-4197 - [c190]Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. ICAPS 2024: 643-652 - [c189]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 - [c188]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 - [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]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS 2016: 145-146 - 2015
- [j28]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219: 40-66 (2015) - [j27]Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony:
Repeated-task Canadian Traveler Problem. AI Commun. 28(3): 453-477 (2015) - [j26]Robert Morris, Blai Bonet, Marc Cavazza, Marie desJardins, Ariel Felner, Nick Hawes, Brad Knox, Sven Koenig, George Dimitri Konidaris, Jérôme Lang, Carlos Linares López, Daniele Magazzeni, Amy McGovern, Sriraam Natarajan, Nathan R. Sturtevant, Michael Thielscher, William Yeoh, Sebastian Sardiña, Kiri Wagstaff:
A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AI Mag. 36(3): 99-106 (2015) - [c92]Eli Boyarski, Ariel Felner, Guni Sharon, Roni Stern:
Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding. ICAPS 2015: 47-51 - [c91]Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, David Tolpin, Oded Betzalel, Solomon Eyal Shimony:
ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. IJCAI 2015: 740-746 - [c90]Roni Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max Is More than Min: Solving Maximization Problems with Heuristic Search. IJCAI 2015: 4324-4330 - [c89]Ariel Felner:
Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. SOCS 2015: 28-34 - [c88]Yisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Lior Rokach, Yuval Elovici, Bracha Shapira:
Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains. SOCS 2015: 70-77 - [c87]Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml:
Solving the Snake in the Box Problem with Heuristic Search: First Results. SOCS 2015: 96-104 - [c86]Oded Betzalel, Ariel Felner, Solomon Eyal Shimony:
Type System Based Rational Lazy IDA. SOCS 2015: 151-155 - [c85]Zahy Bnaya, Alon Palombo, Rami Puzis, Ariel Felner:
Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search. SOCS 2015: 156-160 - [c84]Vitali Sepetnitsky, Ariel Felner:
To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract). SOCS 2015: 218-219 - [c83]Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, Solomon Eyal Shimony:
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. SOCS 2015: 223-225 - 2014
- [j25]Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah, Ken Goldberg:
Potential-based bounded-cost search and Anytime Non-Parametric A*. Artif. Intell. 214: 1-25 (2014) - [j24]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
The Fifth Annual Symposium on Combinatorial Search. AI Commun. 27(4): 327-328 (2014) - [j23]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost. Ann. Math. Artif. Intell. 72(3-4): 267-295 (2014) - [j22]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Enhanced Partial Expansion A. J. Artif. Intell. Res. 50: 141-187 (2014) - [c82]Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. AAAI 2014: 871-877 - [c81]Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. ECAI 2014: 961-962 - [c80]David Tolpin, Oded Betzalel, Ariel Felner, Solomon Eyal Shimony:
Rational Deployment of Multiple Heuristics in IDA. ECAI 2014: 1107-1108 - [c79]Zahy Bnaya, Ariel Felner:
Conflict-Oriented Windowed Hierarchical Cooperative A∗. ICRA 2014: 3743-3748 - [c78]Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. SOCS 2014: 19-27 - [c77]Zhaoxing Bu, Roni Stern, Ariel Felner, Robert Craig Holte:
A* with Lookahead Re-Evaluated. SOCS 2014: 44-52 - [c76]Liron Samama-Kachko, Rami Puzis, Roni Stern, Ariel Felner:
Extended Framework for Target Oriented Network Intelligence Collection. SOCS 2014: 131-138 - [c75]Roni Tzvi Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max is More than Min: Solving Maximization Problems with Heuristic Search. SOCS 2014: 148-156 - [c74]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS 2014: 175-183 - [c73]Carlos Linares López, Roni Stern, Ariel Felner:
Solving the Target-Value Search Problem. SOCS 2014: 202-203 - [c72]Guni Sharon, Ariel Felner, Nathan R. Sturtevant:
Exponential Deepening A* for Real-Time Agent-Centered Search. SOCS 2014: 209-210 - [i8]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. CoRR abs/1401.3490 (2014) - [i7]Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte:
Predicting the Performance of IDA* using Conditional Distributions. CoRR abs/1401.3493 (2014) - [i6]Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. CoRR abs/1401.3843 (2014) - [i5]David Tolpin, Oded Betzalel, Ariel Felner, Solomon Eyal Shimony:
Rational Deployment of Multiple Heuristics in IDA. CoRR abs/1411.6593 (2014) - 2013
- [j21]Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner:
The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195: 470-495 (2013) - [c71]Zahy Bnaya, Rami Puzis, Roni Stern, Ariel Felner:
Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling. AAAI (Late-Breaking Developments) 2013 - [c70]Guni Sharon, Ariel Felner, Roni Stern, Nathan R. Sturtevant:
Partial Domain Search Tree For Constraint-Satisfaction Problems. AAAI (Late-Breaking Developments) 2013 - [c69]Roni Tzvi Stern, Liron Samama, Rami Puzis, Tal Beja, Zahy Bnaya, Ariel Felner:
TONIC: Target Oriented Network Intelligence Collection for the Social Web. AAAI 2013: 1184-1190 - [c68]Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited. IJCAI 2013: 601-607 - [c67]David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas:
Toward Rational Deployment of Multiple Heuristics in A. IJCAI 2013: 674-680 - [c66]Zahy Bnaya, Rami Puzis, Roni Stern, Ariel Felner:
Bandit Algorithms for Social Network Queries. SocialCom 2013: 148-153 - [c65]Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto:
Multi-Agent Path Finding for Self Interested Agents. SOCS 2013: 38-46 - [c64]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Optimal-Generation Variants of EPEA. SOCS 2013: 89-97 - [c63]Guni Sharon, Nathan R. Sturtevant, Ariel Felner:
Online Detection of Dead States in Real-Time Agent-Centered Search. SOCS 2013: 167-174 - [c62]Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited (Extended Abstract). SOCS 2013: 216-217 - [c61]David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas:
Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract). SOCS 2013: 220-221 - [i4]David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas:
Towards Rational Deployment of Multiple Heuristics in A*. CoRR abs/1305.5030 (2013) - 2012
- [j20]Roni Stern, Meir Kalech, Ariel Felner:
Finding patterns in an unknown graph. AI Commun. 25(3): 229-256 (2012) - [c60]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Jonathan Schaeffer, Robert Holte:
Partial-Expansion A* with Selective Node Generation. AAAI 2012: 471-477 - [c59]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. MAPF@AAAI 2012 - [c58]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search For Optimal Multi-Agent Path Finding. AAAI 2012: 563-569 - [c57]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. MAPF@AAAI 2012 - [c56]Nathan R. Sturtevant, Ariel Felner, Maxim Likhachev, Wheeler Ruml:
Heuristic Search Comes of Age. AAAI 2012: 2186-2191 - [c55]Asher Stern, Roni Stern, Ido Dagan, Ariel Felner:
Efficient Search for Transformation-based Inference. ACL (1) 2012: 283-291 - [c54]Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - [c53]Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml:
Faster Bounded-Cost Search Using Inadmissible Estimates. ICAPS 2012 - [c52]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. SOCS 2012: 97-104 - [c51]Marco Lippi, Marco Ernandes, Ariel Felner:
Efficient Single Frontier Bidirectional Search. SOCS 2012: 105-111 - [c50]Roni Tzvi Stern, Ariel Felner, Robert C. Holte:
Search-Aware Conditions for Probably Approximately Correct Heuristic Search. SOCS 2012: 112-119 - [c49]Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. SOCS 2012: 157-158 - [c48]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Robert Holte, Jonathan Schaeffer:
Partial-Expansion A* with Selective Node Generation. SOCS 2012: 180-181 - [c47]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). SOCS 2012: 186-187 - [c46]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. SOCS 2012: 190 - [e3]Ariel Felner, Nathan R. Sturtevant, Kostas E. Bekris, Roni Stern:
Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, MAPF@AAAI 2012, Toronto, Ontario, Canada, July 22, 2012. AAAI Technical Report WS-12-10, AAAI Press 2012, ISBN 978-1-57735-575-5 [contents] - [e2]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012. AAAI Press 2012 [contents] - 2011
- [j19]Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan R. Sturtevant, Zhifu Zhang:
Inconsistent heuristics in theory and practice. Artif. Intell. 175(9-10): 1570-1603 (2011) - [j18]Inon Zuckerman, Ariel Felner:
The MP-MIX Algorithm: Dynamic Search Strategy Selection in Multiplayer Adversarial Search. IEEE Trans. Comput. Intell. AI Games 3(4): 316-331 (2011) - [c45]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. AAAI 2011: 24-29 - [c44]Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A Bounded-Cost Search Algorithm. ICAPS 2011 - [c43]Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner:
The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI 2011: 662-667 - [c42]Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony:
Repeated-Task Canadian Traveler Problem. SOCS 2011: 24-30 - [c41]Ariel Felner:
Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. SOCS 2011: 47-51 - [c40]Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. SOCS 2011: 150-157 - [c39]Roni Stern, Ariel Felner, Robert Holte:
Probably Approximately Correct Heuristic Search. SOCS 2011: 158-163 - [c38]Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer:
The Compressed Differential Heuristic. SOCS 2011: 191-192 - [i3]Asaph Ben-Yair, Ariel Felner, Sarit Kraus, Nathan S. Netanyahu, Roni Stern:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. CoRR abs/1107.0041 (2011) - [i2]Ariel Felner, Sarit Hanan, Richard E. Korf:
Additive Pattern Database Heuristics. CoRR abs/1107.0050 (2011) - [i1]Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner:
A General Theory of Additive State Space Abstractions. CoRR abs/1111.0067 (2011) - 2010
- [j17]Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte:
Predicting the Performance of IDA* using Conditional Distributions. J. Artif. Intell. Res. 37: 41-83 (2010) - [j16]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. J. Artif. Intell. Res. 38: 85-133 (2010) - [j15]Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. J. Artif. Intell. Res. 39: 533-579 (2010) - [c37]Ariel Felner, Carsten Moldenhauer, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. AAAI 2010: 59-64 - [c36]Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. AAAI 2010: 155-160 - [c35]Roni Stern, Tamar Kulberis, Ariel Felner, Robert Holte:
Using Lookaheads with Optimal Best-First Search. AAAI 2010: 185-190 - [c34]Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech:
Ants meeting algorithms. AAMAS 2010: 567-574 - [c33]Roni Stern, Meir Kalech, Ariel Felner:
Searching for a k-clique in unknown graphs. AAMAS 2010: 1391-1392 - [c32]Emily Rozenshine-Kemelmakher, Rami Puzis, Ariel Felner, Yuval Elovici:
Cost Benefit Deployment of DNIPS. ICC 2010: 1-5 - [c31]Meir Goldenberg, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Portal-Based True-Distance Heuristics for Path Finding. SOCS 2010: 39-45 - [c30]Roni Tzvi Stern, Meir Kalech, Ariel Felner:
Searching for a k-Clique in Unknown Graphs. SOCS 2010: 83-89 - [c29]Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A New Greedy Anytime Heuristic Search. SOCS 2010: 119-120 - [c28]Carsten Moldenhauer, Ariel Felner, Nathan R. Sturtevant, Jonathan Schaeffer:
Single-Frontier Bidirectional Search. SOCS 2010: 151-152 - [c27]Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein, Ariel Felner:
Search Space Reduction Using Swamp Hierarchies. SOCS 2010: 155-156 - [e1]Ariel Felner, Nathan R. Sturtevant:
Proceedings of the Third Annual Symposium on Combinatorial Search, SOCS 2010, Stone Mountain, Atlanta, Georgia, USA, July 8-10, 2010. AAAI Press 2010 [contents]
2000 – 2009
- 2009
- [c26]Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony:
Canadian Traveler Problem with Remote Sensing. IJCAI 2009: 437-442 - [c25]Nathan R. Sturtevant, Ariel Felner, Max Barer, Jonathan Schaeffer, Neil Burch:
Memory-Based Heuristics for Explicit State Spaces. IJCAI 2009: 609-614 - [c24]Zhifu Zhang, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner:
A* Search with Inconsistent Heuristics. IJCAI 2009: 634-639 - [c23]Inon Zuckerman, Ariel Felner, Sarit Kraus:
Mixing Search Strategies for Multi-Player Games. IJCAI 2009: 646-652 - [c22]Ariel Felner, Nathan R. Sturtevant:
Abstraction-Based Heuristics with True Distance Computations. SARA 2009 - 2008
- [j14]Uzi Zahavi, Ariel Felner, Robert C. Holte, Jonathan Schaeffer:
Duality in permutation state spaces and the dual search algorithm. Artif. Intell. 172(4-5): 514-540 (2008) - [j13]Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner:
A General Theory of Additive State Space Abstractions. J. Artif. Intell. Res. 32: 631-662 (2008) - [c21]Mehdi Samadi, Ariel Felner, Jonathan Schaeffer:
Learning from Multiple Heuristics. AAAI 2008: 357-362 - [c20]Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte:
Predicting the Performance of IDA* with Conditional Distributions. AAAI 2008: 381-386 - [c19]William Yeoh, Ariel Felner, Sven Koenig:
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. AAMAS (2) 2008: 591-598 - [c18]William Yeoh, Ariel Felner, Sven Koenig:
IDB-ADOPT: A Depth-First Search DCOP Algorithm. CSCLP 2008: 132-146 - [c17]Mehdi Samadi, Maryam Siabani, Ariel Felner, Robert Holte:
Compressing Pattern Databases with Learning. ECAI 2008: 495-499 - 2007
- [j12]Ariel Felner, Roni Stern, Jeffrey S. Rosenschein, Alex Pomeransky:
Searching for close alternative plans. Auton. Agents Multi Agent Syst. 14(3): 209 (2007) - [j11]Ariel Felner, Roni Stern, Jeffrey S. Rosenschein, Alex Pomeransky:
Searching for close alternative plans. Auton. Agents Multi Agent Syst. 14(3): 211-237 (2007) - [j10]Ariel Felner, Richard E. Korf, Ram Meshulam, Robert C. Holte:
Compressed Pattern Databases. J. Artif. Intell. Res. 30: 213-247 (2007) - [c16]Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner:
Theta*: Any-Angle Path Planning on Grids. AAAI 2007: 1177-1183 - [c15]Uzi Zahavi, Ariel Felner, Jonathan Schaeffer, Nathan R. Sturtevant:
Inconsistent Heuristics. AAAI 2007: 1211-1216 - [c14]Richard E. Korf, Ariel Felner:
Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem. IJCAI 2007: 2324-2329 - [c13]Ariel Felner, Nir Ofek:
Combining Perimeter Search and Pattern Database Abstractions. SARA 2007: 155-168 - 2006
- [j9]Ariel Felner, Yaron Shoshani, Yaniv Altshuler, Alfred M. Bruckstein:
Multi-agent Physical A* with Large Pheromones. Auton. Agents Multi Agent Syst. 12(1): 3-34 (2006) - [j8]Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam, David Furcy:
Maximizing over multiple pattern databases speeds up heuristic search. Artif. Intell. 170(16-17): 1123-1136 (2006) - [j7]Wolfgang Achtner, Esma Aïmeur, Sarabjot Singh Anand, Douglas E. Appelt, Naveen Ashish, Tiffany Barnes, Joseph E. Beck, M. Bernardine Dias, Prashant Doshi, Chris Drummond, William Elazmeh, Ariel Felner, Dayne Freitag, Hector Geffner, Christopher W. Geib, Richard Goodwin, Robert C. Holte, Frank Hutter, Fair Isaac, Nathalie Japkowicz, Gal A. Kaminka, Sven Koenig, Michail G. Lagoudakis, David B. Leake, Lundy Lewis, Hugo Liu, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Pascal Poupart, David V. Pynadath, Thomas Roth-Berghofer, Wheeler Ruml, Stefan Schulz, Sven Schwarz, Stephanie Seneff, Amit P. Sheth, Ron Sun, Michael Thielscher, Afzal Upal, Jason D. Williams, Steve J. Young, Dmitry Zelenko:
Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program. AI Mag. 27(4): 92-102 (2006) - [c12]Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan Schaeffer:
Dual Search in Permutation State Spaces. AAAI 2006: 1076-1081 - [c11]Arnon Gilboa, Amnon Meisels, Ariel Felner:
Distributed navigation in an unknown physical environment. AAMAS 2006: 553-560 - 2005
- [j6]Ariel Felner:
Finding optimal solutions to the graph partitioning problem with heuristic search. Ann. Math. Artif. Intell. 45(3-4): 293-322 (2005) - [c10]Ram Meshulam, Ariel Felner, Sarit Kraus:
Utility-based multi-agent system for performing repeated navigation tasks. AAMAS 2005: 887-894 - [c9]Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Robert C. Holte:
Dual Lookups in Pattern Databases. IJCAI 2005: 103-108 - [c8]Ariel Felner, Amir Adler:
Solving the 24 Puzzle with Instance Dependent Pattern Databases. SARA 2005: 248-260 - 2004
- [j5]Omid David-Tabibi, Ariel Felner, Nathan S. Netanyahu:
Blockage Detection in Pawn Endgames. J. Int. Comput. Games Assoc. 27(3): 150-158 (2004) - [j4]Ariel Felner, Roni Stern, Sarit Kraus, Asaph Ben-Yair, Nathan S. Netanyahu:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. J. Artif. Intell. Res. 21: 631-670 (2004) - [j3]Ariel Felner, Richard E. Korf, Sarit Hanan:
Additive Pattern Database Heuristics. J. Artif. Intell. Res. 22: 279-318 (2004) - [c7]Ariel Felner, Ram Meshulam, Robert C. Holte, Richard E. Korf:
Compressing Pattern Databases. AAAI 2004: 638-643 - [c6]Robert C. Holte, Jack Newton, Ariel Felner, Ram Meshulam, David Furcy:
Multiple Pattern Databases. ICAPS 2004: 122-131 - [c5]Ariel Felner, Yaron Shoshani, Israel A. Wagner, Alfred M. Bruckstein:
Large Pheromones: A Case Study with Multi-agent Physical A*. ANTS Workshop 2004: 366-373 - [c4]Ariel Felner, Yaron Shoshani, Israel A. Wagner, Alfred M. Bruckstein:
Multi-Agent Physical A* Using Large Pheromones. AAMAS 2004: 1236-1237 - [c3]Omid David-Tabibi, Ariel Felner, Nathan S. Netanyahu:
Blockage Detection in Pawn Endings. Computers and Games 2004: 187-201 - 2003
- [j2]Ariel Felner, Sarit Kraus, Richard E. Korf:
KBFS: K-Best-First Search. Ann. Math. Artif. Intell. 39(1-2): 19-39 (2003) - [c2]Ariel Felner, Alex Pomeransky, Jeffrey S. Rosenschein:
Searching for an alternative plan. AAMAS 2003: 33-40 - 2002
- [j1]Richard E. Korf, Ariel Felner:
Disjoint pattern database heuristics. Artif. Intell. 134(1-2): 9-22 (2002) - [c1]Ariel Felner, Roni Stern, Sarit Kraus:
PHA*: performing A* in unknown physical environments. AAMAS 2002: 240-247
Coauthor Index
Carlos Hernández 0003
aka: Carlos Hernández Ulloa
aka: Carlos Hernández Ulloa
Roni Stern
aka: Roni Tzvi Stern
aka: Roni Tzvi Stern
[c187] [c173] [c172] [j39] [c163] [j37] [c150] [j36] [c148] [c147] [j35] [c127] [c126] [i12] [c119] [c114] [c112] [c107] [c105] [c103] [c102] [c101] [i9] [j31] [c98] [c97] [c96] [c95] [c93] [j28] [c92] [c91] [c90] [c88] [c87] [c83] [j25] [j23] [j22] [c81] [c78] [c77] [c76] [c75] [c73] [j21] [c71] [c70] [c69] [c68] [c66] [c65] [c62] [j20] [c60] [c59] [c58] [c57] [c55] [c54] [c53] [c52] [c50] [c49] [c48] [c47] [c46] [e3] [c44] [c43] [c40] [c39] [i3] [c35] [c33] [c30] [c29] [j12] [j11] [j4] [c1]
[c192] [c191] [c186] [c185] [c180] [j40] [c179] [c175] [c170] [i13] [c165] [c157] [c156] [c152] [c149] [c148] [c145] [c143] [c141] [c138] [c134] [c129] [c128] [c127] [c123] [c122] [i12] [c121] [c116] [c113] [j33] [j32] [c110] [c107] [c106] [c104] [c99] [c94] [j28] [j26] [j24] [j22] [c82] [c74] [c72] [c70] [c64] [c63] [c60] [c58] [c57] [c56] [c52] [c48] [c46] [e3] [e2] [j19] [c45] [c38] [c37] [c31] [c28] [e1] [c25] [c24] [c22] [c15]
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-28 21:13 CET 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:
