首页> 外文OA文献 >GPU-based proximity query processing on unstructured triangular mesh model
【2h】

GPU-based proximity query processing on unstructured triangular mesh model

机译:基于GpU的非结构化三角网格模型的邻近查询处理

摘要

This paper presents a novel proximity query (PQ) approach capable to detect the collision and calculate the minimal Euclidean distance between two non-convex objects in 3D, namely the robot and the environment. Such approaches are often considered as computationally demanding problems, but are of importance to many applications such as online simulation of haptic feedback and robot collision-free trajectory. Our approach enables to preserve the representation of unstructured environment in the form of triangular meshes. The proposed PQ algorithm is computationally parallel so that it can be effectively implemented on graphics processing units (GPUs). A GPU-based computation scheme is also developed and customized, which shows >200 times faster than an optimized CPU with single core. Comprehensive validation is also conducted on two simulated scenarios in order to demonstrate the practical values of its potential application in image-guided surgical robotics and humanoid robotic control.
机译:本文提出了一种新颖的邻近查询(PQ)方法,该方法能够检测碰撞并计算3D中两个非凸对象(即机器人与环境)之间的最小欧几里得距离。此类方法通常被认为是计算上的高要求问题,但对于许多应用(例如,触觉反馈的在线模拟和机器人的无碰撞轨迹)具有重要意义。我们的方法能够以三角网格的形式保留非结构化环境的表示形式。提出的PQ算法在计算上是并行的,因此可以在图形处理单元(GPU)上有效地实现。还开发和定制了基于GPU的计算方案,其显示速度比单核优化CPU快200倍以上。为了验证其在图像引导手术机器人和类人机器人控制中的潜在应用的实用价值,还对两种模拟情况进行了全面验证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号