Search NASA⌕ Search

Engineering topics

Utku, S.

Publications and source records attributed to Utku, S..

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Parallel computation of geometry control in adaptive truss structures

The fast computation of geometry control in adaptive truss structures involves two distinct parts: the efficient integration of the inverse kinematic differential equations that govern the geometry control and the fast computation of the Jacobian, which appears on the right-hand-side of the inverse kinematic equations. This paper present an efficient parallel implementation of the Jacobian computation on an MIMD machine. Large speedup from the parallel implementation is obtained, which reduces the Jacobian computation to an O(M-squared/n) procedure on an n-processor machine, where M is the number of members in the adaptive truss. The parallel algorithm given here is a good candidate for on-line geometry control of adaptive structures using attached processors.

Ramesh, A. V.↗
NASA NTRS1992

On the placement of active members in adaptive truss structures for vibration control

The problem of optimal placement of active members which are used for vibration control in adaptive truss structures is investigated. The control scheme is based on the method of eigenvalue assignment as a means of shaping the transient response of the controlled adaptive structures, and the minimization of required control action is considered as the optimization criterion. To this end, a performance index which measures the control strokes of active members is formulated in an efficient way. In order to reduce the computation burden, particularly for the case where the locations of active members have to be selected from a large set of available sites, several heuristic searching schemes are proposed for obtaining the near-optimal locations. The proposed schemes significantly reduce the computational complexity of placing multiple active members to the order of that when a single active member is placed.

Lu, L.-Y.↗
NASA NTRS1992

Optimal locations of redundants for prestressing adaptive trusses with buckling considerations

This paper describes the optimal locations selection of redundant bars for prestressing a determinate truss. Two computationally simple algorithms are presented to obtain the optimal locations of the redundants. The paper then describes a procedure to prevent local buckling/rupture of individual bars of the resulting indeterminate truss and its global buckling, by introducing a positive scale parameter for the prestressing forces. The procedure is illustrated on a simple two-dimensional truss.

Jalihal, P.↗
NASA NTRS1992

Optimal actuator placement in adaptive precision trusses

Actuator placement in adaptive truss structures is to cater to two needs: displacement control of precision points and preloading the elements to overcome joint slackness. Due to technological and financial considerations, the number of actuators available is much less than the degrees of freedom of precision points to be controlled and the degree of redundancy of the structure. An approach for optimal actuator location is outlined. Test cases to demonstrate the effectiveness of the scheme are applied to the Precision Segmented Reflector Truss.

Baycan, C. M.↗
NASA NTRS1991

Real-time control of geometry and stiffness in adaptive structures

The basic theory is presented for the geometry, stiffness, and damping control of adaptive structures, with emphasis on adaptive truss structures. Necessary and sufficient conditions are given for stress-free geometry control in statically determinate and indeterminate adaptive discrete structures. Two criteria for selecting the controls are proposed, and their use in real-time control is illustrated by numerical simulation results. It is shown that the stiffness and damping control of adaptive truss structures for vibration suppression is possible by elongation and elongation rate dependent feedback forces from the active elements.

Ramesh, A. V.↗
NASA NTRS1991

A mathematical basis for the design optimization of adaptive trusses in precision control

Optimal actuator placement schemes are presently studied for cases of adaptive truss precision control and prestressing control, with a view to the maximization of actuator efficiencies. In statically indeterminate truss structures, the optimal placement criteria and techniques differ, depending on whether the primary determinate structure is known. A suboptimal actuator-placement solution to the global optimization problem which combines displacement control and prestressing control is suggested, by combining the separate displacement control and prestressing control optimization results. Attention is given to the results obtained for the illustrative case of a two-bay, three-dimensional precision truss structure.

Das, S. K.↗
NASA NTRS1991

A mathematical basis for the design and design optimization of adaptive trusses in precision control

A mathematical basis for the optimal design of adaptive trusses to be used in supporting precision equipment is provided. The general theory of adaptive structures is introduced, and the global optimization problem of placing a limited number, q, of actuators, so as to maximally achieve precision control and provide prestress, is stated. Two serialized optimization problems, namely, optimal actuator placement for prestress and optimal actuator placement for precision control, are addressed. In the case of prestressing, the computation of a 'desired' prestress is discussed, the interaction between actuators and redundants in conveying the prestress is shown in its mathematical form, and a methodology for arriving at the optimal placement of actuators and additional redundants is discussed. With regard to precision control, an optimal placement scheme (for q actuators) for maximum 'authority' over the precision points is suggested. The results of the two serialized optimization problems are combined to give a suboptimal solution to the global optimization problem. A method for improving this suboptimal actuator placement scheme by iteration is presented.

Das, S. K.↗
NASA NTRS1990

Inverse dynamics of adaptive space cranes with tip point adjustment

The 'space crane', which resembles a conventional solid-link robot but employs truss sections in place of links and length-adjustable bars in place of torque-generating motors, is presently characterized by means of two different inverse-dynamics schemes. While in the first of these the nominal angles are maintained between the links constituting the crane, the second scheme adjusts the nominal angles as a function of time in order to always maintain the tip of the crane along the desired (nomical) trajectory. Attention is given to the second scheme, and to a tip-adjustment method which keeps the high frequency flexibility vibration within limits and ensures numerical stability.

