| Optimal and Bounded-Suboptimal Multi-Agent Motion Planning
|
2019 |
Cohen, Liron |
| Interleaving Search and Heuristic Improvement
|
2019 |
Franco, Santiago |
| A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS
|
2019 |
Alcázar, Vidal |
| Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
|
2019 |
Stern, Roni |
| Probabilistic Robust Multi-Agent Path Finding
|
2019 |
Atzmon, Dor |
| Assigning Suppliers to Meet a Deadline
|
2019 |
Cohen, Liat |
| Real-Time Heuristic Search in Dynamic Environments
|
2019 |
Cheng, Chao Chi |
| Compiling Cost-Optimal Multi-Agent Pathfinding to ASP
|
2019 |
Gómez, Rodrigo N. |
| Unbounded Sub-Optimal Conflict-Based Search in Complex Domains
|
2019 |
Walker, Thayne T. |
| Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing
|
2019 |
Alwala, Kalyan Vasudev |
| Learning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics
|
2019 |
Chuang, Chung-Yao |
| Finding Optimal Longest Paths by Dynamic Programming in Parallel
|
2019 |
Fieger, Kai |
| Trial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning
|
2019 |
Schulte, Tim |
| Guiding Search with Generalized Policies for Probabilistic Planning
|
2019 |
Shen, William |
| Multi-Train Path Finding
|
2019 |
Atzmon, Dor |
| Repairing Compressed Path Databases on Maps with Dynamic Changes
|
2019 |
Verzeletti, Marco |
| Error Analysis and Correction for Weighted A*’s Suboptimality
|
2019 |
Holte, Robert C. |
| A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results
|
2019 |
Ulloa, Carlos Hernández |
| Brigitte, a Bridge-Based Grid Path-Finder
|
2019 |
Grastien, Alban |
| Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding
|
2019 |
Li, Jiaoyang |
Tag hinzufügen