Principles of a General Quaternion-Operator Method of Spatial Kinematic Synthesis

1968 ◽  
Vol 35 (1) ◽  
pp. 40-46 ◽  
Author(s):  
George N. Sandor

The basic concepts of a general method of kinematic synthesis of space mechanisms are developed by means of vectors and quaternion operators applicable to path, function, and motion generation (body guidance) for finite and infinitesimal displacements (point, order, and combined point-order approximations). For writing the position equations, space mechanisms are represented by one or more loops of a general kinematic chain of ball-jointed bar-slideball members. Appropriate mathematical constraints on the relative freedom of these members render the general chain equivalent to the represented mechanism. The method leads to a system of equations of canonical simplicity, uniform for all tasks of finite spatial synthesis, often yielding closed-form linear solutions for small numbers of precision conditions. The same system of equations is then used to refine the solution for greater precision by numerical methods. Typical applications are indicated, some involving the use of a spatial finite circlepoint-center point theory, which includes classical planar Burmester theory as one of its special cases. An earlier general complex-number method of planar synthesis is shown to be a special case of the general spatial method introduced here.

1969 ◽  
Vol 91 (1) ◽  
pp. 115-121 ◽  
Author(s):  
G. N. Sandor ◽  
K. E. Bisshopp

One of the key concepts in a general method of spatial kinematic synthesis is a stretch-rotation operator applied to members of a general spatial kinematic chain. The latter consists of one or more interconnected loops of successively ball-jointed bar-slideball members. Each member is represented by a vector free to stretch-rotate with the motion of the chain. In the mathematical model of the general chain, displacement is simulated by means of stretch-rotation tensors operating on each member vector. Appropriate mathematical constraints render the general chain and its mathematical model equivalent to a particular mechanism. With this approach and by taking derivatives, first, second, and higher-order loop equations can be developed which form the basis for a general method of spatial kinematic synthesis, applicable to path, function and motion generation (body guidance) with first, second, and higher-order as well as for combined “point-order” approximations.


1964 ◽  
Vol 31 (4) ◽  
pp. 694-699 ◽  
Author(s):  
George N. Sandor

One of the basic theories of kinematic synthesis, namely, Burmester’s classical centerpoint-circlepoint theory, is shown to be one of several special cases of a broader, more general new theory, involving points of the moving plane whose several corresponding positions lie on cycloidal curves. These curves may be generated by “cycloidal cranks.” Such “cycloidpoints,” centers of their generating circles (“circlepoints”) and base circles (“centerpoints”) are proposed to be called “Burmester point trios” (BPT’s). In case of 6 prescribed arbitrary positions, such BPT’s appear to lie, respectively, on three higher plane curves proposed to be called “cycloidpoint,” “circlepoint” and “centerpoint curves,” or, collectively, “generalized Burmester curves.” In the case of hypocycloidal cranks with “Cardanic” proportions, the hypocycloids become ellipses. For 7 prescribed positions, the number of BPT’s is finite. Application to linkage synthesis for motion generation with prescribed order and timing is presented and cognate-motion generator linkages, based on multiple generation of cycloidal curves, are shown to exist. Analytical derivations are outlined for the equations of the “generalized Burmester curves,” and possible further specializations and generalizations are indicated.


2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
N. Hussain ◽  
M. A. Kutbi ◽  
P. Salimi

We first introduce certain new concepts of --proximal admissible and ---rational proximal contractions of the first and second kinds. Then we establish certain best proximity point theorems for such rational proximal contractions in metric spaces. As an application, we deduce best proximity and fixed point results in partially ordered metric spaces. The presented results generalize and improve various known results from best proximity point theory. Several interesting consequences of our obtained results are presented in the form of new fixed point theorems which contain famous Banach's contraction principle and some of its generalizations as special cases. Moreover, some examples are given to illustrate the usability of the obtained results.


Author(s):  
Badreddine Aboulissane ◽  
Dikra El Haiek ◽  
Larbi El Bakkali

The objective of kinematic synthesis is to determine the mechanism dimensions such as link lengths, positions or joint coordinates, in order to approximate its output parameters such as link positions, trajectory points, and displacement angles. Kinematic synthesis is classified into three categories: function generation, path generation, and motion generation. This paper is dedicated only to path generation. As the number of trajectory points increases, analytical methods are limited to obtain precisely mechanism solutions. In that case, numerical methods are more efficient to solve such problems. Our study proposes an improved heuristic algorithm applied to four-bar mechanism path-generation. The objective of this work is to find optimum dimensions of the mechanism and minimize the error between the generated trajectory and the desired one, taking into consideration constraints such as: Grashof condition, transmission angle, and design variables constraints. Finally, our results are compared with those found by other evolutionary algorithms in the literature.


Algorithms ◽  
2019 ◽  
Vol 12 (12) ◽  
pp. 245 ◽  
Author(s):  
Andrew J. Liounis ◽  
John A. Christian ◽  
Shane B. Robinson

Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix. While there exists extensive literature on the calculation of these derivatives, which take the form of Jacobian matrices, there are a variety of deficiencies that have yet to be addressed—including the need for both left and right eigenvectors, limitations on the matrix structure, and issues with complex eigenvalues and eigenvectors. This work addresses these deficiencies by proposing a new analytic solution for the eigenvalue and eigenvector derivatives. The resulting analytic Jacobian matrices are numerically efficient to compute and are valid for the general complex case. It is further shown that this new general result collapses to previously known relations for the special cases of real symmetric matrices and real diagonal matrices. Finally, the new Jacobian expressions are validated using forward finite differencing and performance is compared with another technique.


1986 ◽  
Vol 108 (3) ◽  
pp. 292-299 ◽  
Author(s):  
G. N. Sandor ◽  
S. P. Yang ◽  
L. J. Xu ◽  
P. De

Purely mechanical, single-actuator adaptive hard-automation modules can perform highly repetitive simple tasks much more economically, energy-efficiently and accurately than multi-degree-of-freedom, multiple-actuator robotic manipulators. As an example, an RS-SRR-SS adjustable spatial motion generator is synthesized by analytical methods with two exact prescribed positions (including orientations) for each of two different motion tasks, by numerical methods to solve a nonlinear system of equations and by optimization techniques to minimize the motion errors at additional, approximately prescribed positions.


2008 ◽  
Vol 18 (10) ◽  
pp. 3101-3111 ◽  
Author(s):  
JIANQUAN LU ◽  
DANIEL W. C. HO ◽  
JINDE CAO

A general complex dynamical network consisting of N nonlinearly coupled identical chaotic neural networks with coupling delays is firstly formulated. Many studied models with coupling systems are special cases of this model. Synchronization in such dynamical network is considered. Based on the Lyapunov–Krasovskii stability theorem, some simple controllers with updated feedback strength are introduced to make the network synchronized. The update gain γi can be properly chosen to make some important nodes synchronized quicker or slower than the rest. Two examples including nearest-neighbor coupled networks and scale-free network are given to verify the validity and effectiveness of the proposed control scheme.


Sign in / Sign up

Export Citation Format

Share Document