Parallel Bidirectional A* Search for GPU-Accelerated Pathfinding
Open Access
- 5 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 382-394
Abstract
No abstract availableFunding Information
- University Research Board, American University of Beirut (28005-104631)
This publication has 59 references indexed in Scilit:
- A Compiler Framework for Optimizing Dynamic Parallelism on GPUs2022
- Two new bidirectional search algorithmsComputational Optimization and Applications, 2021
- Accelerating Vertex Cover Optimization on a GPU Architecture2018
- Efficient breadth-first search on a heterogeneous processor2014
- Parallel Breadth First Search on GPU clusters2014
- Parallel distributed breadth first search on GPU2013
- Efficient breadth first search on multi-GPU systemsJournal of Parallel and Distributed Computing, 2013
- Hybrid Path Planning for Massive Crowd Simulation on the GPU2011
- Fast and lock-free concurrent priority queues for multi-thread systemsJournal of Parallel and Distributed Computing, 2005
- An efficient algorithm for concurrent priority queue heapsInformation Processing Letters, 1996