Optimal Contact Points for an Octopus Arm

We investigate the optimality of the configurations of a tentacle-like soft manipulator ensuring a planar force-closure condition. In particular, the optimization is performed with respect to both to the control strategies and to the set of contact points ensuring a planar, frictionless, first-order force-closure of the target. The case of an elliptic target object is discussed in detail, and numerical simulation are presented.


Introduction
In this paper, we investigate the optimality of the configurations of a tentacle-like soft manipulator ensuring a planar force closure condition on an elliptic target. The novelty consists in considering the set of contact points as an unknown of the optimization problem. Indeed, the contact points on the target object are selected to yield force-closure configurations, while minimizing an integral cost on the curvature of the manipulator. We adopt an optimal control theoretic approach: optimal contact points and optimal configuration satisfy stationarity conditions for a constrained minimization problem. In particular, the objective cost functional accounts for an integral cost on the curvature, an non-interpenetration (penalized) constraint, and the grasping task. The minimization is performed subject to an equilibrium condition for the manipulator, and to forceclosure conditions for the target contact points.
In [1], we considered prescribed contact subregions on general objects. Here, we consider planar, stationary, frictionless grasps of elliptic targets-with positive eccentricity. This choice is motivated by the fact that we see the case of an ellipse as a projection of the three-dimensional problem of grasping cylindrical and ellipsoidal objects.
We borrow from [2] the study of a multi-target optimal control problem: the main difference is that in [2], the target points were fixed a priori, whereas in the present work, the target points are provided as part of the optimization problem.
The control model underlying our study was introduced in [3]. It is a control model for a planar string, modeling the symmetry axis of an octopus arm. Its dynamics encompasses an exact inextensibility constraint, bending moment, curvature constraints and distributed curvature controls. In this framework, several optimization problems were addressed. They include optimal reachability [3,4], obstacle avoidance [1,5], and grasping problems [2,6]. In particular, [1] addresses the problem of touching a prescribed portion of the boundary of a target object while avoiding interpenetration and minimizing a quadratic cost on the controls. In [2], the contact sub-region of the manipulator is treated as an unknown of the problem and, at the same time, the target is allowed to be disconnected.
Here, we look for optimal configurations ensuring forceclosure grasps. The force-closure property is a classical geometric condition on the contact points ensuring the grasp of an object to be stable with respect external disturbances: in particular, a grasp achieves force-closure if any external wrench can be balanced by wrenches at the contact points [7][8][9][10]. For planar objects, four contact points are necessary to guarantee a first-order force-closure grasp. Of course, the contact points ensuring a force-closure grasp are in general non-unique. Then, one may wonder what are the best contact points to target with the soft-manipulator, to optimize some cost associated to the resulting grasping configuration. Based on this observation, we aim to select the contact points, the related force-closure configurations, and, ultimately, the optimal controls, minimizing a given integral cost.
We proceed as follows. In the next section, we recall our model for a tentacle-like soft manipulator, the associated equilibria and a class of optimal stationary grasping problems. Following section is devoted to multi-target reachability problems. In the next section, we address the geometry of the problem. We provide some explicit forceclosure conditions for elliptic targets and we present a class of ellipses as cross-sections of three-dimensional objects. In the next section, we present our optimization problem for the force-closure of an ellipse, we discuss the related optimality system, and we provide a projected gradient method for its numerical solution. Finally in the following section, we report the results of some experiments, confirming the effectiveness of the proposed method. In the last section, we draw our conclusions.
We conclude this introduction with the literature that mostly inspired our work. The papers [11][12][13][14] provide a general introduction on soft robotics and related motion planning problems. From a modeling point of view, we refer to [15][16][17][18][19]. A survey on grasping problems for soft manipulators can be found in [20]. Our work is based on an optimal control theoretic approach, constrained reachability problems in a similar fashion are addressed in [21,22], where a finite number of degrees of freedom is taken into account. Here, we carry on a formal analysis in an infinite-dimensional setting, encompassing at once continuous manipulators as well as hyper-redundant, discrete manipulators [1]. The power of a rigorous derivation of the optimality system consists in its suitability for extensions to a purely dynamic setting, from which a time-varying, optimal control can be synthetized as in [5], where an optimal dynamic reachability problem is addressed. To the best of our knowledge, the present variational approach to optimal grasping problems for soft manipulators with non-uniform curvature constraints is new. We point out that the optimality system is then numerically solved via a descent gradient method. Some information useful for the parameter tuning can be recovered by the numerical analysis of the optimization process. The drawback of this first-order method consists in a possibly slow convergence to the stationary points that, in case of lack of convexity of the Lagrangian, can result in local minima. In this regard, also in view of the smoothness of the constraints, the search of optimal grasping controls could benefit from metaheuristic methods [23][24][25]. In particular, the application of a method like the particle swarm optimization (PSO) to the residual of the optimality system (rather than to the Lagrangian itself) could produce a speedup in the computation. We are not aware of data available in the literature for the specific problem under exam, and we postpone this investigation in a future work.

