GPU-based parallel collision detection for fast motion planning
- 19 December 2011
- journal article
- research article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 31 (2), 187-200
- https://doi.org/10.1177/0278364911429335
Abstract
We present parallel algorithms to accelerate collision queries for sample-based motion planning. Our approach is designed for current many-core GPUs and exploits data-parallelism and multi-threaded capabilities. In order to take advantage of the high number of cores, we present a clustering scheme and collision-packet traversal to perform efficient collision queries on multiple configurations simultaneously. Furthermore, we present a hierarchical traversal scheme that performs workload balancing for high parallel efficiency. We have implemented our algorithms on commodity NVIDIA GPUs using CUDA and can perform 500, 000 collision queries per second with our benchmarks, which is 10 times faster than prior GPU-based techniques. Moreover, we can compute collision-free paths for rigid and articulated models in less than 100 ms for many benchmarks, almost 50–100 times faster than current CPU-based PRM planners.Keywords
This publication has 21 references indexed in Scilit:
- gProximity: Hierarchical GPU‐based Operations for Collision and Distance QueriesComputer Graphics Forum, 2010
- MCCD: Multi-core collision detection between deformable models using front-based decompositionGraphical Models, 2010
- HPCCD: Hybrid Parallel Continuous Collision Detection using CPUs and GPUsComputer Graphics Forum, 2009
- Fast BVH Construction on GPUsComputer Graphics Forum, 2009
- A performance study of general-purpose applications on graphics processors using CUDAJournal of Parallel and Distributed Computing, 2008
- A Survey of General‐Purpose Computation on Graphics HardwareComputer Graphics Forum, 2007
- Scalable Clustering Algorithms with Balancing ConstraintsData Mining and Knowledge Discovery, 2006
- Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query RoadmapsPublished by Springer Science and Business Media LLC ,2005
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Robot Motion Planning: A Distributed Representation ApproachThe International Journal of Robotics Research, 1991