| ADVERSARY STRATEGY SAMPLING FOR EFFECTIVE PLAN GENERATION
|
2021 |
Chrpa, Lukáš |
| CONTINGENT PLANNING FOR ROBUST MULTI-AGENT PATH FINDING
|
2021 |
Nekvinda, Michal |
| SUM OF COSTS OPTIMAL MULTI-AGENT PATH FINDING WITH CONTINUOUS TIME VIA SATISFIABILITY MODULO THEORIES
|
2021 |
Surynek, Pavel |
| MULTI-AGENT PICKUP AND DELIVERY WITH TASK DEADLINES
|
2021 |
Wu, Xiaohu |
| FURTHER IMPROVED HEURISTICS FOR CONFLICT-BASED SEARCH
|
2021 |
Boyarski, Eli |
| AVOIDING MONOCHROMATIC RECTANGLES USING SHIFT PATTERNS
|
2021 |
Liu, Zhenjun |
| DISTRIBUTIONAL METAREASONING FOR HEURISTIC SEARCH
|
2021 |
Gu, Tianyi |
| MULTI-AGENT TERRAFORMING: EFFICIENT MULTI-AGENT PATH FINDING VIA ENVIRONMENT MANIPULATION
|
2021 |
Vainshtain, David |
| FINDING THE EXACT DIAMETER OF A GRAPH WITH PARTIAL BREADTH-FIRST SEARCHES
|
2021 |
Korf, Richard E. |
| ON THE BENEFITS OF RANDOMLY ADJUSTING ANYTIME WEIGHTED A*
|
2021 |
Bhatia, Abhinav |
| SUBOPTIMALLY SOLVING THE WATCHMAN ROUTE PROBLEM ON A GRID WITH HEURISTIC SEARCH
|
2021 |
Yaffe, Tamir |
| CONFLICT-FREE MULTI-AGENT MEETING
|
2021 |
Atzmon, Dor |
| ECBS WITH FLEX DISTRIBUTION FOR BOUNDED-SUBOPTIMAL MULTI-AGENT PATH FINDING
|
2021 |
Chan, Shao-Hung |
| AVOIDING RE-EXPANSIONS IN SUBOPTIMAL BEST-FIRST SEARCH
|
2021 |
Chen, Jingwei |
| METAREASONING FOR INTERLEAVED PLANNING AND EXECUTION
|
2021 |
Elboher, Amihay |
| LANDMARK HEURISTICS FOR LIFTED PLANNING — EXTENDED ABSTRACT
|
2021 |
Wichlacz, Julia |
| EXPLOITING LEARNED POLICIES IN FOCAL SEARCH
|
2021 |
Araneda, Pablo |
| COUNTING VERTEX-DISJOINT SHORTEST PATHS IN GRAPHS
|
2021 |
Botea, Adi |
| A MEASURE OF QUALITY FOR IDA* HEURISTICS
|
2021 |
Clausecker, Robert K. P. |
| LEARNING-BASED SYNTHESIS OF SOCIAL LAWS IN STRIPS
|
2021 |
Nir, Ronen |
Tag hinzufügen