Das, S. K.↗
NASA NTRS1990

Location selection for vibration controllers in space crane as adaptive structures

It is assumed that the space crane is vibrating about a known configuration which is reached at the end of some maneuver. For this configuration, r actuator locations are to be determined in order to control the first q of the structural vibration modes of the system optimizing the energy dissipation rate. A modified version of the control stratagem of Chang (1980) is applied using the structural modes of the uncontrolled crane, followed by algorithms for the actuator placement problem.

Lu, L. Y.↗
NASA NTRS1990

Inverse dynamics of adaptive structures used as space cranes

As a precursor to the real-time control of fast moving adaptive structures used as space cranes, a formulation is given for the flexibility induced motion relative to the nominal motion (i.e., the motion that assumes no flexibility) and for obtaining the open loop time varying driving forces. An algorithm is proposed for the computation of the relative motion and driving forces. The governing equations are given in matrix form with explicit functional dependencies. A simulator is developed to implement the algorithm on a digital computer. In the formulations, the distributed mass of the crane is lumped by two schemes, vz., 'trapezoidal' lumping and 'Simpson's rule' lumping. The effects of the mass lumping schemes are shown by simulator runs.

Das, S. K.↗
NASA NTRS1990

Use of reduced basis technique in the inverse dynamics of large space cranes

The inverse dynamics of adaptive structures used as space cranes can prove computationally expensive in the case of large structures, due to the large number of degrees of freedom involved. Consequently, reduced basis techniques (reduction techniques) are frequently used to reduce the problem size to a time manageable level (for possible use in real time control). A reduced basis technique is proposed which is different from, but related to, the path-derivatives reduction technique. A linearly independent set of deflection n-tuples is used, chosen at the beginning of the time range in which it is wished to reduce the equations, in whose subspace it is assumed that the deflection vectors of the unreduced problem will lie (approximately).

Das, S. K.↗
NASA NTRS1990

Geometry control in adaptive truss structures

Forward and inverse kinematics equations are derived for the large geometry maneuver of adaptive trusses. A new algorithm based on higher-order multistep methods is proposed as a means of computing the length control for a described large geometry maneuver. The algorithm is shown to improve in computational speed at least five times over the algorithm presented in an earlier paper. The acceleration in control computation and other features such as varying velocity profiles and curved trajectories are illustrated by simulation results.

Ramesh, A. V.↗
NASA NTRS1989

Control of a slow moving space crane as an adaptive structure

Assuming that the space crane is an adaptive structure with length-adjustable bars and taking as controls the length-adjustments of these bars, the computation of the incremental controls corresponding to the motion of a payload along its minimum-energy trajectory is given in terms of the inverse-transpose of matrix B of the joint equilibrium equations Bs = p, where s lists the bar forces and p lists the nodal loads. The compensation of the controls for elastic deformations and support movements are shown. It is also shown that the computations may be done automatically and in real time by an attached processor once the characteristics of the crane's maneuver are keyed in.

Utku, S.↗
NASA NTRS1989

Effect of imperfections on static control of adaptive structures as a space crane

Effect of imperfections in the joints of an adaptive structure on its slow (no inertia forces) motion along a prescribed trajectory as a space crane is studied. Two mathematical models to predict the effect of joint imperfections are proposed. The two models are used to obtain estimates of the deviations of the node of the space crane to which the end-effector is attached, from its prescribed trajectory. An application of the models to a two-section space crane is given.

Ramesh, A. V.↗
NASA NTRS1988

A parallel householder tridiagonalization stratagem using scattered row decomposition

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term 'Scattered Row Decomposition'. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.

Chang, H. Y.↗
NASA NTRS1988

A parallel Householder tridiagonalization stratagem using scattered square decomposition

The parallel stratagem in this paper uses scattered square decomposition, introduced by Fox (1985), for its data assignment and then exploits parallelism in the solution steps of the sequential Householder tridiagonalization algorithm. One may condense a real symmetric full matrix A of order n into a tridiagonal form by the stratagem in concurrent machines where N(=D-squared) processors are used. Expressions for efficiency and speedup are given for the evaluation of the stratagem. An alternative stratagem which requires less data transmission but more computations is also discussed. The results shown that the Householder method of tridiagonalization may be implemented on a concurrent machine efficiently by scattered square decomposition provided that the number of matrix elements contained in each processor is much larger than the number of processors of the concurrent machine, and the ratio of the time to transmit one data item from one processor to any other processor to the time to perform a floating-point arithmetic operation is small enough.

Chang, H. Y.↗
NASA NTRS1988

Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors

Symmetric tridiagonal eigenvalue problems may arise indirectly in structural dynamic analysis. An algorithm for eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors to meet the challenge of the new emerging computer hardware technology is presented. A standard bisection method in conjunction with Sylvester's Theorem is chosen to be converted into a parallel N-section algorithm. This parallel algorithm takes advantage of the multi-processor environment by carrying out N (number of processors) triangular factorizations of chosen shifted matrices in all processors concurrently and by minimizing communication between processors. The algorithm is designed for local-memory concurrent processors, i.e. message passing type processors. The efficiency and speed-up are given in terms of problem and machine parameters. The algorithm is very efficient when both the number of processors and the number of eigenvalues to be extracted are much smaller than the order of the tridiagonal matrix.

Chang, H. Y.↗