A Newton-Euler formulation for the inverse dynamics of the Stewart platform manipulator

This paper presents an inverse dynamic formulation by the Newton–Euler approach for the Stewart platform manipulator of the most general architecture and models all the dynamic and gravity effects as well as the viscous friction at the joints. It is shown that a proper elimination procedure results in a remarkably economical and fast algorithm for the solution of actuator forces, which makes the method quite suitable for on-line control purposes. In addition, the parallelism inherent in the manipulator and in the modelling makes the algorithm quite efficient in a parallel computing environment, where it can be made as fast as the corresponding formulation for the 6-dof serial manipulator. The formulation has been implemented in a program and has been used for a few trajectories planned for a test manipulator. Results of simulation presented in the paper reveal the nature of the variation of actuator forces in the Stewart platform and justify the dynamic modelling for control.

Application of Mathematical Programming to the Plywood Design and Manufacturing Problem

Plywood manufacture includes two fundamental stages. The first is to peel or separate logs into veneer sheets of different thicknesses. The second is to assemble veneer sheets into finished plywood products. At the first stage a decision must be made as to the number of different veneer thicknesses to be peeled and what these thicknesses should be. At the second stage, choices must be made as to how these veneers will be assembled into final products to meet certain constraints while minimizing wood loss. These decisions present a fundamental management dilemma. Costs of peeling, drying, storage, handling, etc. can be reduced by decreasing the number of veneer thicknesses peeled. However, a reduced set of thickness options may make it infeasible to produce the variety of products demanded by the market or increase wood loss by requiring less efficient selection of thicknesses for assembly. In this paper the joint problem of veneer choice and plywood construction is formulated as a nonlinear integer programming problem. A relatively simple optimal solution procedure is developed that exploits special problem structure. This procedure is examined on data from a British Columbia plywood mill. Restricted to the existing set of veneer thicknesses and plywood designs used by that mill, the procedure generated a solution that reduced wood loss by 79 percent, thereby increasing net revenue by 6.86 percent. Additional experiments were performed that examined the consequences of changing the number of veneer thicknesses used. Extensions are discussed that permit the consideration of more than one wood species.

Supersymmetric Solution Of Gauge Hierarchy Problem

Some recent developments with respect to the resolution of the gauge hierarchy problem in grand unified theories by supersymmetry are presented. A general argument is developed to show how global supersymmetry maintains the stability of the different mass-scales under perturbative effects.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

On the Transform Method of Solution of an External Crack Problem

The breakdown of the usual method of Fourier transforms in the problem of an external line crack in a thin infinite elastic plate is discovered and the correct solution of this problem is derived using the concept of a generalised Fourier transform of a type discussed first by Golecki [1] in connection with Flamant's problem.

Finite element analysis of moving contact in mechanically fastened joints

The Finite Element Method (FEM) has made a number of otherwise intractable problems solvable. An important aspect for achieving an economical and accurate solution through FEM is matching the formulation and the computational organisation to the problem. This was realised forcefully in the present case of the solution of a class of moving contact boundary value problems of fastener joints. This paper deals with the problem of changing contact at the pin-hole interface of a fastener joint. Due to moving contact, the stresses and displacements are nonlinear with load. This would, in general, need an interactive-incremental approach for solution. However, by posing the problem in an inverse way, a solution is sought for obtaining loads to suit given contact configuration. Numerical results are given for typical isotropic and composite plates with rigid pins. Two cases of loading are considered: (i) load applied only at the edges of the plate and (ii) load applied at the pin and reacted at a part of the edge of the plate. Load-contact relationships, compliance and stress-patterns are investigated. This paper clearly demonstrates the simplification achieved by a suitable formulation of the problem. The results are of significance to the design and analysis of fastener joints.

Finite element analysis of moving contact in mechanically fastened joints

The Finite Element Method (FEM) has made a number of otherwise intractable problems solvable. An important aspect for achieving an economical and accurate solution through FEM is matching the formulation and the computational organisation to the problem. This was realised forcefully in the present case of the solution of a class of moving contact boundary value problems of fastener joints. This paper deals with the problem of changing contact at the pin-hole interface of a fastener joint. Due to moving contact, the stresses and displacements are nonlinear with load. This would, in general, need an interactive-incremental approach for solution. However, by posing the problem in an inverse way, a solution is sought for obtaining loads to suit given contact configuration. Numerical results are given for typical isotropic and composite plates with rigid pins. Two cases of loading are considered: (i) load applied only at the edges of the plate and (ii) load applied at the pin and reacted at a part of the edge of the plate. Load-contact relationships, compliance and stress-patterns are investigated. This paper clearly demonstrates the simplification achieved by a suitable formulation of the problem. The results are of significance to the design and analysis of fastener joints.

