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