7 papers · 1 filter
A Parallel CPU-GPU Framework for Batching Heuristic Operations in Depth-First Heuristic Search
Ehsan Futuhi, Nathan R. Sturtevant
The rapid advancement of GPU technology has unlocked powerful parallel processing capabilities, creating new opportunities to enhance classic search algorithms. This hardware has b…
Online Submission and Evaluation System Design for Competition Operations
Zhe Chen, Daniel Harabor, Ryan Hechnenberger +1
Research communities have developed benchmark datasets across domains to compare the performance of algorithms and techniques However, tracking the progress in these research areas…
Parallelizing Multi-objective A* Search
Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2
The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…
On Parallel External-Memory Bidirectional Search
Lior Siag, Shahaf S. Shperberg, Ariel Felner +1
Parallelization and External Memory (PEM) techniques have significantly enhanced the capabilities of search algorithms when solving large-scale problems. Previous research on PEM h…
Set-Based Retrograde Analysis: Precomputing the Solution to 24-card Bridge Double Dummy Deals
Isaac Stone, Nathan R. Sturtevant, Jonathan Schaeffer
Retrograde analysis is used in game-playing programs to solve states at the end of a game, working backwards toward the start of the game. The algorithm iterates through and comput…
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning
Thayne T Walker, Nathan R Sturtevant
Conflict-Based Search (CBS) algorithm for the multi-agent pathfinding (MAPF) problem is that it is incomplete for problems which have no solution; if no mitigating procedure is run…