| 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 |
| THE CLOSED LIST IS AN OBSTACLE TOO
|
2021 |
Felner, Ariel |
| EXPERIMENTAL EVALUATION OF CLASSICAL MULTI AGENT PATH FINDING ALGORITHMS
|
2021 |
Kaduri, Omri |
| PATTERN DATABASES FOR STOCHASTIC SHORTEST PATH PROBLEMS
|
2021 |
Klößner, Thorsten |
| EXTENDED ABSTRACTS BI-OBJECTIVE SEARCH WITH BI-DIRECTIONAL A*
|
2021 |
Ahmadi, Saman |
| IMPROVING CONTINUOUS-TIME CONFLICT BASED SEARCH
|
2021 |
Andreychuk, Anton |
| A PLANNING-BASED APPROACH FOR IN-STATION TRAIN DISPATCHING
|
2021 |
Cardellini, Matteo |
| DPLL(MAPF): AN INTEGRATION OF MULTI-AGENT PATH FINDING AND SAT SOLVING TECHNOLOGIES
|
2021 |
Capek, Martin |
| SCALABLE RAIL PLANNING AND REPLANNING: WINNING THE 2020 FLATLAND CHALLENGE
|
2021 |
Li, Jiaoyang |
Tag hinzufügen