# A Comparison between Position-Based and Image-Based Dynamic Visual Servoings in the Control of a Translating Parallel Manipulator

Authors: G. Palmieri; M. Palpacelli; M. Battistelli; M. Callegari
Journal: Journal of Robotics
 (2012)

---

## Abstract

Two different visual servoing controls have been developed to govern a translating parallel manipulator with an eye-in-hand configuration, That is, a position-based and an image-based controller. The robot must be able to reach and grasp a target randomly positioned in the workspace; the control must be adaptive to compensate motions of the target in the 3D space. The trajectory planning strategy ensures the continuity of the velocity vector for both PBVS and IBVS controls, whereas a replanning event is needed. A comparison between the two approaches is given in terms of accuracy, fastness, and stability in relation to the robot peculiar characteristics.


---

## Body

## 1. Introduction

Visual servoing is the use of computer vision to control the motion of a robot; two basic approaches can be identified [1–4]: position-based visual servo (PBVS), in which vision data are used to reconstruct the 3D pose of the robot and a kinematic error is generated in the Cartesian space and mapped to actuators commands [5–7]; image-based visual servo (IBVS), in which the error is generated directly from image plane features [8–15]. Recently, a new family of hybrid or partitioned methods is growing, with the aim of combining advantages of PBVS and IBVS while trying to avoid their shortcomings [16, 17].The principal advantage of using position-based control is the chance of defining tasks in a standard Cartesian frame. On the other hand, the control law strongly depends on the optical parameters of the vision system and can become widely sensitive to calibration errors. On the contrary, the image-based control is less sensitive to calibration errors; however, it is required the online calculation of the image Jacobian, that is, a quantity depending on the distance between the target and the camera which is difficult to evaluate. A control in the image plane results also to be strongly nonlinear and coupled when mapped on the joint space of the robot and may cause problems when crossing points which are singular for the kinematics of the manipulator [1].Visual servo systems can also be classified on the basis of their architecture in the following two categories [1]: the vision system provides an external input to the joint closed-loop control of the robot that stabilizes the mechanism (dynamic look and move); the vision system is directly used in the control loop to compute joints inputs, thus stabilizing autonomously the robot (direct visual servo). In general, most applications are of the dynamic look and move type; one of the reasons is the difference between vision systems and servo loops rates. The low frequency imposed by vision might cause problems on controller’s stability, especially in cases where several DOFs are involved.The aim of this work is to compare two different visual servoing controls, respectively, of the position-based and image-based type, implemented to govern a translating parallel manipulator with an eye-in-hand configuration. The robot must be able to reach and grasp a special target randomly positioned in the workspace; the control must be adaptive to compensate motions of the target in the 3D space. The use of Bézier curves [18, 19] in the trajectory planning algorithms ensures the continuity of the velocity vector, whereas a replanning event is needed. A dynamic look and move philosophy has been adopted to conjugate the low frame rate of the vision system (lower than 30 Hz) with the high control rate of the joint servo (about 1000 Hz).


## 2. Hardware Setup

The robot, which is called ICaRo, is a research prototype designed and realized at the Machine Mechanics Lab of Università Politecnica delle Marche [20]; the end-effector is in parallel actuated by 3 limbs whose kinematic structure only allows pure translations in the 3D space. The workspace is a cube of 0.6 m edge free of singular points (Figure 1(a)).(a) ICaRo robot and workspace; (b) system architecture and connection diagram.
(a)(b)The eye-in-hand configuration has been chosen for the installation of the vision system. The optical axis of the camera is aligned with the end-effector vertical axis. The end-effector is also provided with a pneumatic gripper in order to grasp the target when the desired relative pose is reached (Figure1(b)). The robot is managed by a central control unit, a DS1103 real-time board by dSPACE. The vision data, after image acquisition and preliminary processing made by the CVS real-time hardware of National Instruments, are sent via a serial interface to the central unit that runs the control algorithms.


## 3. PBVS Control

Using a position-based method, a 3D camera calibration is required in order to map the 2D data of the image features to the Cartesian space data. This is to say that intrinsic and extrinsic parameters of the camera must be evaluated.Intrinsic parameters depend exclusively on the optical characteristics, namely, lens and CCD sensor properties. The calibration of intrinsic parameters can be operated offline in the case that optical setup is fixed during the operative tasks of the robot. Extrinsic parameters indicate the relative pose of the camera reference system with respect to a generic world reference system. It is assumed that the world reference system is exactly the object frame, so that the extrinsic parameters give directly the pose of the camera with respect to the target. Obviously the extrinsic parameters are variable with robot or target motion, and an online estimation is needed in order to perform a dynamic look-and-move tracking task.


### 3.1. Estimation of Intrinsic Parameters

A standard pinhole camera model is here briefly described to introduce the notation used in this paper. A point in the 2D image space is denoted bym=[uv]T, while a point in the 3D Cartesian space is denoted by p=[xyz]T. Introducing the homogeneous coordinates, it is m̃=[uv1]T and p̃=[xyz1]T. The image projection that relates a 3D point p to its corresponding point m in the image plane can be expressed as(1)sm̃=AΠBp̃Π=[100001000010],
where s is an arbitrary scale factor and B is the 4×4 matrix of the extrinsic parameters that combines a rotation and a translation relating the world coordinate system to the camera coordinate system. A is the matrix of intrinsic parameters, defined as(2)A=[αγu00βv0001],
where(i)
(u0,v0) are the coordinates of the principal point, that is, the projection of the optical axis on the CCD sensor;(ii)
α and β are the focal scale factors in the image u and v axes;(iii)
γ is the parameter describing the skewness of the two images axes, usually set to 0.The pinhole model needs to be refined in order to correct image distortions introduced by the lens [21–25]. To this aim, normalized coordinates are conveniently introduced: given a point p=[xcyczc]T in the camera reference system, the corresponding normalized pinhole projection is defined as mn=[unvn]T=[xc/zcyc/zc]T. It can be demonstrated that, in the ideal case free of lens distortions, the intrinsic camera matrix A relates a point in the image plane with its normalized projection: m̃n=A-1m̃. Actually, normalized coordinates obtained from previous equation are affected by image distortions, and the real case is distinguished from the ideal case by using the notation m̃d=A-1m̃. Two components of distortion can be recognized: the radial lens distortion causes the actual image point to be displaced radially in the image plane; if centres of curvature of lens surfaces are not collinear, also a tangential distortion is introduced. The following expression is generally used to model both components of distortion:(3)md=mn+δm(r)+δm(t),
where δm(r) and δm(t) are defined as high-order polynomial functions of the undistorted coordinates un,vn [21]. Because of the high degree of the distortion model, there exists no general algebraic expression for the inverse problem of computing the normalized image projection vector mn from the distorted coordinates of vector md. If low-distortion lenses are used, a direct solution can be found making the approximation of computing δm(r) and δm(t) as functions of distorted coordinates. Inspiring to well-known distortion models [21–25], a rough correction of the image distortion can be quickly obtained by using the equation(4)mn=1a(md-[bc]T),
where(5)a=1+k1rd2+k2rd4+k3rd6,b=2p1udvd+p2(rd2+2ud2),c=p1(rd2+2vd2)+2p2udvd,rd2=ud2+vd2,
and k1,k2,k3,p1,p2 are additional intrinsic parameters to be defined by calibration.Several algorithms for the estimation of intrinsic parameters are available in literature [22–25]. A technique inspired to the Heikkilä algorithm has been adopted: after the settings of the optical system have been tuned for an optimal result of the vision, a number n>4 of frames (15 in our application) of a grid of known dimensions are acquired; through an automatic extraction of the corners of the grids, the algorithm is able to estimate with an iterative procedure the intrinsic parameters of the camera including distortion parameters, according to (4) and (5).


### 3.2. Estimation of Extrinsic Parameters

The reconstruction of the relative pose between camera and object is possible through the estimation of extrinsic parameters of the camera with respect to a reference system that is coincident with the object frameOo-xoyozo. Figure 2 shows the optical pattern realized on the top surface of the target object; it consists of four coplanar circles positioned at the corners of a square of known edge d. The object frame is attached to the pattern in the way shown in the figure.Figure 2
Object frame attached to the visual pattern and camera reference system.The position of the originOowith respect to the camera frame is the vector tc=(Oo-Oc)c, while the relative orientation between the two reference systems is the rotation Roc. The homogeneous transformation Toc coincides with the extrinsic parameters matrix(6)B=Toc=[Roctc0T1].
The aim is to determine the extrinsic parameters, once the geometry of the optical pattern and the pixel coordinates of the centroids of the circles projected onto the image plane are known.The problem of determining the pose, knowing the correspondence ofn points in the world and camera frame reference systems, is typical in photogrammetry (PnP problem), and it is proved that for 4 coplanar points the solution is unique [26, 27]. While the calibration of intrinsic parameters is quite laborious, but does not need to be performed online, the solution of the PnP algorithm for 4 coplanar points is fast enough to be implemented online during the motion of the robot.An experimental test is here presented in order to evaluate the accuracy of the implemented pose estimation method: while keeping fixed the camera, the optical target of Figure2 is moved 7 mm along each axis using a precision micrometric stage. An image of the pattern is grabbed before the motion, and a series of 100 images are stored after the motion.The relative displacements can be estimated by making the difference between the pose obtained from the first image and the pose obtained from each one of the further 100 images. The test has been repeated in two configurations, setting the initialz-distance between the camera and the object, respectively, at 500 mm and 150 mm.Experimental data of the tests are plotted in Figure3. It is clear that there is a larger dispersion of measurements at a bigger distance from the target; moreover, it can be noticed a larger sensitivity to noise along the z axis, parallel to the optical axis. It results also evident how the accuracy of the pose estimation increases approaching the target. The same conclusions can be drawn from Table 1, where experimental data are summarized in terms of mean values and standard deviations: passing from a distance of 500 mm to 150 mm, the standard deviation lowers nearly one order of magnitude in x and y and two orders in z.Table 1
Summary of displacement experimental data: mean values and standard deviations of measured data.
Depth = 500 mmxyzMean value [mm]7.0217.0816.710Standard deviation [mm]0.0070.0090.134Depth = 150 mmxyzMean value [mm]6.9677.1086.810Standard deviation [mm]0.0010.0010.007Distribution of displacement experimental data; (a) distance camera-target≃500 mm; (b) distance camera-target ≃150 mm.
(a)(b)


### 3.3. Control Algorithm

A dynamic look and move control has been implemented following the position-based approach above described. The global architecture is shown in Figure4, where s represents the vector of image features, q is the vector of joint angles, and xm,xd, and xplan are, respectively, the measured, desired, and planned Cartesian coordinates vectors. Looking at the scheme of the control, two separate loops can be identified: the inner loop realizes a standard PD control in the operative space with gravity compensation (g term) by exploiting the information from encoders; the camera, working as an exteroceptive sensor, closes an outer loop where visual information is processed in order to plan and replan in real time the desired trajectory of the robot. It is important to remark that image features extraction is performed externally from the control loop by the real-time image processing hardware (CVS); only the pose estimation, that includes the solution of the PnP algorithm, is involved in the loop.Figure 4
Dynamic look and move PBVS control.A control in the Cartesian space is realized imposing the following requirements to the planned motions:(a)
starting from an arbitrary status of the end-effector (position and velocity), the continuity of position and velocity must be ensured;(b)
the final point must be reached with a vertical tangent in order to facilitate the grasping of the target object.To this purpose, a third-order Bézier curve has been adopted [18, 19]. This curve is defined by 4 points in the 3D space and has the fundamental property of being tangent to the extremities of the polyline defined by the four points (Figure 5(a)).(a) Plot of a cubic 3D Beziér curve; (b) influence of the parametern on the planned trajectory.
(a)(b)The parametric formulation of a cubic Bézier curve is(7)B(s)=P0(1-s3)+3P1s(1-s)2+3P2s2(1-s)+P3s3s∈[0,1].In the trajectory planner algorithm,P0 is the current position of the end-effector, while P3 is the target point obtained from the vision system. Knowing the current velocity direction v̂0 and the desired final velocity direction v̂f, P1 and P2 are defined as(8)P1=P0+‖P3-P0‖nv̂0,P2=P3-‖P3-P0‖nv̂f,
where n is a tunable parameter that influences the curvature of the trajectory (Figure 5(b)); all experimental data reported in the paper are obtained by setting n=3.Since the targetP3 is continuously estimated during the motion of the robot, variations of its position due to motions of the object or to the reduction of the measurement errors (as shown in Figure 3) are compensated by a continuous replanning of the trajectory. A trapezoidal velocity profile is used with a temporal planning algorithm that is able to modify the shape of the profile, while the length of the planned trajectory changes during the motion.


