STUDYING ONLINE MULTI-AGENT PATH FINDING

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021)
1. Verfasser:	Morag, Jonathan (VerfasserIn)
Weitere Verfasser:	Stern, Roni (VerfasserIn), Felner, Ariel (VerfasserIn), Atzmon, Dor (VerfasserIn), Boyarski, Eli (VerfasserIn)
Pages:	14
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Bestellen

Titel	Jahr	Verfasser
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
EXTENDED ABSTRACT: A COMPETITIVE ANALYSIS OF ONLINE MULTI-AGENT PATH FINDING	2021	Ma, Hang
ITERATIVE-DEEPENING BIDIRECTIONAL HEURISTIC SEARCH WITH RESTRICTED MEMORY	2021	Shperberg, Shahaf S.
SOLVING SOKOBAN WITH FORWARD-BACKWARD REINFORCEMENT LEARNING	2021	Shoham, Yaron
MULTI-GOAL MULTI-AGENT PATH FINDING VIA DECOUPLED AND INTEGRATED GOAL VERTEX ORDERING	2021	Surynek, Pavel
HOW TO SPEED-UP THE AUTOMATED CONFIGURATION OF OPTIMIZATION ALGORITHMS	2021	Souza, Marcelo De
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

Alle Artikel auflisten