SoCS 2020: The 13th Annual Symposium on Combinatorial Search

Accepted Papers

Long Papers

Wei Du, Fahad Islam and Maxim Likhachev:
Multi-Resolution A*
Nathan Sturtevant and Malte Helmert:
A Guide to Budgeted Tree Search (Position Paper)
Julia Wichlacz, Daniel Hoeller, Alvaro Torralba and Joerg Hoffmann:
Applying Monte-Carlo Tree Search in HTN Planning
Gabriele Roeger, Malte Helmert, Jendrik Seipp and Silvan Sievers:
An Atom-Centric Perspective on Stubborn Sets
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig and T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D
Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar:
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP
Behrouz Babaki, Gilles Pesant and Claude-Guy Quimper:
Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search
Shahaf Shperberg and Ariel Felner:
On the Differences and Similarities of fMM and GBFHS
Gleb Belov, Wenbo Du, Maria Garcia De La Banda, Daniel Harabor, Sven Koenig and Xinrui Wei:
From Multi-Agent Pathfinding to 3D Pipe Routing
Florian Geisser, David Speck and Thomas Keller:
Trial-based Heuristic Tree Search for MDPs with Factored Action Spaces
Lukas Chrpa, Pavel Rytir and Rostislav Horcik:
Planning Against Adversary in Zero-sum Games: Heuristics for Selecting and Ordering Critical Actions

Short Papers

Majid Namazi, Conrad Sanderson, M.A. Hakim Newton and Abdul Sattar:
Surrogate Assisted Optimisation for Travelling Thief Problems
Jihee Han, Tansel Uras and Sven Koenig:
A String-Pulling Approach to Post-Smoothing on Grid Graphs
Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag and Ariel Felner:
Generalizing Multi-Agent Path Finding for Heterogeneous Agents

Extended Abstracts

Peter Damaschke, Raad Salman and Fredrik Ekstedt:
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem
Keisuke Otaki, Satoshi Koide, Ayano Okoso and Tomoki Nishi:
Cooperative Path Planning for Heterogeneous Agents
Tamir Jaffey, Shawn Seiref, Margarita Lopatin and Ariel Felner:
Solving the Watchman Route Problem on a Grid with Heuristic Search
Carlos Hernandez Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang and Sven Koenig:
A Simple and Fast Bi-Objective Search Algorithm
Patrick Rodler:
Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar and Sven Koenig:
Moving Agents in Formation in Congested Environments
Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma and Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
Junkyu Lee, Radu Marinescu and Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram
Alejandro Arbelaez and Laura Climent:
Transition to eBuses with Minimal Timetable Disruptions
Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic and Ariel Felner:
F-Cardinal Conflicts in Conflict-Based Search
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant and Sven Koenig:
Multi-Directional Search
Mohammad Abdulaziz and Dominik Berger:
Computing Plan-Length Bounds Using Lengths of Longest Paths
Jindrich Vodrazka, Roman Bartak and Jiri Svancara:
On Modelling Multi-Agent Path Finding as a Classical Planning Problem