The following pages link to Ariel Felner (Q235376):
Displaying 31 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← links)
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- KBFS: K-Best-First Search (Q1397235) (← links)
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle (Q1677446) (← links)
- Rational deployment of multiple heuristics in optimal state-space search (Q1748476) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- Duality in permutation state spaces and the dual search algorithm (Q2389626) (← links)
- Maximizing over multiple pattern databases speeds up heuristic search (Q2457594) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Theta*: Any-Angle Path Planning on Grids (Q3055815) (← links)
- Finding patterns in an unknown graph (Q3164974) (← links)
- BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm (Q3563097) (← links)
- (Q3624092) (← links)
- (Q4546682) (← links)
- Repeated-task Canadian Traveler Problem (Q4589110) (← links)
- Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search (Q4589262) (← links)
- Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach (Q5076310) (← links)
- Robust Multi-Agent Path Finding and Executing (Q5109900) (← links)
- The compressed differential heuristic (Q5145426) (← links)
- Predicting the Performance of IDA* using Conditional Distributions (Q5190266) (← links)
- IDB-ADOPT: A Depth-First Search DCOP Algorithm (Q5191411) (← links)
- Enhanced Partial Expansion A* (Q5419479) (← links)
- (Q5715674) (← links)
- (Q5715685) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
- Disjoint pattern database heuristics (Q5958199) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