## 3.1. Estimation of Intrinsic Parameters

A standard pinhole camera model is here briefly described to introduce the notation used in this paper. A point in the 2D image space is denoted bym=[uv]T, while a point in the 3D Cartesian space is denoted by p=[xyz]T. Introducing the homogeneous coordinates, it is m̃=[uv1]T and p̃=[xyz1]T. The image projection that relates a 3D point p to its corresponding point m in the image plane can be expressed as(1)sm̃=AΠBp̃Π=[100001000010],
where s is an arbitrary scale factor and B is the 4×4 matrix of the extrinsic parameters that combines a rotation and a translation relating the world coordinate system to the camera coordinate system. A is the matrix of intrinsic parameters, defined as(2)A=[αγu00βv0001],
where(i)
(u0,v0) are the coordinates of the principal point, that is, the projection of the optical axis on the CCD sensor;(ii)
α and β are the focal scale factors in the image u and v axes;(iii)
γ is the parameter describing the skewness of the two images axes, usually set to 0.The pinhole model needs to be refined in order to correct image distortions introduced by the lens [21–25]. To this aim, normalized coordinates are conveniently introduced: given a point p=[xcyczc]T in the camera reference system, the corresponding normalized pinhole projection is defined as mn=[unvn]T=[xc/zcyc/zc]T. It can be demonstrated that, in the ideal case free of lens distortions, the intrinsic camera matrix A relates a point in the image plane with its normalized projection: m̃n=A-1m̃. Actually, normalized coordinates obtained from previous equation are affected by image distortions, and the real case is distinguished from the ideal case by using the notation m̃d=A-1m̃. Two components of distortion can be recognized: the radial lens distortion causes the actual image point to be displaced radially in the image plane; if centres of curvature of lens surfaces are not collinear, also a tangential distortion is introduced. The following expression is generally used to model both components of distortion:(3)md=mn+δm(r)+δm(t),
where δm(r) and δm(t) are defined as high-order polynomial functions of the undistorted coordinates un,vn [21]. Because of the high degree of the distortion model, there exists no general algebraic expression for the inverse problem of computing the normalized image projection vector mn from the distorted coordinates of vector md. If low-distortion lenses are used, a direct solution can be found making the approximation of computing δm(r) and δm(t) as functions of distorted coordinates. Inspiring to well-known distortion models [21–25], a rough correction of the image distortion can be quickly obtained by using the equation(4)mn=1a(md-[bc]T),
where(5)a=1+k1rd2+k2rd4+k3rd6,b=2p1udvd+p2(rd2+2ud2),c=p1(rd2+2vd2)+2p2udvd,rd2=ud2+vd2,
and k1,k2,k3,p1,p2 are additional intrinsic parameters to be defined by calibration.Several algorithms for the estimation of intrinsic parameters are available in literature [22–25]. A technique inspired to the Heikkilä algorithm has been adopted: after the settings of the optical system have been tuned for an optimal result of the vision, a number n>4 of frames (15 in our application) of a grid of known dimensions are acquired; through an automatic extraction of the corners of the grids, the algorithm is able to estimate with an iterative procedure the intrinsic parameters of the camera including distortion parameters, according to (4) and (5).


## 3.2. Estimation of Extrinsic Parameters

