| 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 |
| Generalized Target Assignment and Path Finding Using Answer Set Programming
|
2019 |
Nguyen, Van |
| Algorithms for Average Regret Minimization
|
2019 |
Storandt, Sabine |
| Unifying Search-Based and Compilation-Based Approaches co Multi-Agent Path Finding through Satisfiability Modulo Theories
|
2019 |
Surynek, Pavel |
| Measuring the Vulnerability of a Multi-Agent Pathfinding Solution
|
2019 |
Yoeli, Rotem |
| 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 |
Tag hinzufügen