Proceedings of the Sixth Annual Symposium on Combinatorial Search
Edited by Malte Helmert, Gabriele Röger,
Leavenworth, Washington USA, July 11–13, 2013. Published by The AAAI Press, Palo Alto, California. This proceedings is also available in book format.
Contents
SoCS 2013 Organization
Malte Helmert, Gabriele Röger
Invited Speakers
J. Christopher Beck, Gene Cooperman
Preface
Malte Helmert, Gabriele Röger
Full Papers
Anytime Truncated D* : Anytime Replanning with Truncation
Sandip Aine, Maxim Likhachev
An Analysis Framework for Examination Timetabling
Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim
Parallelising the k-Medoids Clustering Problem Using Space-Partitioning
Alejandro Arbelaez, Luis Quesada
Fast Detection of Unsolvable Planning Instances Using Local Consistency
Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Multi-Agent Path Finding for Self Interested Agents
Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto
Experimental Real-Time Heuristic Search Results in a Video Game
Ethan Burns, Scott Kiesel, Wheeler Ruml
Throwing Darts: Random Sampling Helps Tree Search when the Number of Short Certificates Is Moderate
John Paul Dickerson, Tuomas Sandholm
To UCT, or not to UCT? (Position Paper)
Carmel Domshlak, Zohar Feldman
Multi-Hop Ride Sharing
Florian Drews, Dennis Luxen
Bidirectional Preference-Based Search for State Space Graph Problems
Lucie Galand, Anisse Ismaili, Patrice Perny, Olivier Spanjaard
Optimal-Generation Variants of EPEA*
Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer
Bounded Suboptimal Heuristic Search in Linear Space
Matthew Hatem, Roni Stern, Wheeler Ruml
Red-Black Relaxed Plan Heuristics Reloaded
Michael Katz, Joerg Hoffmann
From Feasibility Tests to Path Planners for Multi-Agent Pathfinding
Athanasios Krontiris, Ryan Luna, Kostas E. Bekris
Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics
Levi H. S. Lelis
Evolving Instance Specific Algorithm Configuration
Yuri Malitsky, Deepak Mehta, Barry O'Sullivan
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
André Grahl Pereira, Marcus Rolf Peter Ritt, Luciana Salete Buriol
GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials
Naina Razakarison, Mats Carlsson, Nicolas Beldiceanu, Helmut Simonis
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search
Nicolas Rivera, Leon Illanes, Jorge A. Baier, Carlos Hernandez
Online Detection of Dead States in Real-Time Agent-Centered Search
Guni Sharon, Nathan Sturtevant, Ariel Felner
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
Álvaro Torralba, Vidal Alcázar
Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
Mauro Vallati, Chris Fawcett, Alfonso Emilio Gerevini, Holger Hoos, Alessandro Saetti
Planning Paths with Fewer Turns on Grid Maps
Hu Xu, Lei Shu, May Huang
Research Abstracts
Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)
Faten Aljalaud, Nathan R. Sturtevant
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract)
Hannah Bast, Sabine Storandt
Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract)
Jan-P. Calliess, Stephen J. Roberts
The Hierarchy in Grid Graphs (Extended Abstract)
Sabine Storandt
Extended Abstracts
Customizable Route Planning in Road Networks (Extended Abstract)
Daniel Delling, Andrew Vladislav Goldberg, Thomas Pajor, Renato Fonseca Werneck
Round-Based Public Transit Routing (Extended Abstract)
Daniel Delling, Thomas Pajor, Renato Fonseca Werneck
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives
Stefan Funke, Sabine Storandt
Target-Value Search Revisited (Extended Abstract)
Carlos Linares López, Roni Stern, Ariel Felner
Candidate Sets for Alternative Routes in Road Networks (Extended Abstract)
Dennis Luxen, Dennis Schieferdecker
Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract)
David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.