{"id":9301,"date":"2013-04-29T03:01:16","date_gmt":"2013-04-29T00:01:16","guid":{"rendered":"http:\/\/hgpu.org\/?p=9301"},"modified":"2013-04-29T03:01:16","modified_gmt":"2013-04-29T00:01:16","slug":"realtime-gpu-based-motion-planning-for-task-executions","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=9301","title":{"rendered":"RealTime GPU-Based Motion Planning for Task Executions"},"content":{"rendered":"<p>We present a realtime GPU-based motion planning algorithm for robot task executions. Many task execution strategies break down a high-level task planning problem into multiple low-level motion planning problems, and it is essential to solve those problems at interactive rates. In order to achieve high performance for the planning, our method exploits a high number of cores on commodity graphics processors (GPUs). We describe a parallel formulation of an RRT-based motion planning algorithm which is highly suited for single query motion planning. Our approach uses the properties of Poissondisk samples to achieve a high parallelism in order to exploit the computational capabilities of GPUs. Our approach can obtain 10-20X speedup over prior CPU-based motion planning algorithms, and we demonstrate the performance on a number of benchmarks.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We present a realtime GPU-based motion planning algorithm for robot task executions. Many task execution strategies break down a high-level task planning problem into multiple low-level motion planning problems, and it is essential to solve those problems at interactive rates. In order to achieve high performance for the planning, our method exploits a high number [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[36,11,89,3],"tags":[1787,1782,14,20,1306],"class_list":["post-9301","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-computer-science","category-nvidia-cuda","category-paper","tag-algorithms","tag-computer-science","tag-cuda","tag-nvidia","tag-nvidia-geforce-gtx-680"],"views":2340,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/9301","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=9301"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/9301\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9301"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=9301"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=9301"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}