The reconstruction of the relative pose between camera and object is possible through the estimation of extrinsic parameters of the camera with respect to a reference system that is coincident with the object frameOo-xoyozo. Figure 2 shows the optical pattern realized on the top surface of the target object; it consists of four coplanar circles positioned at the corners of a square of known edge d. The object frame is attached to the pattern in the way shown in the figure.Figure 2
Object frame attached to the visual pattern and camera reference system.The position of the originOowith respect to the camera frame is the vector tc=(Oo-Oc)c, while the relative orientation between the two reference systems is the rotation Roc. The homogeneous transformation Toc coincides with the extrinsic parameters matrix(6)B=Toc=[Roctc0T1].
The aim is to determine the extrinsic parameters, once the geometry of the optical pattern and the pixel coordinates of the centroids of the circles projected onto the image plane are known.The problem of determining the pose, knowing the correspondence ofn points in the world and camera frame reference systems, is typical in photogrammetry (PnP problem), and it is proved that for 4 coplanar points the solution is unique [26, 27]. While the calibration of intrinsic parameters is quite laborious, but does not need to be performed online, the solution of the PnP algorithm for 4 coplanar points is fast enough to be implemented online during the motion of the robot.An experimental test is here presented in order to evaluate the accuracy of the implemented pose estimation method: while keeping fixed the camera, the optical target of Figure2 is moved 7 mm along each axis using a precision micrometric stage. An image of the pattern is grabbed before the motion, and a series of 100 images are stored after the motion.The relative displacements can be estimated by making the difference between the pose obtained from the first image and the pose obtained from each one of the further 100 images. The test has been repeated in two configurations, setting the initialz-distance between the camera and the object, respectively, at 500 mm and 150 mm.Experimental data of the tests are plotted in Figure3. It is clear that there is a larger dispersion of measurements at a bigger distance from the target; moreover, it can be noticed a larger sensitivity to noise along the z axis, parallel to the optical axis. It results also evident how the accuracy of the pose estimation increases approaching the target. The same conclusions can be drawn from Table 1, where experimental data are summarized in terms of mean values and standard deviations: passing from a distance of 500 mm to 150 mm, the standard deviation lowers nearly one order of magnitude in x and y and two orders in z.Table 1
Summary of displacement experimental data: mean values and standard deviations of measured data.
Depth = 500 mmxyzMean value [mm]7.0217.0816.710Standard deviation [mm]0.0070.0090.134Depth = 150 mmxyzMean value [mm]6.9677.1086.810Standard deviation [mm]0.0010.0010.007Distribution of displacement experimental data; (a) distance camera-target≃500 mm; (b) distance camera-target ≃150 mm.
(a)(b)


## 3.3. Control Algorithm

A dynamic look and move control has been implemented following the position-based approach above described. The global architecture is shown in Figure4, where s represents the vector of image features, q is the vector of joint angles, and xm,xd, and xplan are, respectively, the measured, desired, and planned Cartesian coordinates vectors. Looking at the scheme of the control, two separate loops can be identified: the inner loop realizes a standard PD control in the operative space with gravity compensation (g term) by exploiting the information from encoders; the camera, working as an exteroceptive sensor, closes an outer loop where visual information is processed in order to plan and replan in real time the desired trajectory of the robot. It is important to remark that image features extraction is performed externally from the control loop by the real-time image processing hardware (CVS); only the pose estimation, that includes the solution of the PnP algorithm, is involved in the loop.Figure 4
Dynamic look and move PBVS control.A control in the Cartesian space is realized imposing the following requirements to the planned motions:(a)
starting from an arbitrary status of the end-effector (position and velocity), the continuity of position and velocity must be ensured;(b)
the final point must be reached with a vertical tangent in order to facilitate the grasping of the target object.To this purpose, a third-order Bézier curve has been adopted [18, 19]. This curve is defined by 4 points in the 3D space and has the fundamental property of being tangent to the extremities of the polyline defined by the four points (Figure 5(a)).(a) Plot of a cubic 3D Beziér curve; (b) influence of the parametern on the planned trajectory.
(a)(b)The parametric formulation of a cubic Bézier curve is(7)B(s)=P0(1-s3)+3P1s(1-s)2+3P2s2(1-s)+P3s3s∈[0,1].In the trajectory planner algorithm,P0 is the current position of the end-effector, while P3 is the target point obtained from the vision system. Knowing the current velocity direction v̂0 and the desired final velocity direction v̂f, P1 and P2 are defined as(8)P1=P0+‖P3-P0‖nv̂0,P2=P3-‖P3-P0‖nv̂f,
where n is a tunable parameter that influences the curvature of the trajectory (Figure 5(b)); all experimental data reported in the paper are obtained by setting n=3.Since the targetP3 is continuously estimated during the motion of the robot, variations of its position due to motions of the object or to the reduction of the measurement errors (as shown in Figure 3) are compensated by a continuous replanning of the trajectory. A trapezoidal velocity profile is used with a temporal planning algorithm that is able to modify the shape of the profile, while the length of the planned trajectory changes during the motion.


