| 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 |
| LINEAR-SPACE BEST-FIRST DIAGNOSIS SEARCH
|
2021 |
Rodler, Patrick |
| CONCEPTUAL COMPARISON OF COMPILATION-BASED SOLVERS FOR MULTI-AGENT PATH FINDING: MIP VS. SAT
|
2021 |
Surynek, Pavel |
| A HIERARCHICAL APPROACH TO MULTI-AGENT PATH FINDING
|
2021 |
Zhang, Han |
| EXPLOITING LEARNED POLICIES AND LEARNED HEURISTICS IN BOUNDEDSUBOPTIMAL SEARCH
|
2021 |
Greco, Matias |
| STUDYING ONLINE MULTI-AGENT PATH FINDING
|
2021 |
Morag, Jonathan |
| SPEEDING UP HEURISTIC FUNCTION SYNTHESIS VIA EXTENDING THE FORMULA GRAMMAR
|
2021 |
Hernandez, Sergio Poo |
| EXPLAINABLE PROBLEM IN CLINGO-DL PROGRAMS
|
2021 |
Nguyen, Van |
| META-LEVEL TECHNIQUES FOR PLANNING, SEARCH, AND SCHEDULING
|
2021 |
Shperberg, Shahaf S. |
Tag hinzufügen