Presentations and Authors

Last name A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All

Long Papers

On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective PDF
Roman Barták, Jiří Švancara
Finding Optimal Longest Paths by Dynamic Programming in Parallel PDF
Kai Fieger, Tomas Balyo, Christian Schulz, Dominik Schreiber
PASAR — Planning as Satisfiability with Abstraction Refinement PDF
Nils Froleyks, Tomas Balyo, Dominik Schreiber
Repairing Compressed Path Databases on Maps with Dynamic Changes PDF
Marco Verzeletti, Adi Botea, Marina Zanella

Short Papers

Error Analysis and Correction for Weighted A*’s Suboptimality PDF
Robert C. Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo

Position Papers

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks PDF
Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski

Extended Abstracts

A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS PDF
Vidal Alcazar, Mike Barley, Pat Riddle
A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences PDF
Nawal Benabbou, Thibaut Lust
Compiling Cost-Optimal Multi-Agent Pathfinding to ASP PDF
Rodrigo N. Gómez, Carlos Hernández, Jorge Baier
A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results PDF
Carlos Hernández Ulloa, Jorge Baier, William Yeoh, Vadim Bulitko, Sven Koenig
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results PDF
Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig