The following pages link to Roni Stern (Q360143):
Displaying 19 items.
- The increasing cost tree search for optimal multi-agent pathfinding (Q360145) (← 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)
- Sequential plan recognition: an iterative approach to disambiguating between hypotheses (Q1647950) (← links)
- Batch repair actions for automated troubleshooting (Q1989400) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- How many diagnoses do we need? (Q2407458) (← links)
- A Novel SAT-Based Approach to Model Based Diagnosis (Q2929583) (← links)
- Finding patterns in an unknown graph (Q3164974) (← 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)
- Enhanced Partial Expansion A* (Q5419479) (← links)
- (Q5715674) (← links)
- Safe Multi-Agent Pathfinding with Time Uncertainty (Q5856485) (← links)
- A domain-independent agent architecture for adaptive operation in evolving open worlds (Q6592985) (← links)