Realization of first order optical systems using thin lensest

A first order optical system is investigated in full generality within the context of wave optics. The problem is reduced to a study of the ray transfer matrices. The simplest such systems correspond to axially symmetric propagation. Realization of such systems by centrally located lenses separated by finite distances is studied. It is shown that, contrary to the commonly held view, the set of first order systems that can be realized using axially symmetric thin lenses exhausts the entire SL(2, R) group; at most three lenses are needed to realize any element of this group. In particular, the inverse of free propagation can be so realized. Among anisotropic systems it is again shown that every element of the lens group Sp(4, R) can be realized using a finite number of thin lenses.

On the bottleneck linear programming problem

In this paper, the results on primal methods for Bottleneck Linear Programming (BLP) problem are briefly surveyed, the primal method is presented and the degenerate case related to Bottleneck Transportation Problem (BTP) is explicitly considered. The algorithm is based on the idea of using auxiliary coefficients as is done by Garfinkel and Rao [6]. The modification presented for the BTP rectifies the defect in Hammer's method in the case of degenerate basic feasible solution. Illustrative numerical examples are also given.

Two-Impurity Kondo Problem

The two-impurity Kondo problem is studied by use of perturbative scaling techniques. The physics is determined by the interplay between the Ruderman-Kittel-Kasuya-Yosida (RKKY) interaction between the two impurity spins and the Kondo effect. In particular, for a strong ferromagnetic RKKY interaction the susceptibility exhibits three structures as the temperature is lowered, corresponding to the ferromagnetic locking together of the two impurity spins followed by a two-stage freezing out of their local moments by the conduction electrons due to the Kondo effect.

A time minimising transportation problem with quality dependent time

The usual assumption made in time minimising transportation problem is that the time for transporting a positive amount in a route is independent of the actual amount transported in that route. In this paper we make a more general and natural assumption that the time depends on the actual amount transported. We assume that the time function for each route is an increasing piecewise constant function. Four algorithms - (1) a threshold algorithm, (2) an upper bounding technique, (3) a primal dual approach, and (4) a branch and bound algorithm - are presented to solve the given problem. A method is also given to compute the minimum bottle-neck shipment corresponding to the optimal time. A numerical example is solved illustrating the algorithms presented in this paper.

On the orthogonality of suboptimum estimate in the combined estimation and control problem

By deriving the equations for an error analysis of modeling inaccuracies for the combined estimation and control problem, it is shown that the optimum estimation error is orthogonal to the actual suboptimum estimate.

Some Generalisations of the Time Minimising Assignment Problem

The time minimising assignment problem is the problem of finding an assignment of n jobs to n facilities, one to each, which minimises the total time for completing all the jobs. The usual assumption made in these problems is that all the jobs are commenced simultaneously. In this paper two generalisations of this assumption are considered, and algorithms are presented to solve these general problems. Numerical examples are worked out illustrating the algorithms.

A probabilistic approach to the problem of electron localization in disordered systems and sharpness of the mobility edge

By applying the theory of the asymptotic distribution of extremes and a certain stability criterion to the question of the domain of convergence in the probability sense, of the renormalized perturbation expansion (RPE) for the site self-energy in a cellularly disordered system, an expression has been obtained in closed form for the probability of nonconvergence of the RPE on the real-energy axis. Hence, the intrinsic mobility mu (E) as a function of the carrier energy E is deduced to be given by mu (E)= mu 0exp(-exp( mod E mod -Ec) Delta ), where Ec is a nominal 'mobility edge' and Delta is the width of the random site-energy distribution. Thus mobility falls off sharply but continuously for mod E mod >Ec, in contradistinction with the notion of an abrupt 'mobility edge' proposed by Cohen et al. and Mott. Also, the calculated electrical conductivity shows a temperature dependence in qualitative agreement with experiments on disordered semiconductors.