Publications

Lisit of papers that appeared in rigorously refereed venues

2024

[186] 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

[185] 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

[184] 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

[183] J Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner:
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. SOCS 2024: 152-160

[182] Shahaf S. Shperberg, Ariel Felner, Lior Siag, Nathan R. Sturtevant: On the Properties of All-Pair Heuristics. SOCS 2024: 127-133

[181] Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern: Prioritised Planning with Guarantees. SOCS 2024: 82-90

[180] 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-68

[179] Eyal Weiss, Ariel Felner, Gal A. Kaminka: "Tightest Admissible Shortest Path". ICAPS 2024: 643-652

[178] Danny Koyfman, Dor Atzmon, Shahah Shperberg, Ariel Felner. "Minimizing State Exploration While Searching Graphs with Unknown Obstacles”, AAMAS 2024.

2023

[177] Dor Atzmon, Ariel Felner, Jiaoyang Li, Shahaf Shperberg, Nathan Sturtevant, Sven Koenig. ”Conflict-Tolerant and Conflict-Free Multi-Agent Meeting", Artificial Intelligence (AIJ) 322:103-150, 2023

[176] Yacov Livne, Dor Atzmon, Eli Boyarsky, Shawn Skyler, Amor Shapiro, Ariel Felner, “Optimally Solving the Multiple Watchman Route Problem with Heuristic Search, AAMAS-2023-2023.

[175] Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hern ́andez Ulloa, Sven Koenig: “Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.” ICAPS-2023.

[174] Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant, “W-restrained Bidirectional Bounded-Suboptimal Heuristic Search”, ICAPS-2023

[173] Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, "Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search”, SoCS-2023

[172] Jonathan Morag, Roni Stern, Ariel Felner, “Adapting to Planning Failures in Lifelong Multi-Agent Path Finding”, SoCS-2023

[171] Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig, “Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding”, SoCS-2023

[170] Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hern´andez Ulloa, Sven Koenig. “Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics”, SoCS-2023

[169] Carlos Hernandez, William Yeoh, Jorge Baier, Ariel Felner, Han Zhang, Oren Salzman, T. K. Satish Kumar, Carlos Hernandez Ulloa, Sven Koenig: “A Generalization of Bi-Objective A* to Multiple Objectives.”, IJCAI-2023.

[168] Lior Siag, Shahaf Shperberg, Ariel Felner, Nathan Sturtevant, “Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds”. IJCAI-2023

[167] Oren Salzman, Ariel Felner, Carlos Hernandez, Han Zhang, Shao-Hung Chan, Sven Koenig, “Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities”, IJCAI-2023.

[166] Eyal Weiss, Gal A. Kaminka, Ariel Felner, "A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates”, ECAI-2023

2022

[165] Shawn Skyler, Tamir Yaffe, Dor Atzmon and Ariel Felner. “Solving the Watchman Route Problem with Heuristic Search”, J. Artif. Intell. Res. 75: 747-791 (2023)

[164] 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)

[163] Gal Dahan, Itay Tabib, Eyal Solomon Shimony, Ariel Felner:

“Generalized Longest Path Problems”, SoCS-2022.

[162] Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig,

“On Merging Agents in Multi-Agent Pathfinding Algorithms” SoCS-2022.

[161] Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner,

“Meeting at the Border of Two Separate Domains”, SoCS-2022.

[160] Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman Han Zhang, Sven Koenig,

William Yeoh, Carlos Hernandez Ulloa, “Bounded-Cost Bi-Objective Heuristic Search”,

SoCS-2022.

[159] Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski,

“Online Multi-Agent Path Finding: New Results”, SoCS-2022.

[158] Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hern ́andez Ulloa,

Sven Koenig, “Anytime Approximate Bi-Objective Search”, SoCS-2022.

[157] Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner,

“Optimal Search with Neural Networks: Challenges and Approaches”, SoCS-2022.

[156] Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hern ́andez Ulloa,

Sven Koenig , “A*pex: Efficient Approximate Multi-Objective Search on Graphs”,

ICAPS-2022

2021

[155] Roni Stern, Meir Goldenberg, Abdallah Saffidine, Ariel Felner:

"Heuristic search for one-to-many shortest path queries", Annals of Mathematics and

Artificial Intelligence

[154] Ariel Felner, Hadar Buzhish and Shahaf S. Shperberg :

"The Closed-list is an Obstacle too". SoCS-2021

[153] Tamir Jaffey, Shawn Skyler, Ariel Felner:

"Suboptimallt Solving the Watchman Route Problem on a Grid with Heuristic Search",

ISoCS-2021

[152] Shahaf S. Shperberg , Steven Danishevski, Ariel Felner and Nathan R. Sturtevant:

"Iterative-deepening Bidirectional Heuristic Search with Restricted Memory".

ICAPS-2021

[151] Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:

"Conflict-Free Mutli-Agent Meeting", ICAPS-2021.

[150] Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li and

T.K. Satish Kumar: "Conflict-Based Increasing Cost Search", ICAPS-2021.

[149] Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:

"f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search", AAAI-

2022.

2020

[147] Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Eyal Shimony and Avi Hayoun:

"Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound".

IJCAI-2020. In the Sister Conference Best-paper Award Track at IJCAI-2020.

[146] Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg,

Nathan Sturtevant and Sven Koenig: "Multi-Directional Heuristic Search", IJCAI-2020.

[145] Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen,

Jiaoyang Li, and Sven Koenig: "Iterative-Deepening Conflict-Based Search", IJCAI-2020.

[144] Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner:

"Generalizing Multi-Agent Path Finding for Heterogeneous Agents", SoCS-2020.

[143] Shahaf S. Shperberg, Ariel Felner:

"On the Differences and Similarities of fMM and GBFHS". SoCS-2020.

[142] Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner:

"Solving the Watchman Route Problem on a Grid with Heuristic Search", ICAPS-2020.

[141] Nathan Sturtevant, Shahaf Shprerberg, Ariel Felner, Jingwei Chen:

"Predicting the Effectiveness of Bidirectional Heuristic Search", ICAPS-2020.

[140] Dor Atzmon, Ariel Felner, Roni Stern, Nathan Sturtevant, Sven Koenig:

"Probabilistic Robust Multi-Agent Path Finding". ICAPS-2020.

[139] Yossi Cohen, Roni Stern, Ariel Felner: "Solving the Longest Simple Path

Problem With Heuristic Search", ICAPS-2020.

[138] Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:

"Moving Agents in Formation in Congested Environments", AAMAS-2020.

[137] Thayne Walker, Nathan R. Sturtevant , Ariel Felner: "Generalized and Sub-Optimal

Bipartite Constraints for Conflict-Based Search". AAAI-2020.

[136] Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:

"Robust Multi-Agent Path Finding and Executing", JAIR. Feb, 2020.

2019

[135] Reuth Mirsky, Ya'ar Shalom, Ahmad Majadly, Kobi Gal, Rami Puzis, Ariel Felner:

"New Goal Recognition Algorithms Using Attack Graphs". CSCML 2019: 260-278

[134] Jiaoyang Li, Ariel Felner, Eli Boyarski, Sven Koenig, Hang Ma: "Improved Heuristics for

Multi-Agent Pathfinding with Conflict-Based Search", IJCAI-2019

[133] Eshed Shaham, Ariel Felner , Nathan R. Sturtevant and Jeffrey S. Rosenschein:

"Optimally Efficient Bidirectional Search", IJCAI-2019

[132] Roni Stern, Nathan R. Sturtevant, Dor Atzmon, Thayne Walker, Jiaoyang Li, Liron Cohen,

Hang Ma, T. K. Satish Kumar, Ariel Felner and Sven Koenig: "Agent Pathfinding: Definitions,

Variants, and Benchmarks", Symposium on Combinatorial Search (SoCS-2019)

[131] Shahaf S.Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun:
"Improving Bidirectional Heuristic Search by Bound Propagation" SoCS 2019

[130] Jiaoyang Li, Ariel Felner, Sven Koenig and T. K. Satish Kumar: "Using FastMap to Solve

Graph Problems in a Euclidean Space", ICAPS-2019

[129] Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Ariel Felner, Hang Ma and Sven Koenig:

"Disjoint Splitting for Multi Path Finding with Conflict-Based Search", ICAPS-2019

[128] Rami Puzis, Liron Kachko, Barak Hagbi, Roni Stern and Ariel Felner: "Target oriented

network intelligence collection: effective exploration of social networks", WWWJ, January 2019.

[127] Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:

"Multi-Agent Path Finding for Large Agents",AAAI-2019, February 2019..

[126] Shahaf Shperberg, Ariel Felner, Nathan Sturtevant, Avi Haiun and Eyal Shimony:

"Enriching Non-parametric Bidirectional Search Algorithms",AAAI-2019, February 2019..

2018

[125] Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski: "Sub-optimal SAT-based Approach to

Multi-agent Path-finding Problem", SoCS-2018, July 2018.

[124] Dor Atzmon Roni Stern, Ariel Felner, Glenn Wagner, Roman Bart´ak, Neng-Fa Zhou,
"Robust Multi-Agent Path Finding", SoCS-2018, July 2018.

[123] Eshed Shaham, Ariel Felner, Nathan Sturtevant and Jeffrey S. Rosenschein," Minimizing
Node Expansions in Bidirectional Search with Consistent Heuristics", SoCS-2018,
July 2018. This paper won the best student paper award of the SOCS-2016 conference
(out of 61 submissions).

[122] Ariel Felner, “Position Paper: Using Early Goal Test in A*”, SoCS-2018.

[121] Thayne Walker, Nathan Sturtevant and Ariel Felner, “Extended Increasing Cost Tree
Search for Non-Unit Cost Domains”, IJCAI-2018.

[120] Liron Cohen, Ariel Felner, T. K. Satish Kumar, and Sven Koenig: “Anytime Focal Search
with Applications”, IJCAI-2018.

[119] Hang Ma, Glenn Wagner, Jiaoyang, Li, Ariel Felner, T. K. Satish Kumar, and Sven Koenig:
“Multi-Agent Path Finding with Deadlines”, IJCAI-2018.

[118] Ariel Felner, Jiaoyang Li, Eli Boyraski, Hang Ma, Liron Cohen, T. K. Satish Kumar, and Sven

Koenig: “Adding heuristics to CBS”, ICAPS-2018.

[117] Nathan Sturtevant, Ariel Felner, “A Brief History and Recent Achievements in Bidirectional

Search”, Senior Member Track of AAAI-2018.

[116] Rami Puzis, Liron Samama-Kachko, Roni Stern, and Ariel Felner, “Target Oriented Network

Intelligence Collection: Efficient Exploration of Social Networks", Accepted for publication

with Major Revisions to World Wide Web Journal (WWWJ). Revised version Under Review

since April 2017. ISI 2015 Impact Factor 3.37. ISI-2015 Journal ranking: 14 out of 123, Q1.

[115] Erez Karpas, Oded Bezalel, Solomon Eyal Shimony, David Tolpin and Ariel Felner,

“Rational Deployment of Multiple Heuristics in Optimal State-space Search”
Artificial Intelligence (AIJ) 256:181-210, 2018.

2017

[114] Shahaf Shperberg, Eyal Shimony and Ariel Felner, “Monte-Carlo Tree Search using

Batch Value of Perfect Information”, Uncertainty in AI conference (UAI-2017).

[113] Malte-Hemlert, Nathan Sturtevant, Ariel Felner: On "Variable Dependencies and

Compressed Pattern Databases", SoCS-2017 June 2017.

[112] Daniel Gilon, Ariel Felner, and Roni Stern: "Dynamic Potential Search on Weighted

Graphs", SoCS-2017 June 2017.

[111] Ariel Felner, Roni Stern, Eyal Shimony, Eli Boyarski, Meir Goldenerg, Guni Sharon,

Nathan Sturtevant, Glenn Wagner, Pavel Surynek: "Search-based Optimal Solvers for the Multi-agent Pathfinding Problem: Summary and Challenges", SoCS-2017 June 2017.

[110] Eshed Shaham, Ariel Felner, Jingwei Chen and Nathan Sturtevant: "The Minimal Set

of States that Must be Expanded in a Front-to-end Bidirectional Search", SoCS-2017, June 2017.

[109] Nathan Sturtevant, Ariel Felner, and Malte-Hemlert: " Value Compression of Pattern

Databases ", AAAI-2017, February 2017.

[108] Pavel Surynek, Jirka Svanc Ariel Felner, and Eli Boyarski: "Integration of

Independence Detection into SAT-based Optimal Multi-Agent Path Finding: A Novel SAT-Based Optimal MAPF Solver", In the 9th International Conference on Agents and Artificial Intelligence (ICRATT-2017).

[107] Meir Goldenberg, Ariel Felner and Nathan Sturtevant “The Compressed Differential

Heuristic" Accepted for publication at AI-Communication Journal (AI-COM). August 2017. In Press.

[106] Robert Holte, Ariel Felner, Guni Sharon and Nathan Sturtevant: "Bidirectional Search

That Is Guaranteed to Meet in the Middle". Artificial Intelligence Journal (AIJ), October 2017, Vol 252: pp: 232-366 (2017).

2016

[105] Pavel Surynek, Ariel Felner and Roni Stern: "Efficient SAT Approach to Multi-Agent

Path Finding under the Sum of Costs Objective", In the Proceedings of the Twenty Second European Conference on Artificial Intelligence, (ECAI-16), August 2016.

[104] Guni Sharon, Ariel Felner, Nathan Sturtevant and Robert Holte:, " An improved

priority function for MM, a bidirectional search algorithm that meets in the middle"., In the Proceeding of the Eighth International Symposium on Combinatorial Search, SoCS-2016. July 2016.

[103] Daniel Gilon, Ariel Felner, and Roni Stern, "Dynamic Potential Search - a New

Bounded Suboptimal Search Algorithm", Proceeding of the Eighth International Symposium on Combinatorial Search, SoCS-2016. July 2016. This paper won the best paper award of the SOCS-2016 conference (out of 61 submissions).

[102] Vitali Septnitzky, Ariel Felner, and Roni Stern: "Repair Policies for Not reopening

Nodes in Different Search Settings", Proceeding of the Eighth International Symposium on Combinatorial Search, SoCS-2016. July 2016.

[101] Robert Holte, Ariel Felner, Guni Sharon and Nathan Sturtevant: "Bidirectional

Search That Is Guaranteed to Meet in the Middle". AAAI-2016. pp: 3411-3417, This paper won the "outstanding paper award" out of 2200 submissions.

[100] Marco Lippi, Marco Ernandes and Ariel Felner, “Optimally solving permutation

sorting problems with efficient partial expansion bidirectional heuristic search”, AI-Communication Journal (AI-COM): 29(4),pp:513-536 (2016).

[99] Levi Lelis, Shahab Jabbari, Roni Stern, Ariel Felner, Sandra Ziles and Robert

Holte: “Predicting Optimal Solution Costs and Learning Heuristics with Bidirectional Stratified Sampling in Regular Search Spaces", Artificial Intelligence Journal (AIJ) 2016. Vol: 230, pp:51-73.

[98] Ariel Felner “The Israeli AI community”, Artificial Intelligence Magazine (AIMAG),

Vol: 37(3): (2016).

2015

[97] Oded Betzalel, Ariel Felner and Solomon Eyal Shimony: “Type System-base

Rational Lazy IDA*”, Proceeding of the Seventh International Symposium on Combinatorial Search”, (SoCS-2015), June 2015, pp:151-155.

[96] Zahy Bnaya, Alon Palombo, Rami Puzis and Ariel Felner: “Confidence Backup

Updates for Aggregating MDP State values in Monte-Carlo Tree Search”, Proceeding of the Seventh International Symposium on Combinatorial Search”, (SoCS-2015), June 2015. pp:155-160.

[95] Yisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Yuval Elovici and Bracha

Shapira: “Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection in Markov Chains”, Proceeding of the Seventh International Symposium on Combinatorial Search”, (SoCS-2015), June 2015. pp, 70-77.

[94] Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel and Wheeler

Ruml, “Solving the Snake in the Box Problem with Heuristic Search: First Results”, Proceeding of the Seventh International Symposium on Combinatorial Search”, (SoCS-2015), June 2015, pp:97-104.

[93] Ariel Felner, “Position Paper: The Collapse Macro in Best-first Search Algorithms and

an Iterative Variant of RBFS”, Proceeding of the Seventh International Symposium on Combinatorial Search”, (SoCS-2015), June 2015, pp:28-34.

[92] Roni Stern, Matt Hathem, Ariel Felner, Rami Puzis and Wheeler Ruml, “Max is

More than Min: Solving Maximization Problems with Heuristic Search”. Proceeding of the Seventh International Symposium on Combinatorial Search”, (IJCAI-2015), pp: 4323-4330.

[91] Eli Boyarski, Ariel Felner, Guni Sharon and Roni Stern “ICBS Improved

Conflict-based Search algorithm for Multi-Agent Pathfinding”, (IJCAI-2015), pp:740-746.

[90] Eli Boyarski, Ariel Felner, Guni Sharon and Roni Stern “Don't Split, Try To Work It

Out: Bypassing Conflicts in Multi-Agent Pathfinding”, (ICAPS-2015), pp:47-51.

[89] Ariel Felner, “Early Work on Optimization-based Heuristics for the Sliding Tile Puzzle”,

AAAI workshop on Planning, Search, and Optimization, January 2015.

[88] Zahy Bnaya, Ariel Felner, Dror Fried, Eyal Solomon Shimony and Olga Maksin

"Repeated-task Canadian traveler problem". AI-Communication Journal (AI-COM), 2015. Vol 28(3), pp:453-477.

[87] Guni Sharon, Roni Stern, Ariel Felner and Nathan Sturtevant “The Conflict-based

Search algorithm for Multi-agent Pathfinding”, Artificial Intelligence Journal (AIJ), (2015), Vol: 219: pp 40-66.

2014

[86] Bo Zhang, Robert Holte, Roni Stern and Ariel Felner, “A* with Lookahead Re-

evaluated”. Proceeding of the Sixth International Symposium on Combinatorial Search”, (SoCS-2014), August 2014.

[85] Liron Samama, Roni Stern, Rami Puzis and Ariel Felner, “Extended Framework for

Target Oriented Network Intelligence Collection”. Proceeding of the Sixth International Symposium on Combinatorial Search”, (SoCS-2014), August 2014.

[84] Roni Stern, Matt Hathem, Ariel Felner, Rami Puzis and Wheeler Ruml, “Max is More

than Min: Solving Maximization Problems with Heuristic Search”. Proceeding of the Sixth International Symposium on Combinatorial Search”, (SoCS-2014), August 2014. This paper won the best paper award of the SOCS-2014 conference (out of 58 submissions).

[83] Nathan Sturtevant, Ariel Felner and Malte Helmert, “Exploiting the Rubik’s Cube

12-edge PDB by Combining Partial Pattern Databases and Bloom Filters”.Proceeding of the Sixth International Symposium on Combinatorial Search”, (SoCS-2014), August 2014.

[82] Max Barrer, Guni Sharon, Roni Stern and Ariel Felner, “Suboptimal Variants of the

Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem”. Proceeding of the Sixth International Symposium on Combinatorial Search”, (SoCS-2014), August 2014.

[81] Guni Sharon, Ariel Felner and Nathan Sturtevant, “Exponential Deepening A*".

Proceedings of AAAI-2014. pp. 871-877

[80] Zahy Bnaya, and Ariel Felner, “Conflict-Oriented Windowed Hierarchical Cooperative

A*". ICRA-2014. pp: 3743-3748

[79] Levi Lelis, Roni Stern, Ariel Felner, Sandra Ziles and Robert Holte: “Predicting

Optimal Solution Cost with Conditional Probabilities” Annals of Mathematics and Artificial Intelligence (AMAI). Vol 72(3-4) 2014. pp: 267-295.

[78] Roni Stern, Rami Puzis, Ariel Felner Jur Van-de-berg, Ken Goldberg. “Potential

search: a bounded-cost search algorithm” Artificial Intelligence Journal (AIJ) (2014) 214 pp:1-25.

[77] Meir Goldenberg, Ariel Felner, Roni Stern, Nathan Sturtevant, Jonathan

Schaeffer, Robert Holte and Guni Sharon “Enhanced Partial Expansion A*" Journal of Artificial Intelligence Research (JAIR). 2014. (50) pp:141-187.

2013

[76] Zahy Bnaya, Rami Puzis Roni Stern, and Ariel Felner, “Bandit Algorithms for

Social Network Queries”, ASE/IEEE International Conference on Social Computing. (SocialCOM), July 2013.

[75] Guni Sharon, Ariel Felner, Nathan Sturtevant, “Online Detection of Dead States in

Real-Time Agent-Centered Search”, Proceeding of the Fifth International Symposium on Combinatorial Search”, (SoCS-2013), July 2013.

[74] Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert Holte, Jonathan

Schaeffer, “Optimal-Generation Variants of EPEA*”, Proceeding of the Fifth International Symposium on Combinatorial Search”, (SoCS-2013), July 2013.

[73] Zahy Banaya, Roni Stern, Rami Puzis, Ariel Felner, Roei Zivan, “Multi-Agent

Path Finding for Self Interested Agents”, Proceeding of the Fifth International Symposium on Combinatorial Search”, (SoCS-2013), July 2013.

[72] Roni Stern, Liron Smama, Tal Beja, Zahy Bnaya, Rami Puzis, Ariel Felner

, “Target Oriented Network Intelligence Collection for the Social Web”, Proceedings of AAAI-2013. July 2013, pp:

[71] David Tolpin, Solomon Shimony, Tal Beja, Ariel Felner, Erez Karpas, " Towards

rational deployment of multiple heuristics in A*”, Proceedings of the 23rd International Joint Conferences on Artificial Intelligence (IJCAI-2013), August 2013.

[70] Carlos Linares López, Roni Stern, Ariel Felner, "Target-Value Search Revisited”,

Proceedings of the 23rd International Joint Conferences on Artificial Intelligence (IJCAI-2013), August 2013.

[69] Zahy Bnaya, Rami Puzis, Roni Stern, and Ariel Felner, “Social Network Search

as a Volatile Multi-armed Bandit Problem”, (2013) ASE HUMAN Journal (2)2. PP 84.

[68] Guni Sharon, Roni Stern, Meir Goldenberg and Ariel Felner, “The Increasing Cost

Tree Search for Optimal Multi-agent Pathfinding”, Artificial Intelligence Journal (AIJ). 195: 470-495 (2013).

2012

[67] Roni Stern, Meir Kalech, Ariel Felner: "Finding Patterns in an Unknown Graph"

AI Commun. 25(3): 229-256 (2012)

[66] Guni Sharon, Roni Stern, Ariel Felner and Nathan Sturtevant, “Meta-agent Conflict-

Based Search For Optimal Multi-Agent Path Finding”, (SoCS-2012), July 2012. pp: 97-104. This paper won the best paper award of the SOCS-2012 conference (out of 60 submissions).

[65] Roni Stern, Ariel Felner and Robert Holte, "Search-aware Conditions for Probably

Approximately Correct Heuristic Search”, (SoCS-2012), July 2012,pp:112-119

[64] Marco Lippi, Marco Ernandes and Ariel Felner, “Efficient Single Frontier

Bidirectional Search”, Proceeding of the Forth International Symposium on Combinatorial Search”, (SoCS-2012), July 2012, pp: 49-56.

[63] Nathan Sturtevant, Ariel Felner, Wheeler Ruml and Maxim Lichkachev,

“Heuristic Search comes to Age”, Proceedings of AAAI-2012, spotlight track. July 2012, pp:2186-2190

[62] Ariel Felner, Meir Goldenberg , Roni Stern, Guni Sharon, Nathan Sturtevant,

Jonathan SchaefferC and Robert HolteC. “Partial-expansion A* with Selective Node Generation”, Proceedings of AAAI-2012, July 2012, pp:471-477.

[61] Guni Sharon, Roni Stern, Ariel Felner and Nathan Sturtevant: “Conflict-based

search for multi-agent path finding”, Proceedings of AAAI-2012, July 2012, pp:563-568

[60] Asher Stern, Ido Dagan, Roni Stern and Ariel Felner, “Efficient Search for

Transformation-based Inference”. Proceedings of the 50th conference of the Association for Computational Linguistics (ACL 2012), pp:283-291.

[59] Levi Lelis, Sandra Ziles, Robert Holte, Roni Stern and Ariel Felner, “Predicting

Optimal Solution Cost with Bidirectional Stratified Sampling”, Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS-12), June, 2012.

[58] Jordan Thayer, Roni Stern, Ariel Felner and Wheeler Ruml, “Faster Bounded-Cost

Search Using Inadmissible Estimates”, Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS-12), June 2012.

2011

[57] Ariel Felner, “Dijsktra's Algorithm Vs. Uniform Cost Search or A Case Against

Dijsktra's Algorithm”, Proceeding of the Third International Symposium on Combinatorial Search” (SoCS-2011), pp:47-51,July 2011.

[56] Guni Sharon, Roni Stern, Meir Goldenberg and Ariel Felner, “Pruning Techniques

for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding”, Proceeding of the Third International Symposium on Combinatorial Search” (SoCS-2011), pp:150-157, July 2011.

[55] Zahy Bnaya, Ariel Felner, Dror Fried, Eyal Solomon Shimony and Olga Maksin,

“Repeated-task Canadian traveler problem”, Proceeding of the Third International Symposium on Combinatorial Search” (SoCS-2011), pp:24-30, July 2011.

[54] Roni Stern, Ariel Felner and Robert Holte, “Probably Approximately Correct Heuristic

Search”. Proceeding of the Third International Symposium on Combinatorial Search” (SoCS-2011), pp:77-84, July 2011.

[53] Meir Goldenberg, Nathan Sturtevant

begin_of_the_skype_highlightingend_of_the_skype_highlighting, Ariel FelnerPI and Jonathan SchaefferC, “The Compressed Differential Heuristics”, Proceedings of AAAI-2011, pp:24-29, August 2011.

[52] Guni Sharon, Ron Stern, Meir Goldenberg

begin_of_the_skype_highlightingend_of_the_skype_highlighting and Ariel Felner, “The Increasing Cost Tree Search for Optimal Multi-agent Pathfinding”, Proceedings of the 22nd International Joint Conferences on Artificial Intelligence (IJCAI-2011), pp:662-667, July 2011

[51] Roni Stern, Rami Puzis and Ariel Felner. “Potential search: a bounded-cost search

algorithm”, Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS-11), pp:234-241, June 2011

[50] Inon Zukerman and Ariel Felner, "The MP-MIX algorithm: Dynamic Search Strategy

Selection in Multi-Player Adversarial Search”. IEEE Transactions on Computational Intelligence and AI in Games. To appear. 2011

[49] Ariel Felner, Uzi Zahavi, Nathan Sturtevant, Jonathan Schaeffer and Robert C. Holte:

"Inconsistent Heuristics: from theory to practice". Artificial Intelligence Journal (AIJ). 175 (9-10): 1570-1603 (2011).

2010

[48] Roni Stern, Meir Kalech and Ariel Felner, “Searching for a k-Clique in Unknown

Graphs”, Proceeding of the Second International Symposium on Combinatorial Search” (SoCS-2010), pp:83-89, July 2010.

[47] Meir Goldenberg, Ariel Felner, Nathan Sturtevant and Jonathan Schaeffer

“Portal-Based True-Distance Heuristics for Path Finding”, Proceeding of the Second International Symposium on Combinatorial Search” (SoCS-2010), pp:39-45, July 2010.

[46] Nir Pochter, Aviv Zohar, Jerr Rosenchein and Ariel Felner, "Search Space

Reduction Using Swamp Hierarchies", Proceedings of the Twenty-fourth Conference on Artificial Intelligence, (AAAI-10), pp:155-160, July 2010.

[45] Roni Stern, Tamar Kulberis, Ariel Felner and Robert Holte, "Using Lookaheads with

Optimal Best-First Search", Proceedings of the Twenty-fourth Conference on Artificial Intelligence, (AAAI-10), pp:185-190, July.

[44] Ariel Felner, Carsten Moldenhouer, Nathan Sturtevant and Jonathan Schaeffer

"Single-Frontier Bidirectional Search", Proceedings of the Twenty-fourth Conference on Artificial Intelligence, (AAAI-10), pp:59-65, July .

[43] Emily Rozenshine-Kemelmakher, Rami Puzis, Ariel Felner and Yuval Elovici, “Cost

Benefit Deployment of DNIPS”, Proceedings of Communication and Information System Security Symposium (ICC10-CISS) .

[42] Asaf Shiloni, Alon levi, Ariel Felner and Meir Kalech, “Ants Meeting Algorithms”

Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems, (AAMAS-10). pp: 567-574, May 2010.

[41] Robert Holte, Jonathan Schaeffer, and Ariel Felner: "“Mechanical Generation of Admissible

Heuristics”", In Festschrift book Honoring Judea Pearl. February 2010.

[40] Alex Nash, Kenny Daniel, Sven Koenig, Ariel Felner: "Theta*: Any-Angle Path Planning

on Grids". Journal of Artificial Intelligence Research (JAIR). 39:533-579, October 2010.

[39] William Yeoh, Ariel Felner and Sven Koenig: “BnB-ADOPT: "An Asynchronous

Branch-and-Bound DCOP Algorithm”". Journal of Artificial Intelligence Research (JAIR). 38:83-133, May 2010.

[38] Uzi Zahavi, Ariel Felner, Neil Burch and Robert C. Holte: "Predicting the Performance of

IDA* using Conditional Dependencies", Journal of Artificial Intelligence Research (JAIR). 37:41-83, February 2010.

2009

[37] Ariel Felner and Nathan Sturtevant “Abstraction-Based Heuristics with True

Distance Computations ” Proceedings of the Eighth International Symposium on Abstraction, Reformulation and Approximation (SARA-09), July-2009.

[36] Inon Zukerman, Ariel Felner and Sarit Kraus, “Mixing Search Strategies for

Multi-Player Games”, Proceedings of the Twenty First International Joint Conferences on Artificial Intelligence (IJCAI-09), pp:646-652, July 2009.

[35] Zahy Bnaya, Ariel Felner and Solomon Eyal Shimony, “The Canadian Traveler

Problem With Remote Sensing”, Proceedings of the Twenty First International Joint Conferences on Artificial Intelligence (IJCAI-09), pp:437-442, July 2009.

[34] Nathan Sturtevant, Ariel Felner, Max Barrer, Jonathan Schaeffer and Neil Burch

“Memory-Based Heuristics for Explicit State Spaces”, Proceedings of the Twenty

First International Joint Conferences on Artificial Intelligence (IJCAI-09), pp:609-

614, July 2009.

[33] Zhiifu Zhang, Robert Holte Jonathan Schaeffer, Nathan Sturtevant and Ariel

Felner, “A* Search with Inconsistent Heuristics”, Proceedings of the First International Joint Conferences on Artificial Intelligence (IJCAI-09), pp; 634-639, July 2009.

2008

[32] Mehdi Samadi, Robert C. Holte and Ariel Felner, "Compressing Pattern Databases

with Learning", In the Proceedings of the Eighteenth European Conference on Artificial Intelligence, (ECAI-08), pp:435-439, July 2008.

[31] Uzi Zahavi, Ariel Felner, Robert C. Holte and Neil Burch, "Predicting the

performance of IDA* with conditional dependencies", Proceedings of the Twenty-third Conference on Artificial Intelligence, (AAAI-08), pp:381-386, July 2008,

[30] Mehdi Samadi, Ariel Felner and Jonathan Schaeffer, "Learning from heuristic

values", Proceedings of the Twenty-third Conference on Artificial Intelligence, (AAAI-08), pp:351-356, July 2008.

[29] William Yeoh, Ariel Felner and Sven Koenig, “BnB-ADOPT: An Asynchronous

Branch-and-Bound DCOP Algorithm”, Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems. (AAMAS-08), pp: 591-598, May 2008.

[28] Fan Yang, Joseph Culberson, Robert C. Holte, Uzi Zahavi and Ariel Felner: “A

General Theory of Additive State Space Abstractions", Journal of Artificial Intelligence Research (JAIR), 32:631-662. 2008.

[27] Uzi Zahavi, Ariel Felner, Jonathan Schaeffer and Robert C. Holte: "Duality in

Permutation State Spaces and the Dual Search Algorithm", Artificial Intelligence Journal (AIJ) Volume 172, pages 514-540. 2008.

2007

[26] Ariel Felner and Nir Ofek "Combining Perimeter Search and Pattern Database

Abstractions", Proceedings of the Seventh International Symposium on Abstraction, Reformulation and Approximation (SARA-07) Whistler, Canada, July 2007, pp: 155-168

[25] Kenny Daniel, Alex Nash, Sven Koenig, Ariel Felner, "Theta*: Any-Angle Path

Planning on Grids", Proceedings of the Twenty-Second Conference on Artificial Intelligence, (AAAI-07), July 2007, pp:1177-1183.

[24] Uzi Zahavi, Ariel Felner, Jonathan Schaeffer and Nathan Sturtevant, "Inconsistent

Heuristics", Proceedings of the Twenty-Second Conference on Artificial Intelligence, (AAAI-07), July 2007, pp:1211-1216.

Also accepted for the selective poster session of AAAI-07. (Acceptance rate: 05%).

[23] Richard E. Korf and Ariel Felner: "Recent Progress in Heuristic Search: A Case Study of

the Four-Peg Towers of Hanoi Problem", Proceedings of the Twentieth International Joint Conferences on Artificial Intelligence (IJCAI-07), January 2007, pp: 2324-2329.

[22] Ariel Felner, Richard E. Korf, Ram Meshulam and Robert C. Holte: "Compressed Pattern

Databases", Journal of Artificial Intelligence Research (JAIR) 30:213-247, October 2007.

Impact factor: ISI- 1.795. CiteSeer - 2.45 (top 0.81%).

[21] Ariel Felner, Roni Stern and Jeffery Rosenchein: "Searching for Close Alternative Plans",

Journal of Autonomous Agents and Multi-Agent Systems. (JAAMAS) Volume 14(3), pages:211-237, January 2007.

2006

[20] Uzi Zahavi, Ariel Felner, Jonathan Schaeffer and Robert Holte: "Dual Search in

Permutation State spaces", Proceedings of the Twenty-first Conference on Artificial Intelligence, (AAAI-06), July 2006, pp: 1076-1081.

[19] Arnon Gilboa, Ariel Felner and Amnon Meisels, "Distributed Navigation in an Unknown

Physical Environment", Proceedings of the Fifth International Conference on Autonomous Agents and Multiagent Systems, (AAMAS-06), pp:553-560, May 2006.

[18] Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam and DavidFurcy: "Maximizing

over Multiple Pattern Databases Speeds up Heuristic Search", Artificial Intelligence Journal (AIJ). Volume 170, pages 1123-1136, November 2006.

[17] Ariel Felner, Yaron Shoshani, Yaniv Altshuler and Alfred M. Bruckstein: "Multi-agent Physical

A* with Large Pheromones" Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), Volume 12(1), pages:3-34, 2006.

2005

[16] Ariel Felner, Uzi Zahavi, Jonathan Schaeffer and Robert Holte, "Dual Lookups in

Pattern Databases", Proceedings of the Nineteenth International Joint Conferences on Artificial Intelligence (IJCAI-05), August 2005. pp:103-108.

[15] Ram Meshualm, Ariel Felner and Sarit Kraus, "Utility Based Multi-Agent Systems for

Performing Repeated Navigation Task", Proceedings of the Fourth

International Conference on Autonomous Agents and Multiagent Systems, (AAMAS-

05), Utrecht, Holland, July, 2005, pp:887-894.

[14] Ariel Felner and Amir Adler, "Solving the 24 Puzzle with Instance Dependent Pattern

Databases", Proceedings of the Sixth International Symposium on Abstraction, Reformulation and Approximation (SARA-05), pages 248-260. Edinburgh, July 2005. Also appeared in Lecture Notes in Computer Science (LNCS), Volume 3607, pages 248-260

[13] Yaniv Altshuler, Arie Matsliah and Ariel Felner, "On the Complexity of Physical

Problems and a Swarm Algorithm forK-Clique Search in Physical Graphs",

Proceedingsof the European Conference of Complex Systems, November 2005,

Paris, France.

[12] Ariel Felner: "“Finding Optimal Graph Partitioning with Heuristic search", In the “Annals of

Mathematics and Artificial Intelligence" Journal. (AMAI). Volume 45(3-4) pages 293-322 December 2005.

2004

[11] Yaron Shoshani, Israel Wagner and Freddy Bruckstein, "Large Pheromones: A case

study with Multi-agent PHA*", In the Forth International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), Brussels, Belgium, September 2004, pp:366-373. Also appeared in Lecture Notes in Computer Science LNCS volume 3172/ 2004. pp:366-373.

[10] Omid Tabibi, and Nathan Netannyahu, "Blockage detection in pawn", In the "Fourth

International Computer Games Association Conference" (ICGA), Israel,June 2004. Also appeared in Lecture Notes in Computer Science (LNCS) Volume 3846/2006, pp:187-201.

[9] Ram Meshulam, Robert Holte and Richard E. Korf “Compressing Pattern Databases”,

Proceedings of the Nineteenth National Conference on Artificial Intelligence, (AAAI-04), pp: 638-641, San-Jose, Ca. July 2004.

[8] Robet Holte, Jack Newton, Ariel Felner, Ram Meshulam and David Furcy,

“Multiple Pattern Databases”, Proceedings of the Fourteenth on Automated Planning and Scheduling (ICAPS-04) pp:122-131. June 2004, Whistler,British Columbia, Canada. (Acceptance rate: 31%).

This paper was a runner up for prize of the conference.

[7] Ariel Felner, Richard E. Korf and Sarit Hanan: "Additive Pattern Database Heuristics",

Journal of Artificial Intelligence Research (JAIR), 22:279-318, November 2004.

Won the IJCAII-JAIR-2007 best paper prize: of honorable mention.

[6] Ariel Felner, Roni Stern, Asaph Ben-Yair, Sarit Kraus and Nathan Netanyahu: "PHA*: Finding

the Shortest Path with A* in Unknown Physical Environments", Journal of Artificial Intelligence Research (JAIR). 21:631-670, (2004)

2003

[5] Ariel Felner, Alex Pomeransky and Jeff Rosenchein: "Searching for an Alternative Plan",

Proceedings of the Second International Conference on Autonomous Agents and Multiagent Systems, (AAMAS-03) pp:33-40, Melbourne Australia. July 2003.

[4] Ariel Felner, Richard E. Korf and Sarit Kraus: "KBFS: K-Best First Search", Annals of

Mathematics and Artificial Intelligence Journal (AMAI), 39:19-39(2003).

2002

[3] Richard E. Korf and Ariel Felner: “Disjoint Pattern Database Heuristics”, Artificial Intelligence Journal (AIJ), Vol:134, Pages:9-22, (2002).

[2] Roni Sternand Sarit Kraus, “PHA*: Performing A* in Unknown Physical Environments”,

Proceedings of the First International Conference on Autonomous Agents and Multi agent Systems, (AAMAS-02), pp:240-247. Bologna, Italy, July 2002.

Acceptance rate: 27%

Number of citations:15

[1] Bar-Ilan University – Computer Science,

Advisor’s Name: Prof. Sarit Kraus.

The work was carried out with a considerable amount of help and

advise from Prof. Richard E. Korf from UCLA.

Title of dissertation: "Improving Search Techniques and Using

them in Different Environments.”