Vol. 3 No. 1 (2012): Fifth Annual Symposium on Combinatorial Search
Full Papers
Abstracting Abstraction in Search II: Complexity Analysis
PDFAutomatic Move Pruning Revisited
PDFImplementing Fast Heuristic Search Code
PDFReal-Time Motion Planning with Dynamic Obstacles
PDFExecution Ordering in AND/OR Graphs with Failure Probabilities
PDFEfficient Implementation of Pattern Database Heuristics for Classical Planning
PDFA Theoretical Framework for Studying Random Walk Planning
PDFPerformance Analysis of Planning Portfolios
PDFMultimapping Abstractions and Hierarchical Heuristic Search
PDFBidirectional A* Search with Additive Approximation Bounds
PDFMulti-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives
PDFMeta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding
PDFEfficient Single Frontier Bidirectional Search
PDFSearch-Aware Conditions for Probably Approximately Correct Heuristic Search
PDFBetter Parameter-Free Anytime Search by Minimizing Time Between Solutions
PDFAre We There Yet? — Estimating Search Progress
PDFWhen Does Weighted A* Fail?
PDFAdaptive Parallelization for Constraint Satisfaction Search
PDFHTN Problem Spaces: Structure, Algorithms, Termination
PDF
Short Papers
Position Paper: Incremental Search Algorithms Considered Poorly Understood
PDFAbstraction-Guided Sampling for Motion Planning
PDFDiverse Depth-First Search in Satisificing Planning
PDFLearning Heuristic Functions Faster by Using Predicted Solution Costs
PDFReal-Time Optimization-Based Planning in Dynamic Environments Using GPUs
PDFMotion Planning With Differential Constraints as Guided Search Over Continuous and Discrete Spaces
PDFNon-Optimal Multi-Agent Pathfinding is Solved (Since 1984)
PDFAlternative Forms of Bounded Suboptimal Search
PDFSubdimensional Expansion and Optimal Task Reassignment
PDFOn Improving Plan Quality via Local Enhancements
PDFA* Variants for Optimal Multi-Agent Pathfinding
PDF
Extended Abstracts of Papers Presented Elsewhere
Partial-Expansion A* with Selective Node Generation
PDFIterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract)
PDFPaper Summary: Time-Bounded Adaptive A*
PDFPredicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract)
PDFE-Graphs: Bootstrapping Planning with Experience Graphs
PDFConflict-Based Search for Optimal Multi-Agent Path Finding
PDFA SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints
PDFMCTS Based on Simple Rerget
PDFEfficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract
PDF
Grid-Based Path Planning Competition
Tree Cache
PDFFast, Optimal Pathfinding with Compressed Path Databases
PDF2D Path Planning Based on Dijkstra’s Algorithm and Pseudo Priority Queues
PDFThe JPS Pathfinding System
PDFFast Path Planning Through Segmentation of the Map into Manhattan-Cohesive Areas
PDFPrecomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding
PDFSubgoal Graphs for Eight-Neighbor Gridworlds
PDF