SoCS 2020

Colocated Conference

Past SoCS Conferences
2019 Napa, CA
2018 Stockholm, Sweden
2017 Pittsburgh, PA
2016 Tarrytown, NY
2015 Ein Gedi, Israel
2014 Prague, Czechia
2013 Leavenworth, WA
2012 Niagara Falls, Canada
2011 Barcelona, Spain
2010 Atlanta, GA
2009 Lake Arrowhead, CA
2008 Chicago, IL

SoCS 2020: The 13th Annual Symposium on Combinatorial Search

Symposium Program

Program at a Glance

All times are CEST. You can check the different time zones here, and keep track of the differences between time zones here.

Use the provided link to watch a session: Links are being added as soon as the corresponding videos are ready. Sessions will be streamed at the indicated time. They will remain available on YouTube afterwards.
Join the SoCS2020 forum for interacting with the authors and the other attendees, and to find information to connect to the SoCS Discord Server.

May 26: Master Class

10:00 - 10:15: Opening of the Master Class
10:15 - 11:00: Abdallah Saffidine: Solving algorithms for two-player games from the ground up
11:00 - 11:30: Break
11:30 - 12:30: Roman Bartak: Compilation-based approaches to planning and scheduling
12:30 - 13:30: Lunch Break
13:30 - 15:15: Marco Maratea: Answer Set Programming: Modeling, Solving and Applications
15:15 - 15:45: Break
15:45 - 17:00: Nathan Sturtevant: Heuristic Search: You have hear it said, but I tell you...
17:00 - 17:30: Break
17:30 - 18:30: Roni Stern: Domain-dependent and domain-independent suboptimal heuristic search

May 27

10:00 - 10:15: Opening and Welcome
10:15 - 11:15: Session 1: Search and Search Strategies (i)
11:15 - 11:45: Break
11:45 - 12:45: Session 2: Applications and Games
12:45 - 14:00: Lunch Break
14:00 - 15:00: Session 3: Search and Search Strategies (ii)
15:00 - 15:30: Break
15:30 - 16:30: Invited Talk: Rina Dechter

May 28

10:30 - 11:30: Invited Talk: Peter Stuckey
11:30 - 12:00: Break
12:00 - 13:00: Session 4: Multi-Agent Path Finding
13:00 - 14:00: Lunch Break
14:00 - 15:00: Awards Ceremony
15:00 - 15:30: Break
15:30 - 17:00: Session 5: Planning
17:00 - 17:15: Break
17:15 - 18:15: Community Meeting + Closing (Join the SoCS Forum for the Zoom meeting ID)


Online proceedings of SoCS 2020 are available at:

Best Papers Awards (Awards Ceremony)

Best Paper:
  • An Atom-Centric Perspective on Stubborn Sets (Long),
    Gabriele Roeger, Malte Helmert, Jendrik Seipp and Silvan Sievers
Honourable Mention:
  • Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP (Long),
    Hong Xu, Kexuan Sun, Sven Koenig and T. K. Satish Kumar


Session 1: Search and Search Strategies (i)
  • Multi-Resolution A* (Long),
    Wei Du, Fahad Islam and Maxim Likhachev

  • A Guide to Budgeted Tree Search (Long),
    Nathan Sturtevant and Malte Helmert

  • A Simple and Fast Bi-Objective Search Algorithm (Abstract),
    Carlos Hernandez Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang and Sven Koenig

  • On the Differences and Similarities of fMM and GBFHS (Long),
    Shahaf Shperberg and Ariel Felner

Session 2: Applications and Games
  • Surrogate Assisted Optimisation for Travelling Thief Problems (Short),
    Majid Namazi, Conrad Sanderson, M.A. Hakim Newton and Abdul Sattar

  • Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem (Abstract),
    Peter Damaschke, Raad Salman and Fredrik Ekstedt

  • Solving the Watchman Route Problem on a Grid with Heuristic Search (Abstract),
    Tamir Jaffey, Shawn Seiref, Margarita Lopatin and Ariel Felner

  • Transition to eBuses with Minimal Timetable Disruptions (Abstract),
    Alejandro Arbelaez and Laura Climent

  • A String-Pulling Approach to Post-Smoothing on Grid Graphs (Short),
    Jihee Han, Tansel Uras and Sven Koenig

  • Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree (Abstract),
    Patrick Rodler

Session 3: Search and Search Strategies (ii)
  • Heuristic AND/OR Search for Solving Influence Diagram (Abstract),
    Junkyu Lee, Radu Marinescu and Rina Dechter

  • Trial-based Heuristic Tree Search for MDPs with Factored Action Spaces (Long),
    Florian Geisser, David Speck and Thomas Keller

  • Multi-Directional Search (Abstract),
    Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant and Sven Koenig

  • Embedding Directed Graphs in Potential Fields Using FastMap-D (Long),
    Sriram Gopalakrishnan, Liron Cohen, Sven Koenig and T. K. Satish Kumar

  • F-Cardinal Conflicts in Conflict-Based Search (Abstract),
    Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic and Ariel Felner

Session 4: Multi-Agent Path Finding
  • New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding (Abstract),
    Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma and Sven Koenig

  • Generalizing Multi-Agent Path Finding for Heterogeneous Agents (Short),
    Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag and Ariel Felner

  • On Modelling Multi-Agent Path Finding as a Classical Planning Problem (Abstract),
    Jindrich Vodrazka, Roman Bartak, Jiri Svancara

  • From Multi-Agent Pathfinding to 3D Pipe Routing (Long),
    Gleb Belov, Wenbo Du, Maria Garcia De La Banda, Daniel Harabor, Sven Koenig and Xinrui Wei

  • Moving Agents in Formation in Congested Environments (Abstract),
    Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar and Sven Koenig

Session 5: Planning
  • Applying Monte-Carlo Tree Search in HTN Planning (Long),
    Julia Wichlacz, Daniel Hoeller, Alvaro Torralba and Joerg Hoffmann

  • Cooperative Path Planning for Heterogeneous Agents (Abstract),
    Keisuke Otaki, Satoshi Koide, Ayano Okoso and Tomoki Nishi

  • Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search (Long),
    Behrouz Babaki, Gilles Pesant and Claude-Guy Quimper

  • Planning Against Adversary in Zero-sum Games: Heuristics for Selecting and Ordering Critical Actions (Long),
    Lukas Chrpa, Pavel Rytir and Rostislav Horcik

  • Computing Plan-Length Bounds Using Lengths of Longest Paths (Abstract),
    Mohammad Abdulaziz and Dominik Berger

Copyright © 2020 Symposium on Combinatorial Search