Picture for Ariel Felner

Ariel Felner

Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search

Add code
Dec 26, 2023
Viaarxiv icon

Tightest Admissible Shortest Path

Add code
Aug 15, 2023
Figure 1 for Tightest Admissible Shortest Path
Figure 2 for Tightest Admissible Shortest Path
Viaarxiv icon

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Add code
Jun 19, 2019
Figure 1 for Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Figure 2 for Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Figure 3 for Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Figure 4 for Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Viaarxiv icon

Multi-Agent Path Finding with Deadlines

Add code
Jun 11, 2018
Figure 1 for Multi-Agent Path Finding with Deadlines
Figure 2 for Multi-Agent Path Finding with Deadlines
Figure 3 for Multi-Agent Path Finding with Deadlines
Viaarxiv icon

Multi-Agent Path Finding with Deadlines: Preliminary Results

Add code
May 13, 2018
Figure 1 for Multi-Agent Path Finding with Deadlines: Preliminary Results
Figure 2 for Multi-Agent Path Finding with Deadlines: Preliminary Results
Viaarxiv icon

Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants

Add code
Jul 02, 2017
Figure 1 for Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Figure 2 for Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Figure 3 for Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Figure 4 for Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Viaarxiv icon

Rational Deployment of Multiple Heuristics in IDA*

Add code
Nov 24, 2014
Figure 1 for Rational Deployment of Multiple Heuristics in IDA*
Figure 2 for Rational Deployment of Multiple Heuristics in IDA*
Figure 3 for Rational Deployment of Multiple Heuristics in IDA*
Figure 4 for Rational Deployment of Multiple Heuristics in IDA*
Viaarxiv icon

Theta*: Any-Angle Path Planning on Grids

Add code
Jan 16, 2014
Figure 1 for Theta*: Any-Angle Path Planning on Grids
Figure 2 for Theta*: Any-Angle Path Planning on Grids
Figure 3 for Theta*: Any-Angle Path Planning on Grids
Figure 4 for Theta*: Any-Angle Path Planning on Grids
Viaarxiv icon

Predicting the Performance of IDA* using Conditional Distributions

Add code
Jan 15, 2014
Figure 1 for Predicting the Performance of IDA* using Conditional Distributions
Figure 2 for Predicting the Performance of IDA* using Conditional Distributions
Figure 3 for Predicting the Performance of IDA* using Conditional Distributions
Figure 4 for Predicting the Performance of IDA* using Conditional Distributions
Viaarxiv icon

BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm

Add code
Jan 15, 2014
Figure 1 for BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
Figure 2 for BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
Figure 3 for BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
Figure 4 for BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
Viaarxiv icon