Mapping Tasks into Fault Tolerant Manipulators

Size: px
Start display at page:

Download "Mapping Tasks into Fault Tolerant Manipulators"

Transcription

1 Proceedings of the 994 IEEE International Conference on Robotics and Automation, San Diego, CA, Ma 9 3, 994. Mapping Tasks into Fault Tolerant Manipulators Christiaan J.J. Paredis and Pradeep K. Khosla Department of Electrical and Computer Engineering and The Robotics Institute, Carnegie Mellon Universit, Pittsburgh, PA 53 Abstract The application of robots in critical missions in hazardous environments requires the development of reliable or fault tolerant manipulators. In this paper, we define fault tolerance as the abilit to continue the performance of a task after immobilization of a joint due to failure. Initiall, no joint limits are considered, in which case we prove the eistence of fault tolerant manipulators and develop an analsis tool to determine the fault tolerant work space. We also derive design templates for spatial fault tolerant manipulators. When joint limits are introduced, analtic solutions become infeasible but instead a numerical design procedure can be used, as is illustrated through an eample. : Introduction Consider the use of manipulators in a nuclear environment where equipment has to be repaired or space has to be searched for radioactive contamination. A manipulator that is deploed for this kind of critical missions must have man desirable attributes. It must be versatile. That is, the manipulator sstem must be capable of accomplishing a wide variet of tasks and possibl be capable of reconfiguring itself. It must be easil maintainable and cost effective. Ease of maintenance would significantl reduce the downtime and therefore increase the utilit of the sstem. It must also be reliable or fault tolerant. That is, if one of the subsstems were to fail, the reduced sstem should still be capable of accomplishing its mission objectives. The propert of fault tolerance is a must in critical missions that ma involve high costs if the mission were to fail due to a failure in the manipulator sstem. Recentl, fault tolerant (or failure tolerant) robotics has been the subject of several publications [,, 5, 6], in which different aspects of the problem are addressed. Visinsk et al. [6] propose a framework to include failure detection in fault tolerant robot sstems. Lewis and Maciejewski [], on the other hand, discuss the importance of the controller and the redundanc resolution algorithm. In this paper, the focus is on kinematic design of fault tolerant manipulators. : Definition of fault tolerance To set the stage for our development, we define the following properties of fault tolerant manipulators []: Fault Tolerant (FT) Manipulator: An n-dof manipulator that will still be able to meet the task specifications, even if an one or more of its joints fail and are frozen at an arbitrar joint angles. k-reduced Order Derivative (k-rod): When k joints of an n-dof manipulator fail, the effective number of joints is ( n k). The resulting fault manipulator is called a k-reduced order derivative. Order of Fault Tolerance: An n-dof manipulator is FT of the k-th order, if and onl if all possible k-reduced order derivatives can still perform the specified task. We call the manipulator k-fault tolerant. Fault Tolerant Work Space (): The fault tolerant work space of a k-ft manipulator is the set of points reachable b all possible k-reduced order derivatives. These definitions differ from the concept of fault tolerance as proposed b Maciejewski []. Instead of attributing the propert of fault tolerance to a manipulator, he quantifies a measure of fault tolerance for a manipulator posture and describes a technique to determine the optimal FT posture, based on the singular value decomposition of the Jacobian matri. If a joint fails in this optimal posture, the resulting reduced order derivative will have maimum possible deterit. However, a failure at a different angle ma make the eecution of the task impossible.

2 In the rest of this paper, if no specific task is mentioned, it is assumed that the task consists of reaching a nonzero volume of points in the task space, i.e., an m-di- mensional manifold in the m-dimensional task space. A manipulator that satisfies the fault tolerance condition onl while reaching a manifold of dimension less than m, is considered not to be fault tolerant. 3: Properties of fault tolerant manipulators 3.: Eistence frozen θ ROD M * p b work space boundar of M * Suppose that we have an n-dof manipulator,, that satisfies all the kinematic requirements of a given task. It has been shown that such a manipulator can be found b using the task based design approach described in [8] or [3]. An obvious wa to make this manipulator FT is to design ever joint with a redundant actuator. If one of the actuators of the resulting n-dof FT manipulator were to fail, the redundant actuator could take over and the manipulator would still be functional. Similarl, a k-ft manipulator can be constructed b duplicating ever DOF k times, resulting in a ( k )n-dof manipulator. This same manipulator structure can also be interpreted according to the four level subsumptive architecture for FT manipulators, proposed in [5]. The four levels are: I) Dual Actuators: etra actuators per joint. II) Parallel Structures: etra joints per DOF. III) Redundant Manipulators: etra DOFs per arm. IV) Multiple Arms: etra arms per sstem. According to this classification, the ( k )n-dof manipulator is an n-dof manipulator with ( k ) actuators for ever DOF redundanc of level I. In the rest of this paper, we focus our attention on fault tolerant manipulators with redundancies of level III. 3.: Boundar of the fault tolerant work space M n In this section, we show that a boundar point of the is a critical value (A critical value is an end-effector position that can be reached in a singular configuration, i.e., that is the image of a critical point []). Consider a k-ft planar manipulator, M. A boundar point, p b, of the has to be an element of the boundar of the work space of at least one ROD, M *, obtained b freezing k joints of M. Indeed, if p b were an interior point of the work spaces of all RODs, then it would b definition be an interior point of the and not a boundar point. The Jacobian of M *, J M*, can be obtained from the Jacobian of M, J M, b deleting the columns corresponding to the frozen DOFs. Because p b is a boundar point of the work space of, the Jacobian of M * frozen θ d θ Figure : A ROD unable to reach a point outside the. M * at p b is singular. We prove now that J M is singular too. Suppose that J M were non-singular, then at least one of the columns corresponding to a frozen DOF would be outside the column space of the singular matri, J M*. Phsicall this means that a small change in the angle of that frozen DOF would cause the end effector of M to move in a direction with a component perpendicular to the boundar of the work space of the ROD, M *, as illustrated in Figure. The ROD with this new frozen angle would be unable to reach the point, p b. As a result, p b would be outside the, contradicting the fact that p b is a boundar point of the. Thus, J M is singular and p b is a critical value. Consequentl, the is bounded b critical value manifolds. For planar positional manipulators, the critical value manifolds are concentric circles, and the is an annulus with inner radius R min and outer radius. R ma 3.3: Required degree of redundanc In Section 3., it is shown that, in general, kn redundant DOFs i.e. ( k )n DOFs in total are sufficient to achieve k-th order fault tolerance. For planar positional manipulators, we prove now that k DOFs are also necessar for k-th order fault tolerance. p b