## 4. IBVS Control

In the image-based visual servo control, the error signal is defined directly in terms of image feature parameters. In the present application, the optical target is an annulus painted on the top surface of a cylinder (Figure6).Visual pattern for the IBVS: coordinates in the Cartesian and image spaces.
(a)(b)The image features are the coordinates of the center and the major axis of the ellipse which best approximates the projection of the annulus on the image plane; they are collected in the image space vectors={u,v,d}T expressed in pixel. The relation between image space and Cartesian space is given by in the interaction matrix Le [27]: being ẋ={ẋ,ẏ,ż}T the Cartesian velocity and ṡ={u̇,v̇,ḋ}T the image space velocity, it is(9)ṡ=Leẋ.
Here, the interaction matrix is defined as(10)Le=[f/z0-u/z0f/z-v/z00-fD/z2],
where f is the focal length (assumed equal in u and v directions) expressed in pixel and D is the metric value of the annulus diameter in the Cartesian space. It arises from (10) that the interaction matrix is a function of image features u, v and of the Cartesian variable z. The estimation of z is performed by a linear interpolation on the parameter d; the interpolation law is obtained in a preliminary calibration step. The inversion of (9) is performed at each time step of the control, so that(11)ẋ=Le-1ṡ.The trajectory planner operates in this case over the image space: in analogy with the PBVS control, it is defined as a Bézier curve according to (2) through points defined by image coordinates {u,v,d}. Such kind of strategy allows for the continuity of the velocity in both image and Cartesian spaces, even in the case of motion of the target.Particular attention is focused on the definition of the velocity profile: without going into details for the sake of brevity, it can be summarized that velocity profiles on the image space are properly planned in order to obtain an effective trapezoidal profile in the Cartesian space. This operation is required to prevent that any component of the Cartesian velocity may assume peaks that are too high or may approach asymptotically zero during the motion of the robot. As an example, we may look to the relation that results from the classic pinhole camera model(12)d=fDz.
The derivative of the above expression is:(13)ż=-ḋfDz2,
which could be find directly from the term Le(3,3).Thus, if a constantḋ is imposed according to the trapezoidal planning, the resulting Cartesian vertical speed ż will approach zero when z approaches zero (i.e., when the camera approaches the target). Therefore, if the vertical speed has to be controlled, it must be directly planned in the Cartesian space, and analogously for the x and y components.The scheme of the implemented IBVS, control is shown in Figure7. As in PBVS it is possible to individuate the inner and outer loops. In the outer loop, the pose estimation block disappears, and the image features are directly the input of the trajectory planning block. Then the inverse of the interaction matrix is used to map the trajectory from image to Cartesian space according to (11).Figure 7
Dynamic look and move IBVS control.


## 5. Experimental Tests