An Optimal Control Problem for Multi-touch Configurations
We introduce our model and we set the problem of optimizing the contact of the arm with a general, possibly disconnected target set, while avoiding an obstacle. The obstacle can represent either an external element in the workspace or an object to be grasped without interpenetration, in the latter case, it suffices to assume the target point set to belong to the boundary of the obstacle.

A Control Model for an Octopus Arm
Our model was introduced in [3]. It consists in a control model for an octopus arm, characterized by an axial symmetry, a non-uniform thickness and a fixed endpoint. We assumed an exact inextensibility constraint and a bending moment, representing the natural resistance of the body to deformations. Also, a constraint prevents the body to bend above a fixed threshold. Finally, the bending can be pointwise forced by the controller. By virtue of the axial symmetry, we specialized the problem to the evolution of the symmetry axis on the plane. In particular, the axis is modelled as an inextensible string. The mass and the bending constraints/ controls of the whole manipulator are projected on the symmetry axis. They, respectively, result in a non-uniform mass and suitably weighted curvature constraints and controls, see [4] for details on this projection.
More precisely, the model includes: (i) a curvature constraint, forcing the curvature of the axis under a fixed (non-uniform) threshold ; (ii) a curvature control, forcing the signed curvature to the quantity u , where u ∈ [−1, 1] is the control map; (iii) a bending moment, forcing the uncontrolled manipulator to arrange on a straight line. On the other hand, the inextensibility constraint is exact.
We consider the curve q(s, t) ∶ [0, 1] × ℝ + → ℝ 2 parametrizing the symmetry axis of the manipulator in arclength coordinates, and the associated inextensibility multiplier (s, t) ∈ ℝ , playing the role of the tension of the string. We denote by q s , q ss , q tt partial derivatives in space and time, respectively. The scalar quantity ‖q ss ‖ is the curvature of q. The product q s × q ss ∶= q s ⋅ q ⊥ ss represents the signed curvature, where the symbol q ⊥ ss denotes the counter-clockwise orthogonal vector to q ss . We describe in detail the constraints and the control.
Then, we consider the following Lagrangian: We refer to [3] for a rigorous justification of L and for the complete derivation, via the least action principle, of the equations of motion of q (and ) from L.
In this paper, we are interested in the optimization, with respect to the control u, of the equilibrium configuration of L , namely the shape of the manipulator provided by the solution q of the stationary control system (refer to [3] for the proof) where ̄∶= ∕( + ) ≤ represents the effective curvature threshold resulting from the balancing between the (1) bending moment and the curvature control in L . Note that the curvature constraint is embedded in the first equation of (1), since | u |≤ 1 and the inextensibility constraint ‖q s ‖ = 1 imply ‖q ss ‖ =̄| u |≤ .

Optimality Conditions for a Multi-target, Obstacle Avoidance Reachability Problem
We recall from [2], an optimal control problem involving the simultaneous contact with a point set target, an obstacle avoidance task and the minimization of a quadratic cost in the control. Let Ω 0 be an open subset of ℝ 2 representing the obstacle, and let Ω 1 ∶= {p 1 , … , p N } , be a set of N fixed points, possibly located on Ω 0 . Note that the condition Ω 1 ⊂ Ω 0 is assumed when Ω 0 is a target object that needs to be grasped without interpenetration.
We also consider N unknowns The set S belongs to the interior of the parametrization interval of the manipulator: in other words, q(s i ) is a point of the manipulator, for all i = 1, … , N . Since > 0 , then q(s k ) is not any of the two endpoints of the manipulator. The set q(S) ⊂ ℝ 2 represents the set of points of the manipulator touching the N target points. Then S, and consequently q(S), is an unknown, since the contact subregion of the manipulator with the target is not prescribed a priori (as, instead, for [1,6]). We let the manipulator adapt to choose the best contact points as a result of the following optimization process: The first integral term represents a quadratic cost on the controls. The second integral term encompasses the obstacle avoidance task: the function O ∶ ℝ 2 → ℝ is a non-negative function with support Ω 0 , acting as repulsive potential. The effect of this integral term is then precisely to push the points of the manipulator outside Ω 0 , according to a penalization parameter 0 > 0 . Finally, the third term penalizes, according to 1 > 0 , the distance of the (unknown) point of the manipulator q(s i ) from the target point p i , for all i = 1, … , N.

