| 2019 | A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics. Ryo Kuroiwa, Alex Fukunaga |
| 2019 | A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences. Nawal Benabbou, Thibaut Lust |
| 2019 | A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. Carlos Hernández Ulloa, Jorge A. Baier, William Yeoh, Vadim Bulitko, Sven Koenig |
| 2019 | A Profit Guided Coordination Heuristic for Travelling Thief Problems. Majid Namazi, M. A. Hakim Newton, Abdul Sattar, Conrad Sanderson |
| 2019 | A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS. Vidal Alcázar, Mike Barley, Patricia J. Riddle |
| 2019 | A-MHA*: Anytime Multi-Heuristic A. Ramkumar Natarajan, Muhammad Suhail Saleem, Sandip Aine, Maxim Likhachev, Howie Choset |
| 2019 | Algorithms for Average Regret Minimization. Sabine Storandt, Stefan Funke |
| 2019 | An Improved Algorithm for Optimal Coalition Structure Generation. Narayan Changder, Samir Aknine, Animesh Dutta |
| 2019 | An Improved Meet in the Middle Algorithm for Graphs with Unit Costs. Edward C. Sewell, John Pavlik, Sheldon H. Jacobson |
| 2019 | Assigning Suppliers to Meet a Deadline. Liat Cohen, Tal Grinshpoun, Roni Stern |
| 2019 | Brigitte, a Bridge-Based Grid Path-Finder. Alban Grastien |
| 2019 | Challenging Human Supremacy in Skat. Stefan Edelkamp |
| 2019 | Compiling Cost-Optimal Multi-Agent Pathfinding to ASP. Rodrigo N. Gómez, Carlos Hernández, Jorge A. Baier |
| 2019 | Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun |
| 2019 | Error Analysis and Correction for Weighted A*'s Suboptimality. Robert C. Holte, Rubén Majadas, Alberto Pozanco, Daniel Borrajo |
| 2019 | Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. Hang Ma, Wolfgang Hönig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig |
| 2019 | Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig |
| 2019 | Finding Optimal Longest Paths by Dynamic Programming in Parallel. Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber |
| 2019 | Generalized Target Assignment and Path Finding Using Answer Set Programming. Van Nguyen, Philipp Obermeier, Tran Cao Son, Torsten Schaub, William Yeoh |
| 2019 | Guiding Search with Generalized Policies for Probabilistic Planning. William Shen, Felipe W. Trevizan, Sam Toyer, Sylvie Thiébaux, Lexing Xie |
| 2019 | Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig |
| 2019 | Improved Safe Real-Time Heuristic Search. Bence Cserna, Kevin C. Gall, Wheeler Ruml |
| 2019 | Improving Bidirectional Heuristic Search by Bounds Propagation. Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun |
| 2019 | Interleaving Search and Heuristic Improvement. Santiago Franco, Álvaro Torralba |
| 2019 | Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing. Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev |
| 2019 | Learning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics. Chung-Yao Chuang, Stephen F. Smith |
| 2019 | Learning to Generate Industrial SAT Instances. Haoze Wu, Raghuram Ramanujan |
| 2019 | Measuring the Vulnerability of a Multi-Agent Pathfinding Solution. Rotem Yoeli, Roni Stern, Dor Atzmon |
| 2019 | Multi-Agent Path Finding for Large Agents. Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). Pavel Surynek |
| 2019 | Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. 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 |
| 2019 | Multi-Train Path Finding. Dor Atzmon, Amit Diei, Daniel Rave |
| 2019 | Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin. Alfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina |
| 2019 | On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. Roman Barták, Jirí Svancara |
| 2019 | Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig |
| 2019 | PASAR - Planning as Satisfiability with Abstraction Refinement. Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber |
| 2019 | Probabilistic Robust Multi-Agent Path Finding. Dor Atzmon, Ariel Felner, Roni Stern |
| 2019 | Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019 Pavel Surynek, William Yeoh |
| 2019 | Real-Time Heuristic Search in Dynamic Environments. Chao Chi Cheng, Wheeler Ruml |
| 2019 | Repairing Compressed Path Databases on Maps with Dynamic Changes. Marco Verzeletti, Adi Botea, Marina Zanella |
| 2019 | Revisiting Suboptimal Search. Jingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml |
| 2019 | Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2019 | Trial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning. Tim Schulte, Bernhard Nebel |
| 2019 | Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner |
| 2019 | Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. Pavel Surynek |
| 2019 | Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles. Robert Clausecker, Alexander Reinefeld |