Symposium Program

Program at a Glance

July 16

08:45 - 09:00: Opening
09:00 - 10:00: Invited Talk 1
10:00 - 10:30: Coffee Break
10:30 - 12:00: Session 1 (90 minutes)
12:00 - 14:00: Lunch Break
14:00 - 15:00: Session 2 (60 minutes)
15:00 - 16:30: Poster Session + Coffee Break
17:30 - 21:30: Wine Train (it takes about 30 minutes to walk there from the hotel)

July 17

09:00 - 10:00: Invited Talk 2 (an EurAI sponsored talk)
10:00 - 10:30: Coffee Break
10:30 - 12:00: Session 3 (90 minutes)
12:00 - 14:00: Lunch Break
14:00 - 15:30: Session 4 (90 minutes)
15:30 - 16:00: Coffee Break
16:00 - 17:30: Awards Ceremony + Community Meeting + Closing

Proceedings

On-line Proceedings of SoCS 2019: https://aaai.org/Library/SOCS/socs19contents.php

Best Paper Awards

Best paper and best student paper award:

• Shahaf S.Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun
  Improving Bidirectional Heuristic Search by Bound Propagation
  

Detailed Program

July 16

July 17

The program is still subject to change.

Information for Speakers

• Oral presentations of long papers are allocated 18 minutes: 15 minutes + 3 minutes of Q&A
• Oral presentations of short papers are allocated 10 minutes: 8 minutes + 2 minutes Q&A

Poster Session

• 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*
• 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

Information for Poster Presenters

Dimensions for posters should be within 40" x 60" (either orientation).