File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: GPU-based parallel collision detection for fast motion planning

TitleGPU-based parallel collision detection for fast motion planning
Authors
Keywordspath planning for manipulators
real-time planning
simulation
virtual reality
collision detection
Issue Date2012
Citation
International Journal of Robotics Research, 2012, v. 31, n. 2, p. 187-200 How to Cite?
AbstractWe 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. © SAGE Publications 2011.
Persistent Identifierhttp://hdl.handle.net/10722/206263
ISSN
2015 Impact Factor: 2.489
2015 SCImago Journal Rankings: 4.184
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorPan, Jia-
dc.contributor.authorManocha, Dinesh-
dc.date.accessioned2014-10-22T01:25:32Z-
dc.date.available2014-10-22T01:25:32Z-
dc.date.issued2012-
dc.identifier.citationInternational Journal of Robotics Research, 2012, v. 31, n. 2, p. 187-200-
dc.identifier.issn0278-3649-
dc.identifier.urihttp://hdl.handle.net/10722/206263-
dc.description.abstractWe 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. © SAGE Publications 2011.-
dc.languageeng-
dc.relation.ispartofInternational Journal of Robotics Research-
dc.subjectpath planning for manipulators-
dc.subjectreal-time planning-
dc.subjectsimulation-
dc.subjectvirtual reality-
dc.subjectcollision detection-
dc.titleGPU-based parallel collision detection for fast motion planning-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1177/0278364911429335-
dc.identifier.scopuseid_2-s2.0-84856702729-
dc.identifier.volume31-
dc.identifier.issue2-
dc.identifier.spage187-
dc.identifier.epage200-
dc.identifier.eissn1741-3176-
dc.identifier.isiWOS:000299847300005-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats