A fast n-dimensional ray-shooting algorithm for grasping force optimization

We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set with a ray emanating from an interior point of the set and represents the intersection point as a convex combination of a set of affinely independent points. We use our intersection algorithm to compute two types of optimal grasping forces, where either the sum or the maximum of normal force components is minimized. In our simulation, the algorithm converges well and performs the computations in tens of milliseconds on a laptop.

Authors

• Yu Zheng 0001
• Ming Lin 0003
• Dinesh Manocha

Keywords

• Friction
• Portable computers
• Algorithm design and analysis
• Computer graphics
• Computational efficiency
• Contracts
• Robotics and automation
• USA Councils
• Computational modeling
• Acceleration
• Grasp Force
• Intersection Point
• Convergence Of Algorithm
• Convex Set
• Interior Point
• Compact Set
• Convex Combination
• Boundary Of Set
• Tens Of Milliseconds
• Compact Convex Set
• Computational Cost
• Friction Coefficient
• Functional Support
• Accurate Solution
• CPU Time
• Contact Force
• Minimum Force
• Polytope
• Nonlinear Boundary
• Singular Case