Synthesizing robust mode shapes with μ and implicit model following

Control synthesis problems involving assignment of closed-loop model shapes using implicit model following (IMF) structure are considered in the context of H_2, H∞ , and μ-synthesis theories. An extension to the dynamic output feedback case is given for the quadratic or H_2 IMF problem. The IMF problem is embedded within the framework of μ control theory, and extensions for including uncertainty are discussed. A robust synthesis methodology is presented using μ theory. An application of the robust IMF synthesis methodology to modal shape assignment for the longitudinal axis of a helicopter is demonstrated

Gain-scheduling through continuation of observer-based realizations-applications to H∞ and μ controllers

The dynamic behavior of gain scheduled controllers is highly depending on the state-space representations adopted for the family of lienar controllers designed on a set of operating conditions. In this paper, a technique for determining a set of consistent and physically motivated linear state-space transformations to be applied to the original set of linear controllers is proposed. After transformation, these controllers exhibits an-observer-based structure are therefore easily interpolted and implemented

CSI technology validation on an LSS ground experiment facility

The test bed developed at JPL for experimental evaluation of new technologies for the control of large flexible space structures is described. The experiment consists of a flexible spacecraft dynamic simulator, sensors, actuators, a microcomputer, and an advanced programming environment. The test bed has been operational for over a year, and thus far nine experiments were completed or are currently in progress. Several of these experiments were reported at the 1987 CSI conference, and several recent ones are documented in this paper, including high order adaptive control, non-parametric system identification, and mu-synthesis robust control. An aggressive program of experiments is planned for the forseeable future

Properties of the mixed μ problem and its bounds

Upper and lower bounds for the mixed μ problem have recently been developed, and here we examine the relationship of these bounds to each other and to μ. A number of interesting properties are developed and the implications of these properties for the robustness analysis of linear systems and the development of practical computation schemes are discussed. In particular we find that current techniques can only guarantee easy computation for large problems when μ equals its upper bound, and computational complexity results prohibit this possibility for general problems. In this context we present some special cases where computation is easy and make some direct comparisons between mixed μ and “Kharitonov-type” analysis methods