| Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search
|
2020 |
Babaki, Behrouz |
| From Multi-Agent Pathfinding to 3D Pipe Routing
|
2020 |
Belov, Gleb |
| £mbedding Directed Graphs in Potential Fields Using FastMap-D
|
2020 |
Gopalakrishnan, Sriram |
| On the Differences and Similarities of fMM and GBFHS
|
2020 |
Shperberg, Shahaf |
| Toward a String-Pulling Approach to Path Smoothing on Grid Graphs
|
2020 |
Han, Tihee |
| f-Cardinal Conflicts in Conflict-Based Search
|
2020 |
Boyarski, Eli |
| Heuristic AND/OR Search for Solving Influence Diagram
|
2020 |
Lee, Junkyu |
| Moving Agents in Formation in Congested Environments
|
2020 |
Li, Jiaoyang |
| New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
|
2020 |
Li, Jiaoyang |
| Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree
|
2020 |
Rodler, Patrick |
| An Atom-Centric Perspective on Stubborn Sets
|
2020 |
Röger, Gabriele |
| Multi-Resolution A*
|
2020 |
Du, Wei |
| Applying Monte-Carlo Tree Search in HTN Planning
|
2020 |
Wichlacz, Julia |
| Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP
|
2020 |
Xu, Hong |
| Transition to eBuses with Minimal Timetable Disruptions
|
2020 |
Arbelaez, Alejandro |
| On Modelling Multi-Agent Path Finding as a Classical Planning Problem
|
2020 |
Vodrázka, Jindrich |
| Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces
|
2020 |
Geißer, Florian |
| A Guide to Budgeted Tree Search
|
2020 |
Sturtevant, Nathan |
| Computing Plan-Length Bounds Using Lengths of Longest Paths
|
2020 |
Abdulaziz, Mohammad |
| Cooperative Path Planning for Heterogeneous Agents
|
2020 |
Otaki, Keisuke |
Tag hinzufügen