FREQ: A computational package for multivariable system loop-shaping procedures

Many approaches in the field of linear, multivariable time-invariant systems analysis and controller synthesis employ loop-sharing procedures wherein design parameters are chosen to shape frequency-response singular value plots of selected transfer matrices. A software package, FREQ, is documented for computing within on unified framework many of the most used multivariable transfer matrices for both continuous and discrete systems. The matrices are evaluated at user-selected frequency-response values, and singular values against frequency. Example computations are presented to demonstrate the use of the FREQ code

Tradeoff methods in multiobjective insensitive design of airplane control systems

The latest results of an ongoing study of computer-aided design of airplane control systems are given. Constrained minimization algorithms are used, with the design objectives in the constraint vector. The concept of Pareto optimiality is briefly reviewed. It is shown how an experienced designer can use it to find designs which are well-balanced in all objectives. Then the problem of finding designs which are insensitive to uncertainty in system parameters are discussed, introducing a probabilistic vector definition of sensitivity which is consistent with the deterministic Pareto optimal problem. Insensitivity is important in any practical design, but it is particularly important in the design of feedback control systems, since it is considered to be the most important distinctive property of feedback control. Methods of tradeoff between deterministic and stochastic-insensitive (SI) design are described, and tradeoff design results are presented for the example of the a Shuttle lateral stability augmentation system. This example is used because careful studies have been made of the uncertainty in Shuttle aerodynamics. Finally, since accurate statistics of uncertain parameters are usually not available, the effects of crude statistical models on SI designs are examined

Control/structures interaction study of two 300 KW dual-keel space station concepts

The results of an investigation of the influence of structural stiffness of the space station framework on the controllability of two 300 kw class, solar dynamic powered, dual-keel space station designs are presented. The two design concepts differed only in the truss bay dimensions of the structural framework of the stations. Two control studies were made: (1) A study of the interaction of the framework structural response with the reaction control system used for attitude control during an orbital reboost maneuver; and (2) A study of the stability of the space station attitude control system with sensors influenced by the elastic deformations of the station framework. Although both configurations had acceptable control characteristics, the configuration with the larger truss bay dimension and its increased structural stiffness had more attractive characteristics for pointing control of the solar dynamic system during reboost and for attitude control during normal in-orbit operations

Comparison of the Present and Past Bryophyte Flora of Cedar Bog

Author Institution: Department of Botany, The Ohio State Universit

An Observation on the Protoplasmic Connections Through Sieve Plates

Author Institution: Department of Botany and Plant Pathology, The Ohio State University, Columbus 10wo electron micrographs of paradermal sections of veins of the leaves of Beta vulgaris are presented. The micrographs show the endoplasmic reticulum from one sieve cell passing through the sieve plate and into the adjacent sieve cell. This is evidently an unusual condition in this materia

Approximation of Failure Probability Using Conditional Sampling

In analyzing systems which depend on uncertain parameters, one technique is to partition the uncertain parameter domain into a failure set and its complement, and judge the quality of the system by estimating the probability of failure. If this is done by a sampling technique such as Monte Carlo and the probability of failure is small, accurate approximation can require so many sample points that the computational expense is prohibitive. Previous work of the authors has shown how to bound the failure event by sets of such simple geometry that their probabilities can be calculated analytically. In this paper, it is shown how to make use of these failure bounding sets and conditional sampling within them to substantially reduce the computational burden of approximating failure probability. It is also shown how the use of these sampling techniques improves the confidence intervals for the failure probability estimate for a given number of sample points and how they reduce the number of sample point analyses needed to achieve a given level of confidence

Bounding the Failure Probability Range of Polynomial Systems Subject to P-box Uncertainties

This paper proposes a reliability analysis framework for systems subject to multiple design requirements that depend polynomially on the uncertainty. Uncertainty is prescribed by probability boxes, also known as p-boxes, whose distribution functions have free or fixed functional forms. An approach based on the Bernstein expansion of polynomials and optimization is proposed. In particular, we search for the elements of a multi-dimensional p-box that minimize (i.e., the best-case) and maximize (i.e., the worst-case) the probability of inner and outer bounding sets of the failure domain. This technique yields intervals that bound the range of failure probabilities. The offset between this bounding interval and the actual failure probability range can be made arbitrarily tight with additional computational effort

Uncertainty Analysis via Failure Domain Characterization: Unrestricted Requirement Functions

This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. The methods developed herein, which are based on nonlinear constrained optimization, are applicable to requirement functions whose functional dependency on the uncertainty is arbitrary and whose explicit form may even be unknown. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the assumed uncertainty model (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort