Exponential deepening A* for real-time agent-centered search

Nathan R. Sturtevant , Ariel Felner , Guni Sharon
national conference on artificial intelligence 871 -877

1
2014
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding.

Nathan R. Sturtevant , Ariel Felner , Roni Stern , Guni Sharon
SOCS

75
2012
Efficient Single Frontier Bidirectional Search.

Ariel Felner , Marco Lippi , Marco Ernandes
SOCS

21
2012
Don't split, try to work it out: bypassing conflicts in multi-agent pathfinding

Eli Boyarski , Ariel Felner , Roni Stern , Guni Sharon
international conference on automated planning and scheduling 47 -51

11
2015
Predicting optimal solution cost with bidirectional stratified sampling

Ariel Felner , Robert C. Holte , Sandra Zilles , Roni Stern
international conference on automated planning and scheduling 155 -163

9
2012
Dynamic Potential Search — A New Bounded Suboptimal Search

Ariel Felner , Roni Stern , Daniel Gilon
annual symposium on combinatorial search 36 -44

7
2016
Bidirectional Search That Is Guaranteed to Meet in the Middle: Extended Version

Nathan R. Sturtevant , Ariel Felner , Robert C. Holte , Guni Sharon

1
2015
Bidirectional search that is guaranteed to meet in the middle

Nathan R. Sturtevant , Ariel Felner , Robert C. Holte , Guni Sharon
national conference on artificial intelligence 3411 -3417

23
2016
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.

Pavel Surynek , Eli Boyarski , Ariel Felner , Roni Stern
european conference on artificial intelligence 810 -818

142
2016
Repair Policies for Not Reopening Nodes in Different Search Settings.

Ariel Felner , Roni Stern , Vitali Sepetnitsky
SOCS 81 -88

9
2016
Predicting the performance of IDA* using conditional distributions

Uzi Zahavi , Ariel Felner , Neil Burch , Robert C. Holte
Journal of Artificial Intelligence Research 37 ( 1) 41 -84

41
2010
Value Compression of Pattern Databases.

Nathan R. Sturtevant , Malte Helmert , Ariel Felner
national conference on artificial intelligence 912 -918

2
2017
Shortest Path for K Goals

Ariel Felner , Roni Tzvi Stern , Meir Goldenberg
annual symposium on combinatorial search 167 -168

2017
Robust Multi-Agent Path Finding.

Roman Bartak , Ariel Felner , Neng-Fa Zhou , Glenn Wagner
annual symposium on combinatorial search 157 -158

49
2018
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.

Pavel Surynek , Nathan R. Sturtevant , Eli Boyarski , Ariel Felner
SOCS 29 -37

184
2017
A Brief History and Recent Achievements in Bidirectional Search.

Nathan R. Sturtevant , Ariel Felner
national conference on artificial intelligence 8000 -8007

4
2018
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.

Eli Boyarski , Ariel Felner , Sven Koenig , Hang Ma
international conference on automated planning and scheduling 83 -87

114
2018
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem

Pavel Surynek , Eli Boyarski , Ariel Felner , Roni Stern
annual symposium on combinatorial search 90 -105

2
2018
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

Nathan R. Sturtevant , Jeffrey S. Rosenschein , Ariel Felner , Eshed Shaham
annual symposium on combinatorial search 81 -98

5
2018
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Roman Bartak , Nathan Sturtevant , Eli Boyarski , Ariel Felner
arXiv: Artificial Intelligence

322
2019