3 (k) joints R ma = R min, (4) resulting in a one-dimensional. Therefore, a ( k ) -DOF manipulator cannot be FT 3.4: Including orientation R ma k frozen joints Thus far, we have onl considered planar positional manipulators. The results for positional manipulators can be easil etended to the case in which orientation is considered also, b converting the orientational problem into an equivalent positional problem: R min k frozen joints (k) joints R ma Figure : An upper bound for and a lower bound for. R min The proof shows that ( k ) DOFs (or k redundant DOFs) are insufficient, b finding a lower bound for R min and an upper bound for R ma. First consider the ROD obtained b freezing the first k joints at radians, as illustrated in Figure. The maimum reach in the opposite direction is an upper bound for : R ma k l k i = k R ma i = k () where is the length of the i-th link. In order for to be positive, we must have that: R ma k l k i = k i = k. () Making this assumption, we find that is bounded below b the inner radius of the work space of the ROD obtained b freezing the k last joints at radians, as illustrated in Figure : R min k i = k. (3) From Equation () and Equation (3), it follows that at best l k k i = R min An n-dof manipulator, M, is k-ft with respect to a set of points, W = { ( i, i, ϕ i )}, if and onl if:. the positional manipulator, M ', obtained from M b deleting its last link, l n, is k-th order fault tolerant with respect to the set of points W' = { ( i l n cosϕ i, i l n sinϕ i )},. M ' is ( k ) -FT while reaching the points in W' in an direction. The positional manipulator, M ', needs at least ( k ) DOFs to be k-ft with respect to W' ; therefore, the manipulator M needs at least ( k 3) DOFs. Now, consider a ( k 3) -DOF manipulator with the first ( k ) links having length, l, and the last link having length zero. It is eas to verif that this manipulator s k-th order is: W = { (,, ϕ) l and ϕ [ π, ) } Thus, ( k 3) DOFs are necessar and sufficient for k-th order fault tolerance of planar manipulators when orientation is included This result and the result obtained in Section 3.3 can be summarized in the following theorem: Theorem: For planar manipulators, k redundant DOFs are necessar and sufficient for k-th order fault tolerance. 4: Spatial fault tolerant manipulators For planar FT manipulators, we were able to prove that k is the required degree of redundanc. The proof was based on geometric work space analsis. However, geometric analsis becomes too comple for spatial manipulators, especiall since we are dealing with redundant manipulators. Therefore, we will demonstrate some properties of spatial FT manipulators using two eamples. As a first eample, consider a 5-DOF spatial positional manipulator. Its Denavit-Hartenberg (D-H) parameters are listed in Table. This manipulator is first order FT, (5) 3

4 z Figure 3: A cross-section of the boundar of the of a 5-DOF spatial manipulator (bold) as part of its critical value mani- and because of its simple kinematic structure, an analtic epression for the boundar of the can be derived. The is smmetric with respect to the first ais. A cross-section (the X-Z plane), as shown in Figure 3, can be described b two segments of a circle with radius and center at ( =, z = ), and a straight line from ( =, z = 3) to ( =, z = 3). An important propert of this is that it does not have an holes or a central void, so that the of the same manipulator scaled b an factor, λ >, contains the original. As a result, this FT manipulator can be used as a design template. An specified set of points can be reached in a first order FT wa b a scaled version of the template. In Section 3., it is shown that the boundar of the of a planar manipulator coincides with its critical value manifolds. Figure 3 demonstrates that this propert also holds for the 5-DOF spatial manipulator considered in this eample. The critical value manifolds are comput- DOF i d i a i α i 9 a 3 -a 9 4 b 5 -b Table : D-H parameters of a 5-DOF first order FT spatial manipulator, without orientation. ed using the algorithm described in [] and are depicted in a solid line. The bold part of the critical value manifolds is the boundar of the. As a second eample, consider an 8-DOF manipulator, with D-H parameters listed in Table. It is the same manipulator as in eample one, with a zero-length 3-rollwrist added at the end. Using a Monte Carlo method, it has been determined that this manipulator is first order FT while reaching all the points in the of eample one, in an direction. This propert can be demonstrated with the following arguments. When one of the first five DOFs fails, the manipulator can still reach an position in the (because the 5-DOF positional manipulator is FT) and can take an orientation at this position using the intact 3-roll-wrist. When one of the DOFs in the wrist fails, we are left with a 7-DOF manipulator which has enough orientational capabilities to reach an point in the in an orientation. Consequentl, one could call this the detrous. Since there are again no holes or voids in the, this manipulator can also be used as a design template. Finall, one should notice that both eamples have onl two redundant DOFs, which seems to indicate that the theorem in Section 3.4 is etendable to spatial manipulators. 5: Joint limits In Section, the definition of a FT manipulator included the specification that joints could fail at an arbitrar angle. Thus far, we did not consider joint limits and therefore at an arbitrar joint angle meant at an angle between and π. From now on, however, an arbitrar joint angle is restricted to be within the joint limits. Using two eamples, we discuss now how the introduction of joint limits changes the properties of FT manipulators. First, consider a 4-DOF positional planar manipulator with links of length one. Figure 4 illustrates how the DOF i d i a i α i 9 a 3 -a 9 4 b 5 -b Table : D-H parameters of an 8-DOF first order FT spatial manipulator. 4

5 [-8,8] [-5,5] [-,] [-9,9] section of fewer RODs has to be taken to obtain the. As a second eample, we revisit the 5-DOF spatial manipulator of the previous section. As depicted in Figure 5, the of this 5-DOF manipulator shrinks rapidl when the joint angle intervals are reduced. Moreover, a central hole appears and the splits into two disconnected parts. When the joint angle interval becomes smaller than [ 5, 5 ], the vanishes. From the above eamples, it is clear that the analsis, and therefore also the design of FT manipulators is ver comple when joint limits are introduced. Whereas we were able to generate design templates for the case of no joint limits (or joint limits of ±8 ), finding a general design template is infeasible due to the infinite number of possible joint limits. Therefore, in the net section, we propose a numerical procedure to find the kinematic structure of a FT manipulator when joint limits are considered. 6: Task based design of fault tolerant manipulators 6.: Mathematical formulation In this section, we formulate a method to determine the kinematic structure of a manipulator which is FT with respect to the task of reaching a set of positions/orienta-.5 [-6,6] [-3,3] Figure 4: The of a 4-DOF planar manipulator with joint limits. work space changes when the joint limits (the same limits for all joints) var from ± 8 through ± 3. As one would epect the shrinks, but it also changes position. A point that is outside the of a manipulator without joint limits can become inside the when joint limits are introduced. This can be understood b thinking of the as the intersection of the work spaces of all RODs. When joint limits are introduced, the work space of ever ROD reduces in size, but the inter- z Figure 5: A cross-section of the of a 5-DOF spatial manipulator with joint limits. 5

6 tions, W = { p j = ( j, j, z j, ϑ j, ϕ j, ψ j )}, and for which the joint limits for each of the DOFs are given. We present a technique based on the design method proposed in [4]. In this approach, the Denavit-Hartenberg parameters are determined through the optimization of a penalt, which is positive when an design specification is violated and is zero when all the specifications are met. This is epressed mathematicall as: min min [ pen_f ( DH, θ post, task, cnstr )], (6) DH task points postures where pen_f( ) determines the penalt for the violation of the constraints b a manipulator design, DH, in a posture, θ post, reaching a specific task point. A manipulator is first order FT with respect to a task if all possible first order RODs can fulfill the task. Equation (5) can then be adapted to include first order fault tolerance as follows []: min ma [ min pen_f ( )] DH task points θ j = j θ i ( i j) The maimization ields zero when all the RODs, resulting from a failure of joint j, are able to reach the task point. As a result, the minimization over the D-H parameters equals zero if and onl if all possible RODs are able to reach ever specified task point. 6.: Implementation n Equation (6) contains three nested optimizations. For each ROD, the innermost minimization finds the posture, for which the penalt function is minimal. The task that we consider is to reach a certain point without violating the joint limit constraints. The penalt function therefore consists of two parts. A first part penalizes the failure to reach the point (without considering joint limits). This penalt is equal to the norm squared of the residue, r, namel, the distance between the actual position/orientation of the end effector and its desired position/orientation. A second part, penalizes the joint limit violations. This penalt is equal to n i = (7) ma ma(, θ i θ i ) min { ma(, θ i θ i ) }. (8) The resulting minimization of the full penalt function, is a nonlinear least squares (NLLS) problem, and is commonl solved in robotics applications using a Newton- Raphson scheme [6] (cfr. numericanverse kinematics literature). This scheme converges ver quickl when the penalt at the optimum is zero, i.e., for a zero residual NLLS problem. However, it is possible that a task point measure of isotrop penalt frozen angle θ j frozen angle θ j Figure 6: The penalt function and the measure of isotrop. is outside the reach of the manipulator, in which case the minimization becomes a large residual problem. For this class of problems, the Newton-Raphson scheme (or Gauss-Newton algorithm) converges slowl and is outperformed b the BFGS algorithm (Broden-Fletcher-Goldfarb-Shanno [5]). As shown b Fletcher and Xu [4], the best overall performance is obtained b a hbrid algorithm, which combines the advantages of both the Gauss- Newton and BFGS algorithms. The second optimization in Equation (6) is the maimization over the frozen joint angle, θ j. A tpical eample of the objective function is shown in Figure 6. Notice that the function and its gradient are zero possibl over a large part of the domain, namel, where the task point is reachable. To solve the maimization, we need to incorporate additionanformation. The ke observation is that when the desired point is outside the reach of the manipulator, the innermost minimization algorithm alwas gets stuck at the boundar of the work spaces of the manipulator, where the Jacobian matri of the manipulator loses rank []. The measure of isotrop,, is defined as [7]: m det ( JJ T ) =, (9) trace ( JJ T )/ m with m the number of Cartesian coordinates. For a singular Jacobian, is zero; otherwise it is positive. Consequentl, a minimization over leads to regions where the penalt is possibl positive. Thus, the derivative of with respect to θ j, can be used to compensate for the lack of gradient information in the norm of the residue. As one can see in Figure 6, however, the measure of isotrop is a multimodal function of θ j. As there is onl one optimization variable, an efficient global optimization algorithm, such as the P * algorithm developed b Zilinskas [7], can be used. P * is a combination of a 6

7 In this paper, we defined fault tolerance as a propert of a small class of redundant manipulators. Based on the definition, we were able to constructivel prove the eistence of FT manipulators b duplicating the joints. When no joint limits are considered, we proved analticall that, k redundant DOFs are necessar and sufficient for fault tolerance of planar manipulators. We also proved that the boundar of the consists of critical values. For spatial manipulators, design templates were introduced. A manipulator able to reach a specified set of points can be designed b scaling the template appropriatel. For manipulators with joint limits, analtical solutions be- 5 DOF solution p = (.5,,.5) DOF i d i a i α i p = (,.5,.5) ()..7 9 p 3 = (.75,,.5).. Notice that we do not consider end effector orientation at this time. The joint limits for all five DOFs are and 5. From the eample in Section 5, we know that five degrees of freedom are sufficient for first order fault toler Table 3: D-H parameters of a 5-DOF first order FT spatial solution with joint limits. ance. Our numerical results confirm this. The D-H parameters of a possible design are listed in Table 3. Figure 7 shows a cross-section along the XZ-plane of the boundar of the. one-stage Baesian algorithm and Brent s local minimization resulting in smart global coverage and accurate local refinement. The third and outermost optimization minimizes the total penalt of a kinematic configuration, defined b the ( 3n ) D-H parameters. Unfortunatel, this function also has multiple minima. Therefore, we need to emplo a global optimization method, such as simulated annealing. Simulated annealing was first proposed as a combinatorial optimization algorithm [9], but can be easil adapted to continuousl varing optimization variables. The method is basicall a random iterative improvement algorithm with the modification that, under certain conditions, an increase in the objective function is accepted. A new trial configuration is generated randoml in the neighborhood of the current configuration. The condition for acceptance of this trial configuration is: 8: Summar F obj ep ( F obj T) random [, ) () which depends on a control variable, T, the temperature. The algorithm is started at a high temperature, for which all new configurations are accepted. After each iteration the temperature is decreased until no new acceptable configuration can be found. The search is then frozen. We adapted this basic algorithm to include the special properties of our objective function, in particular, the algorithm is stopped when a new trial configuration has an objective function value equal to zero, even when the search is not et frozen. We know that a kinematic configuration with a penalt of zero satisfies all the design requirements. 7: Numerical results accept > accept To illustrate the approach developed in the previous section, we give an eample of a first order FT spatial manipulator design: a five DOF spatial manipulator that is required to be first order FT while accomplishing the task of reaching three points: z Figure 7: A cross-section of the of the 5-DOF solution 7

8 come infeasible. Therefore, we introduced a numerical design method based on an earlier developed task based design approach. All the different steps of our development were illustrated with design eamples. 9: Acknowledgment This research was funded in part b DOE under grant DE-F9-89ER44, b Sandia under contract AC- 375-A, b the Department of Electrical and Computer Engineering, and b The Robotics Institute, Carnegie Mellon Universit. : References [] W.K.F. Au, C.J.J. Paredis, P.K. Khosla, Kinematic Design of Fault Tolerant Manipulators, in Proceedings of the Allerton Conference, October, 99, Urbana-Champagne, Illinois. [] J.W. Burdick, Kinematic Analsis and Design of Redundant Robot Manipulators, Stanford Computer Science Report no. STAN-CS-88-7, 988. [3] J. Denavit, R.S. Hartenberg, A Kinematic Notation for Lower-Pair Mechanisms Based on Matrices, Journal of Applied Mechanics, Vol., No., pp. 5, June 955. [4] R. Fletcher, C. Xu, Hbrid Methods for Nonlinear Least Squares, IMA Journal of Numerical Analsis, Vol. 7, No. 3, pp , Jul 987. [5] R. Fletcher, Practical Methods of Optimization, Second Edition, John Wile & Sons, New York, 987. [6] P.K. Khosla, C.P. Neuman, F.B. Prinz, An Algorithm for Seam Tracking Applications, The International Journal of Robotics Research, Vol. 4, No., pp. 7 4, Spring 985. [7] J.-O. Kim, P.K. Khosla, Deterit Measures for Design and Control of Manipulators, in Proceedings of IROS 9: International Workshop on Intelligent Robots and Sstems, pp , Osaka, Japan, Nov. 3 5, 99. [8] J.-O. Kim, Task Based Kinematic Design of Robot Manipulators, Ph.D. thesis, Robotics Ph.D. Program, Carnegie Mellon Universit, Pittsburgh, PA, August 99. [9] S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization b Simulated Annealing, Science, Vol., No. 4598, pp , Ma 983. [] D. Kohli, M.-S. Hsu, The Jacobian Analsis of Workspaces of Mechanical Manipulators, Mechanism and Machine Theor, Vol., No. 3, pp , 987. [] C.L. Lewis, A.A. Maciejewski, Deterit Optimization of Kinematicall Redundant Manipulators in the Presence of Joint Failures, to appear in Computers and Electrical Engineering, 993. [] A.A. Maciejewski, Fault Tolerant Properties of Kinematicall Redundant Manipulators, in Proceedings of the 99 IEEE International Conference on Robotics and Automation, Cincinnati, Ohio, pp , Ma 99. [3] C.J.J. Paredis, An Approach for Mapping Kinematic Task Specifications into a Manipulator Design, M.S. Thesis, Electrical and Computer Engineering Department, Carnegie Mellon Universit, September 99. [4] C.J.J. Paredis, P.K. Khosla, Kinematic Design of Serial Link Manipulators from Task Specifications, The International Journal of Robotics Research, Vol., No. 3, pp , June 993. [5] D. Sreevijaan, On the Design of Fault-Tolerant Robotic Manipulator Sstems, M.S. Thesis, Mechanical Engineering Department, The Universit of Teas at Austin, June 99. [6] M.L. Visinsk, I.D. Walker, and J.R. Cavallaro, Laered Dnamic Fault Detection and Tolerance for Robots, in Proceedings of the 993 IEEE International Conference on Robotics and Automation, Atlanta, Georgia, pp. 8-87, Ma 993. [7] A. Zilinskas, Optimization of One-Dimensional Multimodal Functions, Algorithm AS 33, Applied Statistics, Vol. 3, pp ,

Fault Tolerant Task Execution through Global Trajectory Planning

Fault Tolerant Task Execution through Global Trajectory Planning Fault Tolerant Task Execution through Global Trajectory Planning Christiaan J. J. Paredis Pradeep K. Khosla Department of Electrical and Computer Engineering and The Robotics Institute, Carnegie Mellon

More information

Designing Fault Tolerant Manipulators: How Many Degrees-of-Freedom?

Designing Fault Tolerant Manipulators: How Many Degrees-of-Freedom? Designing Fault Tolerant Manipulators: How Many Degrees-of-Freedom? Christiaan J. J. Paredis and Pradeep K. Khosla Department of Electrical and Computer Engineering and The Robotics Institute, Carnegie

More information

MEM380 Applied Autonomous Robots Winter Robot Kinematics

MEM380 Applied Autonomous Robots Winter Robot Kinematics MEM38 Applied Autonomous obots Winter obot Kinematics Coordinate Transformations Motivation Ultimatel, we are interested in the motion of the robot with respect to a global or inertial navigation frame

More information

A New Algorithm for Measuring and Optimizing the Manipulability Index

A New Algorithm for Measuring and Optimizing the Manipulability Index A New Algorithm for Measuring and Optimizing the Manipulability Index Mohammed Mohammed, Ayssam Elkady and Tarek Sobh School of Engineering, University of Bridgeport, USA. Mohammem@bridgeport.edu Abstract:

More information

A Full Analytical Solution to the Direct and Inverse Kinematics of the Pentaxis Robot Manipulator

A Full Analytical Solution to the Direct and Inverse Kinematics of the Pentaxis Robot Manipulator A Full Analtical Solution to the Direct and Inverse Kinematics of the Pentais Robot Manipulator Moisés Estrada Castañeda, Luis Tupak Aguilar Bustos, Luis A. Gonále Hernánde Instituto Politécnico Nacional

More information

general purpose manipulator, then one has rst to de- machine models of manipulators. While such a development to address this general problem.

general purpose manipulator, then one has rst to de- machine models of manipulators. While such a development to address this general problem. Christiaan J. J. Paredis, Carnegie Mellon University, Pittsburgh, PA, USA Pradeep K. Khosla, Carnegie Mellon University, Pittsburgh, PA, USA In this paper, we deal with two important issues in relation

More information

A New Algorithm for Measuring and Optimizing the Manipulability Index

A New Algorithm for Measuring and Optimizing the Manipulability Index DOI 10.1007/s10846-009-9388-9 A New Algorithm for Measuring and Optimizing the Manipulability Index Ayssam Yehia Elkady Mohammed Mohammed Tarek Sobh Received: 16 September 2009 / Accepted: 27 October 2009

More information

A rigid body free to move in a reference frame will, in the general case, have complex motion, which is simultaneously a combination of rotation and

A rigid body free to move in a reference frame will, in the general case, have complex motion, which is simultaneously a combination of rotation and 050389 - Analtical Elements of Mechanisms Introduction. Degrees of Freedom he number of degrees of freedom (DOF) of a sstem is equal to the number of independent parameters (measurements) that are needed

More information

Inverse Kinematics. Given a desired position (p) & orientation (R) of the end-effector

Inverse Kinematics. Given a desired position (p) & orientation (R) of the end-effector Inverse Kinematics Given a desired position (p) & orientation (R) of the end-effector q ( q, q, q ) 1 2 n Find the joint variables which can bring the robot the desired configuration z y x 1 The Inverse

More information

Closure Polynomials for Strips of Tetrahedra

Closure Polynomials for Strips of Tetrahedra Closure Polnomials for Strips of Tetrahedra Federico Thomas and Josep M. Porta Abstract A tetrahedral strip is a tetrahedron-tetrahedron truss where an tetrahedron has two neighbors ecept those in the

More information

Introduction to Homogeneous Transformations & Robot Kinematics

Introduction to Homogeneous Transformations & Robot Kinematics Introduction to Homogeneous Transformations & Robot Kinematics Jennifer Ka Rowan Universit Computer Science Department. Drawing Dimensional Frames in 2 Dimensions We will be working in -D coordinates,

More information

Jacobian: Velocities and Static Forces 1/4

Jacobian: Velocities and Static Forces 1/4 Jacobian: Velocities and Static Forces /4 Models of Robot Manipulation - EE 54 - Department of Electrical Engineering - University of Washington Kinematics Relations - Joint & Cartesian Spaces A robot

More information

Two Dimensional Viewing

Two Dimensional Viewing Two Dimensional Viewing Dr. S.M. Malaek Assistant: M. Younesi Two Dimensional Viewing Basic Interactive Programming Basic Interactive Programming User controls contents, structure, and appearance of objects

More information

A New Concept on Automatic Parking of an Electric Vehicle

A New Concept on Automatic Parking of an Electric Vehicle A New Concept on Automatic Parking of an Electric Vehicle C. CAMUS P. COELHO J.C. QUADRADO Instituto Superior de Engenharia de Lisboa Rua Conselheiro Emídio Navarro PORTUGAL Abstract: - A solution to perform

More information

2.2 Absolute Value Functions

2.2 Absolute Value Functions . Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number

More information

THE ORTHOGLIDE: KINEMATICS AND WORKSPACE ANALYSIS

THE ORTHOGLIDE: KINEMATICS AND WORKSPACE ANALYSIS THE ORTHOGIDE: KINEMATICS AND WORKSPACE ANAYSIS A. Pashkevich Robotic aborator, Belarusian State Universit of Informatics and Radioelectronics 6 P. Brovka St., Minsk, 007, Belarus E-mail: pap@ bsuir.unibel.b

More information

CS 157: Assignment 6

CS 157: Assignment 6 CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve

More information

Section 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a

Section 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Section.: Absolute Value Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.

More information

Triangulation: A new algorithm for Inverse Kinematics

Triangulation: A new algorithm for Inverse Kinematics Triangulation: A new algorithm for Inverse Kinematics R. Müller-Cajar 1, R. Mukundan 1, 1 University of Canterbury, Dept. Computer Science & Software Engineering. Email: rdc32@student.canterbury.ac.nz

More information

CMSC 425: Lecture 10 Basics of Skeletal Animation and Kinematics

CMSC 425: Lecture 10 Basics of Skeletal Animation and Kinematics : Lecture Basics of Skeletal Animation and Kinematics Reading: Chapt of Gregor, Game Engine Architecture. The material on kinematics is a simplification of similar concepts developed in the field of robotics,

More information

NONCONGRUENT EQUIDISSECTIONS OF THE PLANE

NONCONGRUENT EQUIDISSECTIONS OF THE PLANE NONCONGRUENT EQUIDISSECTIONS OF THE PLANE D. FRETTLÖH Abstract. Nandakumar asked whether there is a tiling of the plane b pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker

More information

Image Metamorphosis By Affine Transformations

Image Metamorphosis By Affine Transformations Image Metamorphosis B Affine Transformations Tim Mers and Peter Spiegel December 16, 2005 Abstract Among the man was to manipulate an image is a technique known as morphing. Image morphing is a special

More information

NATIONAL UNIVERSITY OF SINGAPORE. (Semester I: 1999/2000) EE4304/ME ROBOTICS. October/November Time Allowed: 2 Hours

NATIONAL UNIVERSITY OF SINGAPORE. (Semester I: 1999/2000) EE4304/ME ROBOTICS. October/November Time Allowed: 2 Hours NATIONAL UNIVERSITY OF SINGAPORE EXAMINATION FOR THE DEGREE OF B.ENG. (Semester I: 1999/000) EE4304/ME445 - ROBOTICS October/November 1999 - Time Allowed: Hours INSTRUCTIONS TO CANDIDATES: 1. This paper

More information

1. We ll look at: Types of geometrical transformation. Vector and matrix representations

1. We ll look at: Types of geometrical transformation. Vector and matrix representations Tob Howard COMP272 Computer Graphics and Image Processing 3: Transformations Tob.Howard@manchester.ac.uk Introduction We ll look at: Tpes of geometrical transformation Vector and matri representations

More information

Jacobian: Velocities and Static Forces 1/4

Jacobian: Velocities and Static Forces 1/4 Jacobian: Velocities and Static Forces /4 Advanced Robotic - MAE 6D - Department of Mechanical & Aerospace Engineering - UCLA Kinematics Relations - Joint & Cartesian Spaces A robot is often used to manipulate

More information

[ ] [ ] Orthogonal Transformation of Cartesian Coordinates in 2D & 3D. φ = cos 1 1/ φ = tan 1 [ 2 /1]

[ ] [ ] Orthogonal Transformation of Cartesian Coordinates in 2D & 3D. φ = cos 1 1/ φ = tan 1 [ 2 /1] Orthogonal Transformation of Cartesian Coordinates in 2D & 3D A vector is specified b its coordinates, so it is defined relative to a reference frame. The same vector will have different coordinates in

More information

Quad-Tree Based Geometric-Adapted Cartesian Grid Generation

Quad-Tree Based Geometric-Adapted Cartesian Grid Generation Quad-Tree Based Geometric-Adapted Cartesian Grid Generation EMRE KARA1, AHMET ĐHSAN KUTLAR1, MEHMET HALUK AKSEL 1Department of Mechanical Engineering Universit of Gaziantep 7310 Gaziantep TURKEY Mechanical

More information

Agent-Based Design of Fault Tolerant Manipulators for Satellite Docking

Agent-Based Design of Fault Tolerant Manipulators for Satellite Docking Agent-Based Design of Fault Tolerant Manipulators for Satellite Docking Abstract: A rapidly deployable fault tolerant manipulator system consists of modular hardware and support software that allow the

More information

Efficient Closed-Form Solution of Inverse Kinematics for a Specific Six-DOF Arm

Efficient Closed-Form Solution of Inverse Kinematics for a Specific Six-DOF Arm International Journal of Control, Automation, and Sstems (1) 1 Efficient Closed-Form Solution of Inverse Kinematics for a Specific Si-DOF Arm Thanhtam Ho, Chul-Goo Kang*, and Sangoon Lee Abstract: Inverse

More information

Maximum Entropy Model (III): training and smoothing. LING 572 Fei Xia

Maximum Entropy Model (III): training and smoothing. LING 572 Fei Xia Maimum Entrop Model III: training and smoothing LING 572 Fei Xia 1 Outline Overview The Maimum Entrop Principle Modeling** Decoding Training** Smoothing** Case stud: POS tagging: covered in ling570 alread

More information

EXPANDING THE CALCULUS HORIZON. Robotics

EXPANDING THE CALCULUS HORIZON. Robotics EXPANDING THE CALCULUS HORIZON Robotics Robin designs and sells room dividers to defra college epenses. She is soon overwhelmed with orders and decides to build a robot to spra paint her dividers. As in

More information

GLOBAL EDITION. Interactive Computer Graphics. A Top-Down Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner

GLOBAL EDITION. Interactive Computer Graphics. A Top-Down Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner GLOBAL EDITION Interactive Computer Graphics A Top-Down Approach with WebGL SEVENTH EDITION Edward Angel Dave Shreiner This page is intentionall left blank. 4.10 Concatenation of Transformations 219 in

More information

Hybrid Computing Algorithm in Representing Solid Model

Hybrid Computing Algorithm in Representing Solid Model The International Arab Journal of Information Technolog, Vol. 7, No. 4, October 00 4 Hbrid Computing Algorithm in Representing Solid Model Muhammad Matondang and Habibollah Haron Department of Modeling

More information

Jane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute

Jane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute Jane Li Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute We know how to describe the transformation of a single rigid object w.r.t. a single

More information

Introduction to Homogeneous Transformations & Robot Kinematics

Introduction to Homogeneous Transformations & Robot Kinematics Introduction to Homogeneous Transformations & Robot Kinematics Jennifer Ka, Rowan Universit Computer Science Department Januar 25. Drawing Dimensional Frames in 2 Dimensions We will be working in -D coordinates,

More information

Finding Reachable Workspace of a Robotic Manipulator by Edge Detection Algorithm

Finding Reachable Workspace of a Robotic Manipulator by Edge Detection Algorithm International Journal of Advanced Mechatronics and Robotics (IJAMR) Vol. 3, No. 2, July-December 2011; pp. 43-51; International Science Press, ISSN: 0975-6108 Finding Reachable Workspace of a Robotic Manipulator

More information

NUMERICAL PERFORMANCE OF COMPACT FOURTH ORDER FORMULATION OF THE NAVIER-STOKES EQUATIONS

