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. |
Revisiting Suboptimal Search
|
2019 |
Chen, Jingwei |
Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles
|
2019 |
Clausecker, Robert |
PASAR - Planning as Satisfiability with Abstraction Refinement
|
2019 |
Froleyks, Nils |
Novelty Messages Filtering for Multi Agent Privacy-Preserving Planning
|
2019 |
Gerevini, Alfonso E. |
improving Bidirectional Heuristic Search by Bounds Propagation
|
2019 |
Shperberg, Shahaf S. |
An Improved Meet in the Middle Algorithm for Graphs with Unit Costs
|
2019 |
Sewell, Edward C. |
A Profit Guided Coordination Heuristic for Travelling Thief Problems
|
2019 |
Namazi, Majid |
An Improved Algorithm for Optimal Coalition Structure Generation
|
2019 |
Changder, Narayan |
Improved Safe Real-Time Heuristic Search
|
2019 |
Cserna, Bence |
A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics
|
2019 |
Kuroiwa, Ryo |
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results
|
2019 |
Li, Jiaoyang |