A geometrical inverse kinematics method for hyper-redundant manipulators

  • 格式:pdf
  • 大小:263.34 KB
  • 文档页数:5

200810th Intl.Conf.on Control,Automation,Robotics and VisionHanoi,Vietnam,17–20December2008A Geometrical Inverse Kinematics Method forHyper-Redundant ManipulatorsSamer Yahya, Haider A. F. Mohamed, M. Moghavvemi, and S. S. YangCentre for Research in Applied Electronics (CRAE)University of Malaya, Kuala Lumpur, WP 50603, Malaysiahaider@.myAbstract— Hyper-redundant manipulators have large numberof kinematic degrees of freedom, thus processing someunconventional features such as the ability to enter a narrowspace while avoiding obstacles. To solve the problem of multi-solution caused by redundancy, a geometrical method ispresented in this paper. This proposed method finds one optimalsolution to the inverse kinematics of redundant or hyperredundant manipulators from these infinite solutions with fewercomputations. This method can be used for any planar n-serialmanipulators. Experiments are conducted 3-links redundantmanipulator and 10-links hyper-redundant manipulator todemonstrate the effectiveness of this proposed method.Keywords— hyper redundant manipulator, inversekinematics, geometrical method.I.I NTRODUCTIONThe term “hyper-redundancy” refers to redundantmanipulators with a very large number of degrees of freedom[1]. It is well known that redundant and hyper-redundantmanipulators have some advantages when compared withclassical arms because they allow the trajectory optimization,both on the free space and on the presence of obstacles, and theresolution of singularities [2].Many algorithms for hyper-redundant manipulator inverse kinematics were proposed and these algorithms generally were divided into three kinds [3]: the algebraic approach [4], the iterative approach, such as neural networks [5],[6], genetics algorithm [7], and the geometric one [3],[8].Most of the techniques for solving the inverse kinematics of hyper-redundant manipulators have many disadvantages when executing, like the complexity in computations, high time-consuming computation, and the difficulty in finding the optimal solution.This paper proposed a method that can be used to find the optimal solution with less computation.II.THE GEOMETRICAL METHOD Consider a manipulator with n dof whose joint variables are denoted by q= [q1,q2,.. ., q n], as shown in Fig. 1.Figure 1. A planar manipulator with n-linksHere,q i denotes the i-th joint's variable, j i denotes the i-th joints, and l i denotes the i-th link. For simplicity, consider that all the links have the same lengths.To understand the proposed method, suppose that (tp) is the target point. The steps below explain this method:1.Draw a circle with a radius equal to the link length and thecenter of which is at (tp).2.Draw a straight line from the center of this circle to thejoint (jn), Fig. 2 shows these steps. Now we can get the new position of the link (ln), where the tip of this link is on the target point (tp) and the other end (the new joint (jn)) is on the intersection between the circle and the straight line. Therefore, the joint angle of the last link (qn) is found.3. A new circle with the same radius is drawn, its center is atthe new joint (jn), and Fig. 3 shows this step.1954978-1-4244-2287-6/08/$25.00c 2008IEEE ICARCV20084.Now draw another straight line from the center of the lastcircle to the joint (jn-1), Fig. 3. Now we can get the new position of the link (ln-1), where the tip of this link is on the center of the last circle, and the other end (the new joint (jn-1)) is on the intersection between this circle and the straight line as shown in Figs. 4 and 5. Therefore, the joint angle of the link (qn-1) is found.Figure 4. Finding the new state of the link (l n-1)n-15.Find the new state for the other links by the same wayuntil touching the new joint (j3).6.To find the new state of the first two links (l1 and l2), twocircles with the radius equal to the link length must be1955drawn, the center of the first one is at the origin point (j1) and the center of the second circle is on the new joint (j3) as shown in Fig. 6.Figure 6. The two circles of step (6)7.Draw a straight line from the new joint (j3) to theintersection point of the two circles (the new joint (j2));this straight line represents the new position of the link (l2). By the same way the straight line between the intersection of the two circles and the origin point (j1) represents the new position of the link (l1). It is noticed that there are two possible states for the two links (l1), and (l2), because there are two intersection points between the circles. Fig. 7 illustrates these possible positions.8.Choose the intersection point which is nearer to thecurrent joint (j2) as shown in Fig. 8.To summarize this algorithm, the flow chart depicted in Fig. 9 is constructed. By following these steps as in the flow chart, the inverse kinematics of each redundant or hyper redundant manipulator can be found, except there is a special case, when the intersection point between the circle and the straight line is out of the reachable area of the current joint. This case will be explained in the next section.Figure 7. The two possible positions of the links (l1) and (l2) Figure 8. The initial and expectative states of the manipulator.1956Figure 9. The flow chart for finding the inverse solution of hyper-redundant manipulator.After implementing these steps, an n-series of lines will be plotted. These lines are the new states for the links of the manipulator.III.SPECIAL CASEWhen the new position of any joint (i-th joint) is specified by finding the intersection point of the circle and the straight line as explained previously, if()()¦−=>+1122ijjiilyxthat is this intersection point is out of the reachable area of the i-th joint. Where x i and y i are the x-axis and y-axis respectively of the intersection point. In this case another circle must be drawn, the center of which is at the origin (j1) and the radius is equal to the reachable area of the i-th joint, Fig. 10 shows this case.To further explain this case, the following example based on Fig. 10 is considered. To find the new joint (j n), a circle must be drawn, the center of which is at the target point (tp) and the radius of this circle is equal to the link length. Then a straight line must be drawn from the target point (tp) to the joint (j n). The intersection point (A) between them is the new joint (j n). Now if the distance between this new joint (j n) which is presented by (A) and the origin (j1) is more than (l1+l2+…..+l n-1), this means that the point (A) is out the reachable area of the joint (j n). Therefore, the circle (C R) is 1957drawn. The center of which is at the origin point (j1) and the radius of the circle is equal to (l1+l2+…..+l n-1). One of the intersection points (C) and (D) between the two circles is to be the new position of the joint (j n). The nearer one of the points (C) or (D) to the current position of the joint (j n) is the new position of the joint (j n). in this example, (B) is the new position of the joint (jn).IV.SIMULATION RESULTSCase1:The first simulation case is a 3-links redundant manipulator; each link is 3 units length. The initial state of every joint is known as q=[80°,60°,0°]. The target point is tp=[5,3] units length. Fig. 11 shows the initial and final states of the manipulator.Figure 11. The first simulation caseAfter implementing the proposed method the joint variables values are q=[80.87°,41.54°,-40.59°].Case2:The second simulation case is a 10-links hyper-redundant manipulator; each link is 2 units length. The initial state of every joint is known as q=[80°,60°,40°,30°,20°,5°,-5°,10°,15°,25°]. The target point is tp=[10,2] units length. Fig. 12 shows the initial and final states of the manipulator.By implementing the proposed method, the joint variables values are found to be: q=[ 86.128°, 55.277°, 40.484°, 30.476°, 20.774°, 5.419°, -2.749°, -40.449°, -109.251°,-128.330°].V.C ONCLUSIONThis paper modeled the inverse kinematics of hyper-redundant manipulator using a simple geometrical method; this method can be used for any planar n-serial manipulator. A flow chart that can be readily used to solve the hyper-redundant inverse kinematics was constructed in this paper.Two cases were simulated in this paper, and the joint variables of each case were calculated using simple calculations. This method can be used for finding the path planning of the end-effecter of the hyper-redundant manipulator.xyFigure 12. The second simulation caseVI.R EFERENCES[1] Chau-Chang W., Vijay K., and Guay-Ming C.," A motion control andobstacle avoidance algorithm for hyper-redundant manipulators", Proceedings of the 1998 International Symposium on UnderwaterTechnology, pp. 466 - 471.[2] Fernando B.M., and Tenreiro J.A., "Kinematic optimization of redundantand hyper-redundant robot trajectories", 1998 IEEE InternationalConference. Electronics, Circuits and Systems, vol. 2, pp. 467 - 470. [3] Li Sheng, Wang Yiqing, Chen Qingwei and Hu Weili, "A newGeometrical Method for the Inverse Kinematics of the Hyper-Redundant Manipulators", 2006 IEEE International Conference.Robotics and Biomimetics, pp. 1356 – 1359.[4] Alba Perez and J. Michael McCarthy, " Sizing a Serial Chain to Fit aTask Trajectory Using Clifford Algebra Exponentials", Proceedings ofthe 2005 IEEE International Conference on Robotics and Automation,pp. 4709-4715.[5] Youshen Xia and Jun Wang, " A dual neural network for kinematiccontrol of redundant robot manipulators", IEEE Transactions. Systems,Man, and Cybernetics. Volume 31, Issue 1, pp. 147 – 154. Feb 2001. [6] Samy F.M. Assal, Keigo Watanabe and Kiyotaka Izumi, "Neuralnetwork learning from hint for the inverse kinematics problem ofredundant arm subject to joint limits", 2005 IEEE/RSJ InternationalConference. Intelligent Robots and Systems, pp. 1477 – 1482.[7] ANDREAS C. NEARCHOU, "Solving the inverse kinematics problemof redundant robots operating in complex environments via a modifiedgenetic algorithm", Mechanism and Machine Theory, Volume 33, Issue3, April 1998, pp. 273-292.[8] Zeki Y. BAYRAKTAROGLU, Fabienne BUTEL, Pierre BLAZEVIC,Viviane PASQUI" A geometrical approach to the trajectory planning ofa snake-like mechanism", Proceedings, 1999 IEEE/RSJ InternationalConference on Intelligent Robots and Systems, vol.3, pp. 1322 – 1327.1958。