NUMERICAL PERFORMANCE OF COMPACT FOURTH ORDER FORMULATION OF THE NAVIER-STOKES EQUATIONS Published in : Communications in Numerical Methods in Engineering (008 Commun.Numer.Meth.Engng. 008; Vol : pp 003-019 NUMERICAL PERFORMANCE OF COMPACT FOURTH ORDER FORMULATION OF THE NAVIER-STOKES EQUATIONS

More information

02/22/02. Assignment 1 on the web page: Announcements. Test login procedure NOW!

02/22/02.   Assignment 1 on the web page: Announcements. Test login procedure NOW! Announcements Assignment on the web page: www.cs.cmu.edu/~jkh/anim_class.html est login procedure NOW! 0//0 Forward and Inverse Kinematics Parent: Chapter 4. Girard and Maciejewski 985 Zhao and Badler

More information

A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions

A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions Wenger P., Chablat D. et Baili M., A DH-parameter based condition for R orthogonal manipulators to have 4 distinct inverse kinematic solutions, Journal of Mechanical Design, Volume 17, pp. 150-155, Janvier

More information

The Graph of an Equation

The Graph of an Equation 60_0P0.qd //0 :6 PM Page CHAPTER P Preparation for Calculus Archive Photos Section P. RENÉ DESCARTES (96 60) Descartes made man contributions to philosoph, science, and mathematics. The idea of representing

More information

Discussion: Clustering Random Curves Under Spatial Dependence

Discussion: Clustering Random Curves Under Spatial Dependence Discussion: Clustering Random Curves Under Spatial Dependence Gareth M. James, Wenguang Sun and Xinghao Qiao Abstract We discuss the advantages and disadvantages of a functional approach to clustering

More information

2.8 Distance and Midpoint Formulas; Circles

2.8 Distance and Midpoint Formulas; Circles Section.8 Distance and Midpoint Formulas; Circles 9 Eercises 89 90 are based on the following cartoon. B.C. b permission of Johnn Hart and Creators Sndicate, Inc. 89. Assuming that there is no such thing

More information

Jacobians. 6.1 Linearized Kinematics. Y: = k2( e6)

Jacobians. 6.1 Linearized Kinematics. Y: = k2( e6) Jacobians 6.1 Linearized Kinematics In previous chapters we have seen how kinematics relates the joint angles to the position and orientation of the robot's endeffector. This means that, for a serial robot,

More information

Singularity Handling on Puma in Operational Space Formulation

Singularity Handling on Puma in Operational Space Formulation Singularity Handling on Puma in Operational Space Formulation Denny Oetomo, Marcelo Ang Jr. National University of Singapore Singapore d oetomo@yahoo.com mpeangh@nus.edu.sg Ser Yong Lim Gintic Institute

More information

Identifying the Failure-Tolerant Workspace Boundaries of a Kinematically Redundant Manipulator

Identifying the Failure-Tolerant Workspace Boundaries of a Kinematically Redundant Manipulator 007 IEEE International Conference on Robotics and Automation Roma, Italy, 10-14 April 007 FrD10.3 Identifying the Failure-Tolerant Workspace Boundaries of a Kinematically Redundant Manipulator Rodney G.

More information

An Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory

An Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory An Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory Roshdy Foaad Abo-Shanab Kafr Elsheikh University/Department of Mechanical Engineering, Kafr Elsheikh,

More information

D-Calib: Calibration Software for Multiple Cameras System

D-Calib: Calibration Software for Multiple Cameras System D-Calib: Calibration Software for Multiple Cameras Sstem uko Uematsu Tomoaki Teshima Hideo Saito Keio Universit okohama Japan {u-ko tomoaki saito}@ozawa.ics.keio.ac.jp Cao Honghua Librar Inc. Japan cao@librar-inc.co.jp

More information

Transformations of Functions. 1. Shifting, reflecting, and stretching graphs Symmetry of functions and equations

Transformations of Functions. 1. Shifting, reflecting, and stretching graphs Symmetry of functions and equations Chapter Transformations of Functions TOPICS.5.. Shifting, reflecting, and stretching graphs Smmetr of functions and equations TOPIC Horizontal Shifting/ Translation Horizontal Shifting/ Translation Shifting,

More information

CS F-07 Objects in 2D 1

CS F-07 Objects in 2D 1 CS420-2010F-07 Objects in 2D 1 07-0: Representing Polgons We want to represent a simple polgon Triangle, rectangle, square, etc Assume for the moment our game onl uses these simple shapes No curves for

More information

Computer Graphics. P04 Transformations. Aleksandra Pizurica Ghent University

Computer Graphics. P04 Transformations. Aleksandra Pizurica Ghent University Computer Graphics P4 Transformations Aleksandra Pizurica Ghent Universit Telecommunications and Information Processing Image Processing and Interpretation Group Transformations in computer graphics Goal:

More information

Matlab Simulator of a 6 DOF Stanford Manipulator and its Validation Using Analytical Method and Roboanalyzer

Matlab Simulator of a 6 DOF Stanford Manipulator and its Validation Using Analytical Method and Roboanalyzer Matlab Simulator of a 6 DOF Stanford Manipulator and its Validation Using Analytical Method and Roboanalyzer Maitreyi More 1, Rahul Abande 2, Ankita Dadas 3, Santosh Joshi 4 1, 2, 3 Department of Mechanical

More information

Singularity Management Of 2DOF Planar Manipulator Using Coupled Kinematics

Singularity Management Of 2DOF Planar Manipulator Using Coupled Kinematics Singularity Management Of DOF lanar Manipulator Using oupled Kinematics Theingi, huan Li, I-Ming hen, Jorge ngeles* School of Mechanical & roduction Engineering Nanyang Technological University, Singapore

More information

[4] D. Pieper, "The Kinematics of Manipulators Under Computer Control," Unpublished Ph.D. Thesis, Stanford University, 1968.

[4] D. Pieper, The Kinematics of Manipulators Under Computer Control, Unpublished Ph.D. Thesis, Stanford University, 1968. 128 Chapter 4 nverse manipulator kinematics is moderately expensive computationally, but the other solutions are found very quickly by summing and differencing angles, subtracting jr, and so on. BBLOGRAPHY

More information

4 Kinematic Linkages. Chapter 4. Kinematic Linkages. Department of Computer Science and Engineering 4-1

4 Kinematic Linkages. Chapter 4. Kinematic Linkages. Department of Computer Science and Engineering 4-1 Kinematic Linkages 4-1 Introduction In describing an object s motion, it is often useful to relate it to another object. Consider, for eample a coordinate system centered at our sun in which the moon s

More information

1.5 LIMITS. The Limit of a Function

1.5 LIMITS. The Limit of a Function 60040_005.qd /5/05 :0 PM Page 49 SECTION.5 Limits 49.5 LIMITS Find its of functions graphicall and numericall. Use the properties of its to evaluate its of functions. Use different analtic techniques to

More information

Inverse Kinematics Analysis for Manipulator Robot With Wrist Offset Based On the Closed-Form Algorithm

Inverse Kinematics Analysis for Manipulator Robot With Wrist Offset Based On the Closed-Form Algorithm Inverse Kinematics Analysis for Manipulator Robot With Wrist Offset Based On the Closed-Form Algorithm Mohammed Z. Al-Faiz,MIEEE Computer Engineering Dept. Nahrain University Baghdad, Iraq Mohammed S.Saleh

More information

Polynomials. Math 4800/6080 Project Course

Polynomials. Math 4800/6080 Project Course Polnomials. Math 4800/6080 Project Course 2. The Plane. Boss, boss, ze plane, ze plane! Tattoo, Fantas Island The points of the plane R 2 are ordered pairs (x, ) of real numbers. We ll also use vector

More information

Motion Planning for a Mobile Manipulator with Imprecise Locomotion

Motion Planning for a Mobile Manipulator with Imprecise Locomotion Motion Planning for a Mobile Manipulator with Imprecise Locomotion Dong Hun Shin, Bradle S. Hamner, Sanjiv Singh, and Mung Hwangbo Dept. of Mechanical Eng. Universit of Seoul shin@uos.ac.kr The Robotics

More information

A TWO-DIMENSIONAL CONTINUOUS ACTION LEARNING AUTOMATON

A TWO-DIMENSIONAL CONTINUOUS ACTION LEARNING AUTOMATON Control 4, Universit of Bath, UK, September 4 ID-34 A TWO-DIMENSIONAL CONTINUOUS ACTION LEARNING AUTOMATON K. Spurgeon, Q. H. Wu, Z. Richardson, J. Fitch Department of Electrical Eng. and Electronics,

More information

Non-Euclidean Spring Embedders

Non-Euclidean Spring Embedders Non-Euclidean Spring Embedders Stephen G. Kobourov Universit of Arizona Kevin Wampler Universit of Arizona Abstract We present a method b which force-directed algorithms for graph laouts can be generalized

More information

y = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7)

y = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7) 0 Relations and Functions.7 Transformations In this section, we stud how the graphs of functions change, or transform, when certain specialized modifications are made to their formulas. The transformations

More information

LEVEL-SET METHOD FOR WORKSPACE ANALYSIS OF SERIAL MANIPULATORS

LEVEL-SET METHOD FOR WORKSPACE ANALYSIS OF SERIAL MANIPULATORS LEVEL-SET METHOD FOR WORKSPACE ANALYSIS OF SERIAL MANIPULATORS Erika Ottaviano*, Manfred Husty** and Marco Ceccarelli* * LARM: Laboratory of Robotics and Mechatronics DiMSAT University of Cassino Via Di

More information

CS770/870 Spring 2017 Transformations

CS770/870 Spring 2017 Transformations CS770/870 Spring 2017 Transformations Coordinate sstems 2D Transformations Homogeneous coordinates Matrices, vectors, points Coordinate Sstems Coordinate sstems used in graphics Screen coordinates: the

More information

Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables

Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables

More information

Tubes are Fun. By: Douglas A. Ruby Date: 6/9/2003 Class: Geometry or Trigonometry Grades: 9-12 INSTRUCTIONAL OBJECTIVES:

Tubes are Fun. By: Douglas A. Ruby Date: 6/9/2003 Class: Geometry or Trigonometry Grades: 9-12 INSTRUCTIONAL OBJECTIVES: Tubes are Fun B: Douglas A. Rub Date: 6/9/2003 Class: Geometr or Trigonometr Grades: 9-2 INSTRUCTIONAL OBJECTIVES: Using a view tube students will conduct an eperiment involving variation of the viewing

More information

3D Computer Vision II. Reminder Projective Geometry, Transformations. Nassir Navab. October 27, 2009

3D Computer Vision II. Reminder Projective Geometry, Transformations. Nassir Navab. October 27, 2009 3D Computer Vision II Reminder Projective Geometr, Transformations Nassir Navab based on a course given at UNC b Marc Pollefes & the book Multiple View Geometr b Hartle & Zisserman October 27, 29 2D Transformations

More information

Method of Continuous Representation of Functions Having Real and Imaginary Parts

Method of Continuous Representation of Functions Having Real and Imaginary Parts www.sjmmf.org Journal of Modern Mathematics Frontier, Volume 5 06 doi: 0.4355/jmmf.06.05.00 Method of Continuous Representation of Functions Having Real and Imaginar Parts Ivanov K.S. * Department of Aero

More information

Chain Pattern Scheduling for nested loops

Chain Pattern Scheduling for nested loops Chain Pattern Scheduling for nested loops Florina Ciorba, Theodore Andronikos and George Papakonstantinou Computing Sstems Laborator, Computer Science Division, Department of Electrical and Computer Engineering,

More information

Precision Peg-in-Hole Assembly Strategy Using Force-Guided Robot

Precision Peg-in-Hole Assembly Strategy Using Force-Guided Robot 3rd International Conference on Machiner, Materials and Information Technolog Applications (ICMMITA 2015) Precision Peg-in-Hole Assembl Strateg Using Force-Guided Robot Yin u a, Yue Hu b, Lei Hu c BeiHang

More information

20 Calculus and Structures

20 Calculus and Structures 0 Calculus and Structures CHAPTER FUNCTIONS Calculus and Structures Copright LESSON FUNCTIONS. FUNCTIONS A function f is a relationship between an input and an output and a set of instructions as to how

More information

The Isoconditioning Loci of A Class of Closed-Chain Manipulators

The Isoconditioning Loci of A Class of Closed-Chain Manipulators The Isoconditioning Loci of A lass of losed-hain Manipulators amien hablat, Philippe Wenger, Jorge Angeles To cite this version: amien hablat, Philippe Wenger, Jorge Angeles. The Isoconditioning Loci of

More information

Kinematic Model of Robot Manipulators

Kinematic Model of Robot Manipulators Kinematic Model of Robot Manipulators Claudio Melchiorri Dipartimento di Ingegneria dell Energia Elettrica e dell Informazione (DEI) Università di Bologna email: claudio.melchiorri@unibo.it C. Melchiorri

More information

2.2 Differential Forms

2.2 Differential Forms 2.2 Differential Forms With vector analsis, there are some operations such as the curl derivative that are difficult to understand phsicall. We will introduce a notation called the calculus of differential

More information

1724. Mobile manipulators collision-free trajectory planning with regard to end-effector vibrations elimination

1724. Mobile manipulators collision-free trajectory planning with regard to end-effector vibrations elimination 1724. Mobile manipulators collision-free trajectory planning with regard to end-effector vibrations elimination Iwona Pajak 1, Grzegorz Pajak 2 University of Zielona Gora, Faculty of Mechanical Engineering,

More information

4. Two Dimensional Transformations

4. Two Dimensional Transformations 4. Two Dimensional Transformations CS362 Introduction to Computer Graphics Helena Wong, 2 In man applications, changes in orientations, sizes, and shapes are accomplished with geometric transformations

More information

Inverse Kinematics Learning by Modular Architecture Neural Networks with Performance Prediction Networks

Inverse Kinematics Learning by Modular Architecture Neural Networks with Performance Prediction Networks Proceedings of the IEEE International Conference on Robotics & Automation Seoul, Korea Ma -6, Inverse Kinematics Learning b Modular Architecture Neural works with Prediction works Eimei OYAMA and Nak Young

More information

[2] J. "Kinematics," in The International Encyclopedia of Robotics, R. Dorf and S. Nof, Editors, John C. Wiley and Sons, New York, 1988.

[2] J. Kinematics, in The International Encyclopedia of Robotics, R. Dorf and S. Nof, Editors, John C. Wiley and Sons, New York, 1988. 92 Chapter 3 Manipulator kinematics The major expense in calculating kinematics is often the calculation of the transcendental functions (sine and cosine). When these functions are available as part of

More information

An Approach for Mapping Kinematic Task Specifications into a Manipulator Design

An Approach for Mapping Kinematic Task Specifications into a Manipulator Design An Approach for Mapping Kinematic Task Specifications into a Manipulator Design Christiaan J.J. Paredis and Pradeep K. Khosla Department of Electrica.l & Computer Engineering and The Robotics Institute

More information

Solution of inverse kinematic problem for serial robot using dual quaterninons and plucker coordinates

Solution of inverse kinematic problem for serial robot using dual quaterninons and plucker coordinates University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2009 Solution of inverse kinematic problem for

More information

Written exams of Robotics 2

Written exams of Robotics 2 Written exams of Robotics 2 http://www.diag.uniroma1.it/~deluca/rob2_en.html All materials are in English, unless indicated (oldies are in Year Date (mm.dd) Number of exercises Topics 2018 07.11 4 Inertia

More information

ME5286 Robotics Spring 2015 Quiz 1

ME5286 Robotics Spring 2015 Quiz 1 Page 1 of 7 ME5286 Robotics Spring 2015 Quiz 1 Total Points: 30 You are responsible for following these instructions. Please take a minute and read them completely. 1. Put your name on this page, any other

More information

8.6 Three-Dimensional Cartesian Coordinate System

8.6 Three-Dimensional Cartesian Coordinate System SECTION 8.6 Three-Dimensional Cartesian Coordinate Sstem 69 What ou ll learn about Three-Dimensional Cartesian Coordinates Distance and Midpoint Formulas Equation of a Sphere Planes and Other Surfaces

More information

Graphs, Linear Equations, and Functions

Graphs, Linear Equations, and Functions Graphs, Linear Equations, and Functions. The Rectangular R. Coordinate Fractions Sstem bjectives. Interpret a line graph.. Plot ordered pairs.. Find ordered pairs that satisf a given equation. 4. Graph

More information

HFAN Rev.1; 04/08

HFAN Rev.1; 04/08 pplication Note: HFN-0.0. Rev.; 04/08 Laser Diode to Single-Mode Fiber Coupling Efficienc: Part - Butt Coupling VILBLE Laser Diode to Single-Mode Fiber Coupling Efficienc: Part - Butt Coupling Introduction

More information

Applying Neural Network Architecture for Inverse Kinematics Problem in Robotics

Applying Neural Network Architecture for Inverse Kinematics Problem in Robotics J. Software Engineering & Applications, 2010, 3: 230-239 doi:10.4236/jsea.2010.33028 Published Online March 2010 (http://www.scirp.org/journal/jsea) Applying Neural Network Architecture for Inverse Kinematics

More information

0 COORDINATE GEOMETRY

0 COORDINATE GEOMETRY 0 COORDINATE GEOMETRY Coordinate Geometr 0-1 Equations of Lines 0- Parallel and Perpendicular Lines 0- Intersecting Lines 0- Midpoints, Distance Formula, Segment Lengths 0- Equations of Circles 0-6 Problem

More information

ACTIVITY 9 Continued Lesson 9-2

ACTIVITY 9 Continued Lesson 9-2 Continued Lesson 9- Lesson 9- PLAN Pacing: 1 class period Chunking the Lesson Eample A Eample B #1 #3 Lesson Practice M Notes Learning Targets: Graph on a coordinate plane the solutions of a linear inequalit

More information

1. Introduction 1 2. Mathematical Representation of Robots

1. Introduction 1 2. Mathematical Representation of Robots 1. Introduction 1 1.1 Introduction 1 1.2 Brief History 1 1.3 Types of Robots 7 1.4 Technology of Robots 9 1.5 Basic Principles in Robotics 12 1.6 Notation 15 1.7 Symbolic Computation and Numerical Analysis

More information

Grid and Mesh Generation. Introduction to its Concepts and Methods

Grid and Mesh Generation. Introduction to its Concepts and Methods Grid and Mesh Generation Introduction to its Concepts and Methods Elements in a CFD software sstem Introduction What is a grid? The arrangement of the discrete points throughout the flow field is simpl

More information

Inverse Kinematics of 6 DOF Serial Manipulator. Robotics. Inverse Kinematics of 6 DOF Serial Manipulator

Inverse Kinematics of 6 DOF Serial Manipulator. Robotics. Inverse Kinematics of 6 DOF Serial Manipulator Inverse Kinematics of 6 DOF Serial Manipulator Robotics Inverse Kinematics of 6 DOF Serial Manipulator Vladimír Smutný Center for Machine Perception Czech Institute for Informatics, Robotics, and Cybernetics

More information

On the Kinematics of Undulator Girder Motion

On the Kinematics of Undulator Girder Motion LCLS-TN-09-02 On the Kinematics of Undulator Girder Motion J. Welch March 23, 2010 The theor of rigid bod kinematics is used to derive equations that govern the control and measurement of the position

More information

Towards a unified measurement of quality for mixed elements

Towards a unified measurement of quality for mixed elements Towards a unified measurement of qualit for mixed elements technical report n 015/01, di utfsm Claudio Lobos Departmento de Informática Universidad Técnica Federico Santa María Santiago, Chile clobos@inf.utfsm.cl

More information

Contents. How You May Use This Resource Guide

Contents. How You May Use This Resource Guide Contents How You Ma Use This Resource Guide ii 0 Trigonometric Formulas, Identities, and Equations Worksheet 0.: Graphical Analsis of Trig Identities.............. Worksheet 0.: Verifing Trigonometric

More information

LINEAR PROGRAMMING. Straight line graphs LESSON

LINEAR PROGRAMMING. Straight line graphs LESSON LINEAR PROGRAMMING Traditionall we appl our knowledge of Linear Programming to help us solve real world problems (which is referred to as modelling). Linear Programming is often linked to the field of

More information

Think About. Unit 5 Lesson 3. Investigation. This Situation. Name: a Where do you think the origin of a coordinate system was placed in creating this

Think About. Unit 5 Lesson 3. Investigation. This Situation. Name: a Where do you think the origin of a coordinate system was placed in creating this Think About This Situation Unit 5 Lesson 3 Investigation 1 Name: Eamine how the sequence of images changes from frame to frame. a Where do ou think the origin of a coordinate sstem was placed in creating

More information

A Comparative Study of Prediction of Inverse Kinematics Solution of 2-DOF, 3-DOF and 5-DOF Redundant Manipulators by ANFIS

A Comparative Study of Prediction of Inverse Kinematics Solution of 2-DOF, 3-DOF and 5-DOF Redundant Manipulators by ANFIS IJCS International Journal of Computer Science and etwork, Volume 3, Issue 5, October 2014 ISS (Online) : 2277-5420 www.ijcs.org 304 A Comparative Study of Prediction of Inverse Kinematics Solution of

More information

Singularities of a Manipulator with Offset Wrist

Singularities of a Manipulator with Offset Wrist Singularities of a Manipulator with Offset Wrist Robert L. Williams II Department of Mechanical Engineering Ohio University Athens, Ohio Journal of Mechanical Design Vol. 11, No., pp. 315-319 June, 1999

More information

Multibody Motion Estimation and Segmentation from Multiple Central Panoramic Views

Multibody Motion Estimation and Segmentation from Multiple Central Panoramic Views Multibod Motion Estimation and Segmentation from Multiple Central Panoramic Views Omid Shakernia René Vidal Shankar Sastr Department of Electrical Engineering & Computer Sciences Universit of California

More information

Polynomial and Rational Functions

Polynomial and Rational Functions Polnomial and Rational Functions Figure -mm film, once the standard for capturing photographic images, has been made largel obsolete b digital photograph. (credit film : modification of work b Horia Varlan;

More information

9. p(x) = x 3 8x 2 5x p(x) = x 3 + 3x 2 33x p(x) = x x p(x) = x 3 + 5x x p(x) = x 4 50x

9. p(x) = x 3 8x 2 5x p(x) = x 3 + 3x 2 33x p(x) = x x p(x) = x 3 + 5x x p(x) = x 4 50x Section 6.3 Etrema and Models 593 6.3 Eercises In Eercises 1-8, perform each of the following tasks for the given polnomial. i. Without the aid of a calculator, use an algebraic technique to identif the

More information