---

---

---

---

SoCS 2013: The Sixth Annual Symposium on Combinatorial Search

SoCS 2013 Proceedings

The proceedings are available for free from the AAAI digital library.

Accepted Papers

Original Full Papers

• Sandip Aine and Maxim Likhachev.
  Anytime Truncated D*: Anytime Replanning with Truncation
• Taha Arbaoui, Jean-Paul Boufflet and Aziz Moukrim.
  An Analysis Framework for Examination Timetabling
• Alejandro Arbelaez and Luis Quesada.
  Parallelising the k-Medoids Clustering Problem Using Space-Partitioning
• Peter Jonsson, Christer Bäckström and Simon Ståhlberg.
  Fast Detection of Unsolvable Planning Instances Using Local Consistency
• Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan and Steven Okamoto.
  Multi-Agent Path Finding for Self Interested Agents
• Ethan Burns, Scott Kiesel and Wheeler Ruml.
  Experimental Real-time Heuristic Search Results in a Video Game
• John P. Dickerson and Tuomas Sandholm.
  Throwing darts: Random sampling helps tree search when the number of short certificates is moderate
• Carmel Domshlak and Zohar Feldman.
  To UCT, or not to UCT? (Position Paper)
• Florian Drews and Dennis Luxen.
  Multi-Hop Ride Sharing
• Lucie Galand, Anisse Ismaili, Patrice Perny and Olivier Spanjaard.
  Bidirectional Preference-based Search for Multiobjective State Space Graph Problems.
• Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert C. Holte and Jonathan Schaeffer.
  Optimal-Generation Variants of EPEA*
• Matthew Hatem, Roni Stern and Wheeler Ruml.
  Bounded Suboptimal Heuristic Search in Linear Space
• Michael Katz and Jörg Hoffmann.
  Red-Black Relaxed Plan Heuristics Reloaded
• Athanasios Krontiris, Ryan Luna and Kostas Bekris.
  From Feasibility Tests to Path Planners for Multi-Agent Pathfinding
• Levi Lelis.
  Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics
• Yuri Malitsky, Deepak Mehta and Barry O'Sullivan.
  Evolving Instance Specific Algorithm Configuration
• André Grahl Pereira, Marcus Rolf Peter Ritt and Luciana Salete Buriol.
  Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
• Naina Razakarison, Nicolas Beldiceanu, Mats Carlsson and Helmut Simonis.
  GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials
• Nicolás Rivera, León Illanes, Jorge Baier and Carlos Hernández Ulloa.
  Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search
  Best student paper
• Guni Sharon, Nathan Sturtevant and Ariel Felner.
  Online Detection of Dead States in Real-Time Agent-Centered Search
• Álvaro Torralba and Vidal Alcázar.
  Constrained Symbolic Search: On Mutexes, BDD Minimization and More
  Best paper
• Mauro Vallati, Chris Fawcett, Alfonso Emilio Gerevini, Holger H. Hoos and Alessandro Saetti.
  Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
• Hu Xu, Lei Shu and May Huang.
  Planning Paths with Fewer Turns on Grid Maps

Original Research Abstracts

• Faten Aljalaud and Nathan Sturtevant.
  Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)
• Hannah Bast and Sabine Storandt.
  Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract)
• Jan-Peter Calliess and Stephen Roberts.
  Multi-agent planning with mixed-integer programming and adaptive interaction constraint generation (Extended Abstract)
• Sabine Storandt.
  The Hierarchy in Grid Graphs (Extended Abstract)

Previously Published Work Presented at SoCS 2013

• Daniel Delling, Andrew Goldberg, Thomas Pajor and Renato Werneck.
  Customizable Route Planning in Road Networks
  (based on two papers published at SEA 2011 and SEA 2013)
  Best poster presentation
• Daniel Delling, Thomas Pajor and Renato Werneck.
  Round-Based Public Transit Routing
  (published at ALENEX 2012)
• Stefan Funke and Sabine Storandt.
  Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
  (published at ALENEX 2013)
• Carlos Linares López, Roni Stern and Ariel Felner.
  Target-Value Search Revisited (Extended Abstract)
  (published at IJCAI 2013)
• Dennis Luxen and Dennis Schieferdecker.
  Candidate Sets for Alternative Routes in Road Networks
  (published at SEA 2012)
• Frans Oliehoek, Matthijs Spaan, Christopher Amato and Shimon Whiteson.
  Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs
  (published in JAIR 46, 2013)
• Florian Pommerening, Gabriele Röger and Malte Helmert.
  Getting the Most Out of Pattern Databases for Classical Planning
  (published at IJCAI 2013)
• Chris Rayner, Nathan Sturtevant and Michael Bowling.
  Subset Selection of Search Heuristics
  (published at IJCAI 2013)
• Nicolás Rivera, Jorge Baier and Carlos Hernández Ulloa.
  Weighted Real-Time Heuristic Search
  (published at AAMAS 2013)
• Jendrik Seipp and Malte Helmert.
  Counterexample-guided Cartesian Abstraction Refinement
  (published at ICAPS 2013)
• Nathan Sturtevant and Matthew Rutherford.
  Minimizing Writes in Parallel External Memory Search
  (published at IJCAI 2013)
• David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner and Erez Karpas .
  Towards Rational Deployment of Multiple Heuristics in A*
  (published at IJCAI 2013)
• Martin Wehrle, Malte Helmert, Yusra Alkhazraji and Robert Mattmüller.
  The Relative Pruning Power of Strong Stubborn Sets and Expansion Core
  (published at ICAPS 2013)