A series of tests have been performed in order to compare the PB and IB approaches at different speeds and in cases of fixed or moving target. The starting position of the robot allows the camera to frame a wide area of the workspace; when the target is recognized by the vision system, the controller starts to govern the robot till the target is reached.Figure8 shows the results of the slow tests (vmax=10-1 m/s) with a fixed target. The plots on the left side are referred to the PBVS, while IBVS results are on the right column; the position of the target is the same for both tests. The image plane trajectories of the features and the respective centroid are represented on the top of the figure; such features are the four coplanar circles for the PB and the annulus diameter (represented as a circle) for the IB. The Cartesian position and velocity are plotted, respectively, in the middle and at the bottom of the figure; lines refer to measured entities, while circular markers indicate planned values. Data show that the IB control has a slightly higher accuracy in centering the target. Further on, the IBVS presents higher x and y components of velocity in the initial part of the motion, which allows for quickly compensating the offset between camera and target in the horizontal plane.Slow tests (vmax=10-1 m/s) with fixed target.
(a)(b)Same considerations are even more evident in fast tests where the maximum velocity of the robot is twice that in the slow tests (vmax=2·10-1 m/s). Results are plotted in Figure 9 in analogy with Figure 8. Against a strong decrease of the time required to reach the target, it is not noticed for the IB control an appreciable loss of accuracy. For the PBVS, on the contrary, a certain increment of the final error is evident in the image plane.Fast tests (vmax=2·10-1 m/s) with fixed target.
(a)(b)For the sake of completeness, the error between planned and measured Cartesian coordinates in slow and fast tests is plotted in Figure10. The comparison between IB and PB controls at the same speed shows that Cartesian errors are substantially similar. On the other hand, the error increases of about a factor 2 passing from the slow to the fast mode.Errors between planned and measured Cartesian coordinates for PBVS and IBVS at slow and fast mode.
(a)(b)(c)(d)A further experimental evaluation is here described to prove the ability of the control in compensating dynamically a generic motion of the target: once the visual control has been started, the object is moved by means of a conveyor belt; the controller is able to replan continuously the trajectory ensuring the continuity of the velocity and quickly compensating the displacement imposed to the target. Tests are performed withvmax=2·10-1 m/s, which implies a time of about 5 s to reach the target. The original (referred to the PB algorithm) and replanned trajectories are plotted in Figure 11 in orthographic and axonometric views. The higher sensitivity to offsets on the horizontal plane is once again noticeable for the IBVS, which translates in higher performances in path following tasks.IBVS and PBVS tests with moving target.
(a)(b)(c)(d)


## 6. Conclusions

Two dynamic look and move visual servos, respectively of the position-based and image-based type have been implemented to govern a parallel translating robot. Both controls are able to detect a target in the 3D workspace and to dynamically compensate a generic motion of the target itself. A continuous replanning algorithm defines the trajectory of the end-effector ensuring the continuity of the velocity vector even if sudden displacements are imposed to the target; trajectories are planned using cubic Bézier curves that give a smooth spatial path and allow to impose the final direction of the velocity in order to facilitate the grasping task; such curves are planned, respectively, in the Cartesian space for the PBVS and in the image space for the IBVS.Even if accuracies of the two proposed controls seem to be substantially comparable, experimental results suggest a better behaviour of the IBVS. Furthermore, the IBVS shows a greater sensitivity to horizontal displacement proved by higher components of the velocity vector in thex and y directions in the first part of the trajectory.Both methods require the knowledge of the geometric model of the optical target; specifically for the proposed controls, the edge of the square formed by the four circles in the PB case and the diameter of the annulus in the IB case must be known in metric units. Nevertheless, the PB approach requires also the 3D calibration of the camera in order to estimate the intrinsic parameters matrix, which is then required for the execution of thePnP algorithm; as known from literature, the sensitivity to calibration errors is probably the main drawback of the PBVS.Further on, even if the solution to thePnP problem returns the homogeneous transformation matrix Toc, only the vector tc is a useful information for a pure translation robot. It means that the PB approach gives redundant information for our specific purpose, which translates in useless computational effort for the real-time hardware.All these reasons make the IBVS preferable for the studied application: the method is simple and accurate and does not require a camera calibration. Moreover, the risk of passing through or nearby singularities, which is typical for IB controls, is avoided if, as in this case, the robot is free of singular points inside its workspace.Finally, it is worth to remark as the above considerations are strictly related to the kinematic properties of the robot and may not be valid a priori for other architectures. In this sense, authors are intended to implement PB and IB controls on a parallel robot which confers to the end-effector a 3DOFs motion of pure rotation. Such robot (SpheIRo) has been studied and prototyped at Machine Mechanics Lab of Università Politecnica delle Marche [28] with the philosophy of complementary mobility with respect to ICaRo. Unlike the translation manipulator, SpheIRo presents singular points inside its workspace which may cause problems of stability for the IB control. Moreover, passing from a relative position to a relative orientation problem, the sensitivity of the two algorithms in detecting the orientation between frames has to be assessed.



---

*Source: 103954-2012-05-16.xml*