Abstract is missing.
- Robust Multi-Agent Path FindingDor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou. 2-9 [doi]
- Bounded Suboptimal Game Tree SearchDor Atzmon, Roni Stern, Abdallah Saffidine. 10-18 [doi]
- A Refined Understanding of Cost-Optimal Planning with Polytree Causal GraphsChrister Bäckström, Peter Jonsson, Sebastian Ordyniak. 19-27 [doi]
- GBFHS: A Generalized Breadth-First Heuristic Search AlgorithmMichael W. Barley, Patricia J. Riddle, Carlos Linares López, Sean Dobson, Ira Pohl. 28-36 [doi]
- A Regression-Based Methodology for Online Algorithm SelectionHans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff. 37-45 [doi]
- Online Refinement of Cartesian Abstraction HeuristicsRebecca Eifler, Maximilian Fickert. 46-54 [doi]
- Forward Search in Contraction HierarchiesDaniel Damir Harabor, Peter J. Stuckey. 55-62 [doi]
- k Grid Path PlanningBenjamín Kramm, Nicolas Rivera, Carlos Hernández, Jorge A. Baier. 63-71 [doi]
- StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential DiagnosisPatrick Rodler, Manuel Herold. 72-80 [doi]
- Minimizing Node Expansions in Bidirectional Search with Consistent HeuristicsEshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein. 81-98 [doi]
- Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding ProblemPavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. 90-105 [doi]
- Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial AbstractionsSilvan Sievers. 99 [doi]
- Fast Near-Optimal Path Planning on State Lattices with Subgoal GraphsTansel Uras, Sven Koenig. 106-114 [doi]
- Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction ProblemsHong Xu 0003, Cheng Cheng, Sven Koenig, T. K. Satish Kumar. 115-123 [doi]
- Fast k-Nearest Neighbor on a Navigation MeshShizhe Zhao, David Taniar, Daniel Damir Harabor. 124-132 [doi]
- Using Algorithm Configuration Tools to Generate Hard SAT BenchmarksTomás Balyo, Lukás Chrpa. 133-137 [doi]
- On the Complexity of Quantum Circuit CompilationAdi Botea, Akihiro Kishimoto, Radu Marinescu 0002. 138-142 [doi]
- Benchmarks for Pathfinding in 3D Voxel SpaceDaniel Brewer, Nathan R. Sturtevant. 143-147 [doi]
- Rapid Randomized Restarts for Multi-Agent Path Finding SolversLiron Cohen 0002, Glenn Wagner, David M. Chan, Howie Choset, Nathan Sturtevant, Sven Koenig, T. K. Satish Kumar. 148-152 [doi]
- Position Paper: Using Early Goal Test in AAriel Felner. 153-157 [doi]
- Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty PruningMaximilian Fickert. 158-162 [doi]
- Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTAShane Kochvi, Wheeler Ruml. 163-167 [doi]
- Focused SANA: Speeding Up Network AlignmentIlia Leybovich, Rami Puzis, Roni Stern, Maor Reuben. 168-172 [doi]
- A Neural Network for Decision Making in Real-Time Heuristic SearchFranco Muñoz, Miguel Fadic, Carlos Hernández, Jorge A. Baier. 173-177 [doi]
- Stubborn Sets Pruning for Privacy Preserving PlanningTim Schulte. 178-183 [doi]
- k-Nearest Neighbors on Road Networks: Euclidean Heuristic RevisitedTenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar. 184-185 [doi]
- Extended Abstract: The Heuristic Search Research FrameworkMeir Goldenberg. 186 [doi]