| 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 |
| FAST BOUNDED SUBOPTIMAL PROBABILISTIC PLANNING WITH CLEAR PREFERENCES ON MISSING INFORMATION
|
2021 |
Chatterjee, Ishani |
| A NEW BOOLEAN ENCODING FOR MAPF AND ITS PERFORMANCE WITH ASP AND MAXSAT SOLVERS
|
2021 |
Achá, Roberto Asín |
| SCALING UP SEARCH WITH PARTIAL INITIAL STATES IN OPTIMIZATION CROSSWORDS
|
2021 |
Botea, Adi |
| GENERALIZED CONFLICT-DIRECTED SEARCH FOR OPTIMAL ORDERING PROBLEMS
|
2021 |
Chen, Jingkai |
| REVISITING THE COMPLEXITY ANALYSIS OF CONFLICT-BASED SEARCH: NEW COMPUTATIONAL TECHNIQUES AND IMPROVED BOUNDS
|
2021 |
Gordon, Ofir |
| CUSTOMISED SHORTEST PATHS USING A DISTRIBUTED REVERSE ORACLE
|
2021 |
Mahéo, Arthur |
| SOLO: SEARCH ONLINE, LEARN OFFLINE FOR COMBINATORIAL OPTIMIZATION PROBLEMS
|
2021 |
Oren, Joel |
| TOWARDS NARROWING THE SEARCH IN BOUNDED-SUBOPTIMAL SAFE INTERVAL PATH PLANNING
|
2021 |
Rybecky, Tomas |
| FROM CLASSICAL TO COLORED MULTI-AGENT PATH FINDING
|
2021 |
Barták, Roman |
| LEARNING PSEUDO-BACKDOORS FOR MIXED INTEGER PROGRAMS
|
2021 |
Ferber, Aaron |
| COOPERATIVE MULTI-AGENT PATH FINDING: BEYOND PATH PLANNING AND COLLISION AVOIDANCE
|
2021 |
Greshler, Nir |
| MULTI-TARGET SEARCH IN EUCLIDEAN SPACE WITH RAY SHOOTING
|
2021 |
Hechenberger, Ryan |
Tag hinzufügen