SN Computer Science
in which the explicit dependence on the controls is dropped by virtue of the constraint (1).

Force-Closure Conditions for an Ellipse
We consider first-order force-closure conditions for frictionless contact points, in the case of elliptic boundary of the target object-see the end of the section for some motivating examples. Force-closure conditions are geometric conditions on the disposition of contact points on the boundary of the object, to ensure the immobility of the object despite external disturbances. In other words, the contact points are placed so that the associated (normal) contact forces are able generate an arbitrary wrench to counteract a disturbance wrench. We consider frictionless contact forces. More precisely, we denote by p = (p 1 , p 2 ) ∈ Ω 0 a generic contact point. We set the reference frame as the center of Ω 0 , which is assumed to be an ellipse with semia xe s 0 < b ≤ a , d e s c r i b e d by t h e e qu a t i o n in polar coordinates, so that for some ∈ [0, 2 ): Denoting by (p) ∈ ℝ 2 the inward normal vector to the ellipse at p, (T denotes the transpose) we consider frictionless contact forces of the form (p) = f (p) with f ≥ 0 . Then, the wrench associated to p is the vector (p) ∈ ℝ 3 defined by Following [10], given N contact points {p 1 , … , p N } ∈ Ω 0 , we say that Ω 0 is in (first-order) force-closure if the set of wrenches { (p 1 ), … , (p N )} positively spans ℝ 3 , i.e., for all ∈ ℝ 3 , there exist 1 , … , N ≥ 0 such that Denoting by W FC the 3 × N matrix whose columns are the wrenches, the force-closure condition can be equivalently stated as follows: Note that the full-rank condition (4) cannot be satisfied if a = b , namely when Ω 0 is a circle. Moreover, the number N of contact points must be equal to or greater than 4, which is the minimal number of generators of a three dimensional conic hull.

Ellipses as Cross-sections of Three-Dimensional Objects
In this section, we embed the reference system of the manipulator in ℝ 3 , so that the workspace of the manipulator belongs the plane z = 0 and the x and y axis are oriented according to (1). We consider two classes of three-dimensional objects: a family of cylinders and a family of ellipsoids. For each member of each class, we derive an elliptic target, as the intersection between the three-dimensional object and the workspace of the manipulator. Such elliptic intersection is the region of the object that can be actually reached by the manipulator.
We begin by modelling a collection of cylindrical objects. When a cylinder is intersected with the workspace, we obtain an elliptic target object. More precisely, we parametrize a collection of cylinders of radius r > 0 whose symmetry axes have ( , 0) = (c 1 , c 2 , 0) , as common point. We assume the symmetry axis to be parallel to the yz-plane and we describe its orientation via the parameter ∈ (− ∕2, ∕2)-the case = 0 corresponds to a vertical cylinder, see Fig. 1. More precisely, let where R x ( ) is the rotation matrix about the x-axis with angle of rotation .
The associated target ellipse is hence given by the intersection Ω r, ∶= r, ∩ {(x 1 , x 2 , 0), x 1 , x 2 ∈ ℝ} . By a direct computation, that is, Ω r, is the ellipse centered in with semiaxes a = a r ∶= r and b = b r, ∶= r(cos + tan ) . Note that if = 0 , then Ω r, is a circle.
Consider now a family of ellipsoids, with center ( , 0) and with semiaxes a 1 , a 2 , a 3 > 0 . For brevity, let us collect a 1 , a 2 and a 3 in the three-dimensional vector ∶= (a 1 , a 2 , a 3 ) . Given the ellipsoid ,0 implicitly defined by Fig. 1 The workspace plane, the cylinders 1, , and, in light blue, the ellipses Ω 1, with varying between 0 and ∕4 with step ∕16 Fig. 2 The workspace plane, the ellipsoids , with = (1, 2, 3) , and, in light blue, the ellipses Ω , with varying between 0 and ∕2 with step ∕8 we consider the family of rotations of a,0 about the symmetry axes that is parallel to the x-axis, see Fig. 2

