Accepted Papaers

Below is the list of papers accepted to SoCS 2017.

Long Papers

• Ariel Felner, Eli Boyarski, Guni Sharon, Roni Stern, Meir Goldenberg, Solomon Eyal Shimony, Pavel Surynek, Nathan Sturtevant and Glenn Wagner.
  Search-based Optimal Solvers for the Multi-agent Pathfinding Problem: Summary and Challenges.
  
• Federico Falcone, Alessandro Saetti and Alfonso Gerevini.
  On Realizing Planning Programs in Domains with Dead-end States.
  
• Eshed Shaham, Ariel Felner, Jingwei Chen and Nathan Sturtevant.
  The Minimal Set of States that Must be Expanded in a Front-to-end Bidirectional Search.
  
• Seongsoo Moon and Mary Inaba.
  Boost SAT Solver with Hybrid Branching Heuristic.
  
• Vincent Cicirello.
  Variable Annealing Length and Parallelism in Simulated Annealing.
  
• Eldan Cohen and J. Christopher Beck.
  Cost-based Heuristics and Node Re-Expansions Across the Phase Transition.
  
• Gerald Paul, Gabriele Röger, Thomas Keller and Malte Helmert.
  Optimal Solutions to Large Logistics Planning Domain Problems.
  
• Shunhao Oh and Hon Wai Leong.
  Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths.
  
• Maximilian Fickert and Joerg Hoffmann.
  Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
  
• Manuel Heusner, Thomas Keller and Malte Helmert.
  Understanding the Search Behaviour of Greedy Best-First Search.
  
• Silvan Sievers, Martin Wehrle, Malte Helmert and Michael Katz.
  Strengthening Canonical Pattern Databases with Structural Symmetries.
  
• Richard Valenzano and Danniel Yang.
  An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle.
  
• Tansel Uras and Sven Koenig.
  Feasibility Study: Subgoal Graphs on State Lattices.
  

Short Papers

• Daniel Gilon, Roni Stern and Ariel Felner.
  Dynamic Potential Search on Weighted Graphs.
  
• Francesco Percassi, Alfonso Emilio Gerevini and Hector Geffner.
  On Planning with Dual Heuristics for Guiding and Pruning the Search in LAMA.
  
• Daniel Gnad, Álvaro Torralba and Joerg Hoffmann.
  Symbolic Leaf Representation in Decoupled Search.
  
• Jendrik Seipp.
  Better Orders for Saturated Cost Partitioning in Optimal Classical Planning.
  
• Malte Helmert, Nathan Sturtevant and Ariel Felner.
  On Variable Dependencies and Compressed Pattern Databases.
  
• Nicolás Hormazabal, Antonio Díaz, Carlos Hernández Ulloa and Jorge Baier.
  Fast and Almost Optimal Any-Angle Pathfinding Using the 2^k Neighborhoods.
  
• Satoru Horie and Alex Fukunaga.
  Block-Parallel IDA* for GPUs.
  

Extended Abstracts

• Hong Xu, T. K. Satish Kumar and Sven Koenig.
  A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs.
  
• Roni Stern, Meir Goldenberg and Ariel Felner.
  Shortest Path for K Goals.
  
• Pavel Surynek, Ariel Felner, Roni Stern and Eli Boyarski.
  Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants.
  
• Dor Atzmon, Roni Stern, Ariel Felner, Roman Barták and Glenn Wagner.
  k-Robust Multi-Agent Path Finding.
  
• Ishani Chatterjee, Maxim Likhachev and Manuela Veloso.
  Search Reduction Through Conservative Abstract-Space Based Heuristic.
  
• Mauro Vallati, Lukas Chrpa and Lee Mccluskey.
  Improving a Planner's Performance through Online Heuristic Configuration of Domain Models.
  
• Nils Froleyks.
  Using an Algorithm Portfolio to Solve Sokoban.
  
• Johannes Aldinger and Bernhard Nebel.
  Interval Based Relaxation Heuristics for Numeric Planning with Action Costs.
  
• Stefan Edelkamp, Eike Externest, Sabine Kuske and Sebastian Kühl.
  A Framework for Monte-Carlo Search Solving Graph Optimization Problems.
  
• Alberto Camacho, Oscar Chen, Scott Sanner and Sheila McIlraith.
  Non-Markovian Rewards Expressed in LTL: Guiding Search via Reward Shaping.
  

Previously Published Papers and Late-Breaking Posters

• Carlos Hernández Ulloa, Adi Botea, Jorge Baier and Vadim Bulitko.
  Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads.
  
• Christabel Wayllace, Ping Hou, William Yeoh and Tran Cao Son.
  Goal Recognition Design with Stochastic Agent Action Outcomes.
  
• Vincent Cicirello.
  Searching for a Permutation in a Haystack.
  
• Nicolás Rivera, Carlos Hernández Ulloa and Jorge Baier.
  Grid Pathfinding on the 2^k Neighborhoods.
  
• Masataro Asai, Akihiro Kishimoto, Adi Botea, Radu Marinescu, Elizabeth M. Daly and Spyros Kotoulas.
  Efficient Optimal Search under Expensive Edge Cost Computation.
  
• Raquel Fuentetaja, Michael W. Barley, Daniel Borrajo, Jordan Douglas, Santiago Franco and Patricia Riddle.
  Meta-Search Through the Space of Representations and Heuristics on a Problem by Problem Basis.
  
• Hong Xu, Xin-Zeng Wu, T. K. Satish Kumar and Sven Koenig.
  The Buss Reduction for the k-Weighted Vertex Cover Problem.
  
• Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset and Sven Koenig.
  Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.
  
• Liron Cohen, T. K. Satish Kumar, Tansel Uras and Sven Koenig.
  The FastMap Algorithm for Shortest Path Computations.
  
• Daniel Gnad, Valerie Poser and Joerg Hoffmann.
  Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search.
  
• Santiago Franco, Álvaro Torralba, Levi H. S. Lelis and Mike Barley.
  On Creating Complementary Pattern Databases.
  
• Vadim Bulitko.
  Effects of Self-knowledge in Real-time Heuristic Search: First Results.
  
• Mina Abdi Oskouie and Vadim Bulitko.
  Robustness of Real-time Heuristic Search Algorithms to Input/Output Error in Externally Stored Heuristics.
  
• Eshed Shaham, Ariel Felner and Jeffrey S. Rosenschein.
  Memory-Bounded Bidirectional Search.
  
• Kazuki Yoshizoe, Aika Terada and Koji Tsuda.
  Redesigning pattern mining algorithms for supercomputers.
  
• Devon Sigurdson and Vadim Bulitko.
  Deep Learning for Real-time Heuristic Search Algorithm Selection.
  
• Sneha Sawlani and Nathan Sturtevant.
  Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks.
  
• Franco Muñoz, Miguel Fadic, Jorge Baier and Carlos Hernández Ulloa.
  Using a Neural Network to Make Decisions in Real-Time Heuristic Search.
  
• Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant.
  Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions.