Vol. 11 No. 1 (2018): Eleventh Annual Symposium on Combinatorial Search
Full Papers
Robust Multi-Agent Path Finding
PDFBounded Suboptimal Game Tree Search
PDFA Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs
PDFGBFHS: A Generalized Breadth-First Heuristic Search Algorithm
PDFA Regression-Based Methodology for Online Algorithm Selection
PDFOnline Refinement of Cartesian Abstraction Heuristics
PDFForward Search in Contraction Hierarchies
PDFA Suboptimality Bound for 2k Grid Path Planning
PDFStaticHS: A Variant of Reiter’s Hitting Set Tree for Efficient Sequential Diagnosis
PDFMinimizing Node Expansions in Bidirectional Search with Consistent Heuristics
PDFMerge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions
PDFSub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem
PDFFast Near-Optimal Path Planning on State Lattices with Subgoal Graphs
PDFMessage Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems
PDFFast k-Nearest Neighbor on a Navigation Mesh
PDF
Short Papers
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers
PDFPosition Paper: Using Early Goal Test in A*
PDFMaking Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning
PDFDoes Fast Beat Thorough? Comparing RTAA* and LSS-LRTA*
PDFFocused SANA: Speeding Up Network Alignment
PDFA Neural Network for Decision Making in Real-Time Heuristic Search
PDFStubborn Sets Pruning for Privacy Preserving Planning
PDFUsing Algorithm Configuration Tools to Generate Hard SAT Benchmarks
PDFOn the Complexity of Quantum Circuit Compilation
PDFBenchmarks for Pathfinding in 3D Voxel Space
PDF