. We have
We recall that we defined R x ( ) as the rotation matrix about the x-axis. More precisely, for ∈ [− , ] , we have the parametrization in polar coordinates The intersection with the z = 0 plane yields the ellipse that is, Ω , is the ellipse centered in with semiaxes a = a 1 and b = b a 2 ,a 3 , ∶= a 2 a 3 1 √ a 2 2 sin 2 +a 2 3 cos 2 .

Optimal Grasping Strategies
In this section, we show how to suitably embed the forceclosure condition (4)-(5) in the multi-target optimization problem with obstacle avoidance (3) presented in "Optimality conditions for a multi-target, obstacle avoidance reachability problem". Moreover, we discuss the related optimality system and we provide a projected gradient method for its numerical solution.
We consider again the case of an elliptic obstacle Ω 0 with semi-axes 0 < b < a , but possibly rotated by a given angle 0 ∈ [0, 2 ) and translated to the point c 0 ∈ ℝ 2 . Then, we settle on the minimal requirement of N = 4 target points, looking for a point set , satisfying the force-closure condition.
To this end, we consider the wrenches of Ω 1 , expressed in local coordinates as in "Force-closure conditions for an ellipse" and scaled by the constant factor 2f ab , i.e., , ∶= {(c 1 + a 1 sin cos , c 2 + a 2 sin sin cos + a 3 cos sin , − a 2 sin sin sin + a 3 cos cos ) and we denote by W the 3 × 3 matrix whose columns are the components of the first three wrenches 1 , 2 , 3 . Moreover, we consider its formal inverse W −1 , obtaining, by direct computation whose rows are given by the components of the vectors where the indices are meant to cycle when out of bounds (e.g., for i = 3 we set i + 1 = 1 and i + 2 = 2 ). Note that, for i = 1, 2, 3 , the wrench i depends on i only, whereas ̄ i depends on the whole triplet ( 1 , 2 , 3 ). Then, it is easy to see that the force-closure condition (4)-(5) is equivalent to the following: We now collect the unknown angles of the target points in the set Θ = { 1 , 2 , 3 , 4 } ⊂ [0, 2 ) , and we define the function where and is a fixed parameter, for some ∈ (0, 1).
We remark that F is a non-negative function and, by construction, it follows that Θ is an absolute minimizer (achieving F(Θ) = 0 ) if and only if the corresponding target points satisfy the force-closure condition (6) with | det W |≥ 0 .
We also remark that 0 only depends on (a, b), and it is well defined by virtue of compactness arguments, in i ∶= (p i ) = −(b cos( i ), a sin( i ), (a 2 − b 2 ) cos( i ) sin( i )), i =1, … , 4, particular it is strictly positive if and only if a ≠ b , i.e., if Ω 0 is not a circle. In Fig. 3, we report the level sets of 0 as a function of (a, b), computed numerically for (a, b) ∈ (0, 2) 2 and = 1.

Recalling (3), we then define the functional
where the potential for the elliptic obstacle takes the special form and 2 > 0 is an additional parameter penalizing the violation of the force-closure condition. Finally, we consider the following optimization problem for the grasping with optimal contact: O(q(s))ds We observe that the third term in the functional (8) provides a quite involved cross coupling of the unknowns (q, S, Θ) , in particular its minimization forces the tentacle q to grasp the obstacle, and also the simultaneous attraction between the contact set S and the target set Θ. The next step is to obtain necessary optimality conditions for problem (9) in a form suitable for numerical computations, i.e. avoiding for simplicity the KKT conditions associated to the inequality constraint ‖q ss ‖ ≤̄ . This is done via relaxation, by introducing an auxiliary variable z satisfying the equivalent equality constraint and by defining the following augmented Lagrangian where ∶ [0, 1] → ℝ is the Lagrange multiplier for the exact inextensibility constraint ‖q s ‖ = 1 . The function ∶ [0, 1] → ℝ and the constant > 0 are respectively the multiplier and penalty parameter related to the relaxed constraint on the curvature (10). Then, the optimization problem (9) is equivalent to the minimization of L , subject to S ⊂ I and z ≥ 0 (note that, due to the 2 -periodicity of { i } i=1,…,4 , ̄ i _i = 1, … , 3 and det W in the definition of F(Θ) , no constraint is actually required on Θ ). Such optimization process can be performed employing the method of multipliers ( [26,27], see also [28] and the references therein for the infinitedimensional case), starting from (0) ≡ 0 and iterating on k ≥ 0 up to convergence The optimization in (12) with respect to z ≥ 0 yields the following variational inequality whose solution is given almost everywhere by (10) ‖q ss ‖ 2 −̄2 + z = 0 withz ≥ 0, . Plugging the above expression in (12), we get On the other hand, the solution (q (k+1) ,̃( k+1) ,S (k+1) ,Θ (k+1) ) of the optimization sub-problem for the reduced Lagrangian satisfies the following optimality system with As remarked in [2] (see also [3]), the first equation and the boundary conditions in (15) emerge from the optimization of L (k) with respect to q. Similarly, optimizing L (k) in , S and Θ , respectively, we recover (in order) the inextensibility constraint, four variational inequalities for the contact set (due to the constraint S ⊂ I ) and four equations for the target set. The solution of (15) is approximated as in [2], using a projected gradient descent method. More precisely, we first compute the partial Fréchet derivatives of L (k) : Then, given an initial guess (q (0) , (0) , S (0) , Θ (0) ) satisfying the boundary conditions and the constraints, we iterate on n ≥ 0 up to convergence where > 0 is the step size and (17) is the component-wise projection on I ensuring a feasible contact set at each iteration. We refer to [2] for further details on the discretization of the optimality system (15), and on the actual implementation of the full algorithm, including both (17) and the method of multipliers (13).

Numerical Experiments
In this section, we present several numerical experiments, showing the ability of the proposed method to obtain optimal grasping configurations for the manipulator, satisfying the force-closure condition. Let us first define the setting for the tests. We also assume that the manipulator has unit length and it is discretized with 201 nodes. Then, we set = 1 200 , namely equal to the mesh size, so that the interval I for the contact set S contains all the grid nodes except the end points. The elliptic obstacle Ω 0 is centered at the point c 0 = (0.1, −0.3) , while its semi-axes and rotation are chosen as summarized in Table 1. Moreover, for each pair (a, b), we numerically compute 0 (a, b) in (7) choosing = 1 2 . As initial guess for (17), we always choose a profile q (0) surrounding the obstacle, whereas (0) ≡ 0 and S (0) corresponds to a small random perturbation of equally spaced points along the manipulator. Accordingly, the target set Θ (0) is obtained by a small random perturbation of the projection of q (0) (S (0) ) on the ellipse, with the exception of Test 1 where Θ (0) is chosen randomly.
Finally, the step size for the gradient descent method is set to = 5 ⋅ 10 −3 , while the penalty parameters 0 , 1 , 2 and are slowly decreased using the continuation method discussed in [2]. In particular, at each iteration of the optimization process, we keep the relationship 0 < 1 < 2 to prioritize, in order, the obstacle avoidance, the contact, the force-closure, and finally the curvature minimization. This results in a greater mobility of S and Θ in the grasping task.
In Test 1, we consider, for comparison purposes, the case of frozen target points as in [2], removing from (9) the optimization with respect to Θ . In particular, the chosen target set does not satisfy the force-closure condition.
In Fig. 4, we report the results of the optimization. More precisely, in Fig. 4a, we show the obstacle (grey), the target points (black circles), the optimal contact points (yellow circles) and the optimal configuration q of the manipulator, while Fig. 4b represents the corresponding signed curvature (thicker line) as a function of s ∈ [0, 1] , and the thresholds ±̄(s) (thin lines).
Moreover, in Fig. 4c, we show the evolution of the contact set S versus the total number of iterations to reach convergence.
We clearly observe a temporary saturation of S, which corresponds to the higher priority given to the minimization of the distance between the contact set and the target set. In the remaining part of the evolution, once the manipulator has grasped the obstacle, the optimization proceeds with a sliding of s 2 , s 3 , s 4 toward the free end. This reflects an attempt of the manipulator to unroll itself to reduce also the curvature contribution in (8), which has already reached the threshold ̄ is some regions (see again Fig. 4b), due to the large eccentricity of the obstacle. Nevertheless, the resulting configuration of the manipulator looks quite "unnatural" (see again Fig. 4a), we can somehow perceive a great effort of the controls in the grasping task, and this is ultimately related to the lack of mobility of the target set.
In Test 2, we consider the case of an obstacle with a lower eccentricity, and we perform the optimization of the complete functional (8) with respect to (q, S, Θ) . The results are reported in Fig. 5, where we also show the convergence history of the target set (Fig. 5d) and of the four terms related to the force-closure condition (6) (Fig. 5e).
Here, it is interesting to observe that the force-closure condition is satisfied and preserved during the first part of the optimization, which is mostly devoted to the adjustment of Θ (note indeed in Fig. 5c that the contact set S remains almost unchanged).
From now on, the optimization proceeds focusing on the contact and curvature terms in (8), as confirmed by the sliding of S in Fig. 5c. This slightly violates the condition sign (det W)̄ 3 ⋅ 4 ≤ 0 and also produces a decrease in the term | det W | . In the remaining iterations, the missing condition is recovered, while the determinant of W is locked above the bound 0 , both with small adjustments of Θ.
Finally, comparing Fig. 5a, b, we readily observe the correspondence between the contact points and the faster transitions in the curvature of the manipulator. Since the grasping is imposed on q(S) only, the manipulator need not to retrace the profile (hence the curvature) of the obstacle. This is more apparent in the part of q between the last two contact points. Test 3 and Test 4 are more challenging than the previous one. The obstacle has now a larger eccentricity and it is differently rotated, which forces higher values in the curvature of the manipulator, as observed in Test 1. Moreover, in these two tests, the initial guess for the target set is such that the force-closure condition is more and more violated at the beginning of the optimization. The results are similar, as reported in Figs. 6 and 7 respectively.
In both cases, we observe that one contact occurs at the point of the obstacle furthest from the anchor point of the manipulator, precisely on the major axis of the ellipse, where the curvature achieves its largest value.
Moreover, in both tests, we recognize a relevant sliding of the contact set, especially for the contact point near the free end of the manipulator, aiming at avoiding adherence to the obstacle, so to reduce the total curvature as much as possible. This behavior is more apparent in Test 4, due to the different orientation of the obstacle. In particular, we also observe some adjustment in the first contact point, which  (e) Fig. 7 Test 4, optimal grasping configuration (a), optimal curvature (b) and convergence history of c the optimal contact set, d optimal target set, e force-closure condition prevents the curvature from changing sign in the first part of the manipulator, as in Test 3.

Conclusions
In this paper, we addressed optimal force-closure configurations for a soft manipulator. The underlying model corresponds to the equilibria of a dynamical system, which in turn models the evolution of a tentacle-like manipulator subject to inextensibility and curvature constraint, a bending moment and a distributed curvature control, introduced in [5]. The stationary setting taken into exam here constraints the configurations of the manipulator to a system of controlled ordinary differential equations (1). The goal is to select an admissible force-closure configuration (namely a solution of (1)) which avoids interpenetration with an elliptic target while minimizing a quadratic cost on the controls. Our approach is based on optimal control theory and it consists in the constrained minimization of an appropriate cost functional, see the problem (9). Then, a discretization algorithm is proposed for the numerical solution. Finally, some test cases are taken into exam. The observation of the resulting optimal solutions and the analysis of the optimization process confirmed the consistency of the proposed approach. Also they shed some light on how the parameters impact the selection of the optimal configuration. The present paper is part of an ongoing investigation on optimal control strategies for soft-manipulators. This is a relatively new line of research, exploiting a variational approach to embed (internal and external) reaction forces in the system and, at the same time, to minimize of the costs associated to the execution of some reachability and grasping tasks by a tentacle-like soft manipulator. The main novelty, compared with previous works by the authors, is the optimization of configurations that not only optimally wrap the target while avoiding interpenetration, but also satisfy a force-closure condition. A far from trivial aspect of the problem is the definition an appropriate cost functional, the functional G introduced in (8), which also required a geometrical analysis of the force-closure condition. Further directions of research include: the study of more general shapes of the target, higher order force-closure conditions, the introduction of friction in the contact forces, and an extension of the above techniques to a fully dynamical setting.
Funding Open access funding provided by Università degli Studi di Roma La Sapienza within the CRUI-CARE Agreement.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creat iveco mmons. org/ licen ses/ by/4. 0/.