SoCS 2015 Proceedings

Below is the list of papers accepted to SoCS 2015.

Original Full Papers

• Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel and Wheeler Ruml.
  Solving the Snake in the Box Problem with Heuristic Search: First Results.
  
• Álvaro Torralba and Peter Kissmann.
  Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink.
  
• Ariel Felner.
  Position paper: The Collapse Macro in Best-first Search Algorithms and an Iterative Variant of RBFS.
  
• Christopher Wilt and Wheeler Ruml.
  Building a Heuristic for Greedy Search.
  
• Daniel Gnad and Joerg Hoffmann.
  Red-Black Planning: A New Tractability Analysis and Heuristic Function.
  
• Daniel Gnad, Joerg Hoffmann and Carmel Domshlak.
  From Fork Decoupling to Star-Topology Decoupling.
  
• Dylan O'Ceallaigh and Wheeler Ruml.
  Metareasoning in Real-time Heuristic Search.
  
• Gaojian Fan and Robert Holte.
  The Spurious Path Problem in Abstraction.
  
• Liron Cohen, Sven Koenig and Tansel Uras.
  Using Highways for Bounded-Suboptimal Multi-Agent Path Finding.
  
• Raquel Fuentetaja, Lukas Chrpa, Lee Mccluskey and Mauro Vallati.
  Exploring the synergy between two modular learning techniques for Automated Planning.
  
• Salomé Simon and Gabriele Roeger.
  Finding and Exploiting LTL Trajectory Constraints in Heuristic Search.
  
• Venkatraman Narayanan, Sandip Aine and Maxim Likhachev.
  Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics.
  
• Yisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Yuval Elovici and Bracha Shapira.
  Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection in Markov Chains.
  
• Jakub Pawlewicz and Ryan Hayward.
  Sibling Conspiracy Number Search.
  
• Stefan Edelkamp and Zhihao Tang.
  Monte-Carlo Tree Search for the Multiple Sequence Alignment Problem.
  
• Sergio Jimenez Celorrio and Anders Jonsson.
  Computing Plans with Control Flow and Procedures using a Classical Planner.
  

Original Short Papers

• Athanasios Krontiris and Kostas Bekris.
  Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths.
  
• Carlos Linares López and Abdallah Saffidine.
  Position Paper: A Preliminary Selection of Problems in Heuristic Search.
  
• David Tolpin and Frank Wood.
  Maximum a Posteriori Estimation by Search in Probabilistic Models.
  
• Guni Sharon.
  Partial Domain Search Tree For Constraint-Satisfaction Problems.
  
• Julian Hernandez and Levi Lelis.
  Feature Selection as State-Space Search: An Empirical Study in Clustering Problems.
  
• Luca Ceriani and Alfonso Emilio Gerevini.
  Planning with Always Preferences and Soft Goals by Compilation into STRIPS with Action Costs.
  
• Lukas Chrpa, Enrico Scala and Mauro Vallati.
  Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements.
  
• Oded Betzalel, Ariel Felner and Solomon Eyal Shimony.
  Type System-based Rational Lazy IDA*.
  
• Rina Dechter, Lars Otten and Levi Lelis.
  Caching in Context-Minimal OR Spaces.
  
• Robert Kolchmeyer, Andrew Dobson and Kostas Bekris.
  Expected Path Degradation when Searching over a Sparse Grid Hierarchy.
  
• Sandip Aine, Charupriya Sharma and Maxim Likhachev.
  Learning to Search More Efficiently from Experience: A Multi-heuristic Approach.
  
• Tansel Uras and Sven Koenig.
  An Empirical Comparison of Any-Angle Path-Planning Algorithms.
  
• Tomáš Balyo and Roman Bartak.
  No One SATPlan Encoding To Rule Them All.
  
• Zahy Bnaya, Alon Palombo, Rami Puzis and Ariel Felner.
  Confidence Backup Updates for Aggregating MDP State values in Monte-Carlo Tree Search.
  

Original Research Abstracts

• Sascha Scherrer,Florian Pommerening and Martin Wehrle.
  Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract).
  
• Patricia Riddle, Mike Barley and Santiago Franco.
  Automated Transformation of Problem Representations.
  
• William Lam, Kalev Kask, and Rina Dechter.
  Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation.
  
• Vitali Sepetnitsky and Ariel Felner.
  To reopen or not to reopen in the context of Weighted A*? Classifications of different trends.
  

Previously Published Work Presented at SoCS 2015

• Alper Yorukcu and Doron Nussbaum.
  Moving Target Search with Subgoal Graphs.
  
• Benjamin Cohen,Mike Phillips and Maxim Likhachev.
  Planning Single-arm Manipulations with N-Arm Robots.
  
• David Surovik and Daniel Scheeres.
  Heuristic Search and Receding-Horizon Planning in Complex Spacecraft Orbit Domains.
  
• Eli Boyrasky, Ariel Felner, Roni Stern and Guni Sharon.
  Don't Split, Try To Work It Out : Bypassing Conflicts in Multi-Agent Pathfinding.
  
• Supriyo Ghosh,Pradeep Varakantham, Yossiri Adulyasak and Patrick Jaillet.
  Dynamic Redeployment to Counter Congestion or Starvation in Vehicle Sharing Systems.
  
• Zongzhang Zhang, David Hsu, Wee Sun Lee, Zhan Wei Lim and Aijun Bai.
  PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces.
  
• Ron Alford, Pascal Bercher and David Aha.
  Tight Bounds for HTN Planning with Task Insertion.
  
• Florian Geißer, Thomas Keller and Robert Mattmüller.
  Relaxations for Planning with State-Dependent Action Costs.
  
• Pavel Surynek.
  UNIAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding.