Vol. 10 No. 1 (2019): Twelfth Annual Symposium on Combinatorial Search
Long Papers
Guiding Search with Generalized Policies for Probabilistic Planning
PDFImproving Bidirectional Heuristic Search by Bounds Propagation
PDFRepairing Compressed Path Databases on Maps with Dynamic Changes
PDFIntuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing
PDFOn SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective
PDFRevisiting Suboptimal Search
PDFLearning and Utilizing Interaction Patterns among Neighborhood-Based Heuristics
PDFZero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles
PDFOptimal and Bounded-Suboptimal Multi-Agent Motion Planning
PDFChallenging Human Supremacy in Skat
PDFFinding Optimal Longest Paths by Dynamic Programming in Parallel
PDFPASAR — Planning as Satisfiability with Abstraction Refinement
PDFNovelty Messages Filtering for Multi Agent Privacy-Preserving Plannin
PDFTrial-Based Heuristic Tree-Search for Distributed Multi-Agent Planning
PDF
Short Papers
Extended Abstracts
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results
PDFSymmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding
PDFMulti-Agent Path Finding for Large Agents
PDFExtended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding
PDFExtended Abstract: Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery
PDFA-MHA*: Anytime Multi-Heuristic A*
PDFGeneralized Target Assignment and Path Finding Using Answer Set Programming
PDFEnriching Non-Parametric Bidirectional Search Algorithms — Extended Abstract
PDFAlgorithms for Average Regret Minimization
PDFMulti-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)
PDFUnifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories
PDFUnbounded Sub-Optimal Conflict-Based Search in Complex Domains
PDFLearning to Generate Industrial SAT Instances
PDFMeasuring the Vulnerability of a Multi-Agent Pathfinding Solution
PDFA Learning-Based Framework for Memory-Bounded Heuristic Search: First Results
PDFA Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics
PDFA Theoretical Comparison of the Bounds of MM, NBS, and GBFHS
PDFProbabilistic Robust Multi-Agent Path Finding
PDFA General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences
PDFAn Improved Algorithm for Optimal Coalition Structure Generation
PDFReal-Time Heuristic Search in Dynamic Environments
PDFAssigning Suppliers to Meet a Deadline
PDFImproved Safe Real-Time Heuristic Search
PDFCompiling Cost-Optimal Multi-Agent Pathfinding to ASP
PDFBrigitte, a Bridge-Based Grid Path-Finder
PDF