Kinematics of continuum planar grasping

• URL: http://arxiv.org/abs/2604.09800v1
• Date: Fri, 10 Apr 2026 18:22:41 GMT
• Title: Kinematics of continuum planar grasping
• Abstract summary: The paper presents an analytical framework to study the geometry arising when a soft continuum arm grasps a planar object.<n>Both the arm centerline and the object boundary are modeled as smooth curves.<n>The grasping problem is formulated as a kinematic boundary following problem, in which the object boundary acts as the arm's'shadow curve'
• Score: 1.820191017437162
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper presents an analytical framework to study the geometry arising when a soft continuum arm grasps a planar object. Both the arm centerline and the object boundary are modeled as smooth curves. The grasping problem is formulated as a kinematic boundary following problem, in which the object boundary acts as the arm's 'shadow curve'. This formulation leads to a set of reduced kinematic equations expressed in terms of relative geometric shape variables, with the arm curvature serving as the control input. An optimal control problem is formulated to determine feasible arm shapes that achieve optimal grasping configurations, and its solution is obtained using Pontryagin's Maximum Principle. Based on the resulting optimal grasp kinematics, a class of continuum grasp quality metrics is proposed using the algebraic properties of the associated continuum grasp map. Feedback control aspects in the dynamic setting are also discussed. The proposed methodology is illustrated through systematic numerical simulations.

Related papers

• Learning Smooth SE(3) Trajectories under Left-Invariant Riemannian Metrics [11.609667074830412]
  This paper presents a learning-based framework for approximating higher-order smooth trajectories on SE(3) on Lie groups.<n>The proposed framework enables generalization across diverse metric structures and motion conditions.<n>We demonstrate two practical applications of the proposed framework: real-time generation of diverse motion primitives and refinement for quadrotor flight.
  arXiv  Detail & Related papers  (2026-08-03T00:40:03Z)
• Computing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis [23.336775580260337]
  Curvature of planar curves serves as a key regularization term for computing second-order minimal paths.<n>We propose a new curvature-bounded geodesic model, developed under the Hamilton-Jacobi-Bellman (HJB) partial differential equation (PDE) framework.<n> Numerical experiments demonstrate that the proposed curvature-bounded geodesic model serves as a powerful and robust tool for finding satisfactory paths.
  arXiv  Detail & Related papers  (2026-06-11T14:13:24Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• A Boundary Integral-based Neural Operator for Mesh Deformation [10.460831049056761]
  This paper presents an efficient mesh deformation method based on boundary integration and neural operators.<n>A key technical advantage of our framework is the mathematical decoupling of the physical integration process from the geometric representation.<n> Numerical experiments, including large deformations of flexible beams and rigid-body motions of NACA airfoils, confirm the model's high accuracy and strict adherence to the principles of linearity and superposition.
  arXiv  Detail & Related papers  (2026-02-27T06:09:07Z)
• Collision Detection with Analytical Derivatives of Contact Kinematics [2.9976270169593495]
  Differentiable contact kinematics are essential for gradient-based methods in robotics.<n>We develop iDCOL, an implicit differentiable collision detection and contact kinematics framework.
  arXiv  Detail & Related papers  (2026-02-03T08:34:31Z)
• ARC-Flow : Articulated, Resolution-Agnostic, Correspondence-Free Matching and Interpolation of 3D Shapes Under Flow Fields [4.706075725469252]
  This work presents a unified framework for the unsupervised prediction of physically plausibles between two 3D articulated shapes.<n>Interpolation is modelled as a diffeomorphic transformation using a smooth, time-varying flow field governed by Neural Ordinary Differential Equations (ODEs)<n>Correspondence is recovered using an efficient Varifold formulation, that is effective on high-fidelity surfaces with differing parameterisations.
  arXiv  Detail & Related papers  (2025-03-04T13:28:05Z)
• Stochastic Nonlinear Control via Finite-dimensional Spectral Dynamic Embedding [20.43835169613882]
  This paper proposes an approach, Spectral Dynamics Embedding Control (SDEC), to optimal control for nonlinear systems.<n>It reveals an infinite-dimensional feature representation induced by the system's nonlinear dynamics, enabling a linear representation of the state-action value function.<n>For practical implementation, this representation is approximated using finite-dimensional truncations.
  arXiv  Detail & Related papers  (2023-04-08T04:23:46Z)
• Constrained Mass Optimal Transport [0.0]
  This paper introduces the problem of constrained optimal transport. A family of algorithms is introduced to solve a class of constrained saddle point problems. Convergence proofs and numerical results are presented.
  arXiv  Detail & Related papers  (2022-06-05T06:47:25Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
  We propose a novel optimization backbone for visual SLAM systems. We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems. Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
  arXiv  Detail & Related papers  (2020-11-02T18:02:26Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Conditional gradient methods for stochastically constrained convex minimization [54.53786593679331]
  We propose two novel conditional gradient-based methods for solving structured convex optimization problems. The most important feature of our framework is that only a subset of the constraints is processed at each iteration. Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
  arXiv  Detail & Related papers  (2020-07-07T21:26:35Z)
• Cogradient Descent for Bilinear Optimization [124.45816011848096]
  We introduce a Cogradient Descent algorithm (CoGD) to address the bilinear problem. We solve one variable by considering its coupling relationship with the other, leading to a synchronous gradient descent. Our algorithm is applied to solve problems with one variable under the sparsity constraint.
  arXiv  Detail & Related papers  (2020-06-16T13:41:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.