Observers for discrete singular systems

The author considers the design of observers for the discrete singular system Ex(k+1)=Ax(k)+Bu (k), y(k)=Cx(k), placing special emphasis on the problems of state reconstruction and minimal-time state reconstruction. It is shown that for a singular system, finite poles can be moved to infinity by state feedback and the state can be reconstructed by causal observers     

Stability of x(t)=Ax(t)+Bx(t-τ)

A stability criterion for linear time-delay systems described by a differential difference equation of the form dx(t)=Ax(t)+Bx(t -τ) is proposed. The result obtained includes information on the size of the delay and therefore can be a delay-dependent stability condition. Its relation to existing delay-independent stability criteria is also discussed     

Strict aperiodic property of polynomials with perturbedcoefficients

Let a family of polynomials be P(s)=t ₀sⁿ+t₁s ⁿ±¹ + . . . + t_n where 0<a_j⩽t_j⩽b _j. V.L. Kharitonov (1978) derived a necessary and sufficient condition for the above equation to have only zeros in the open left-half plane. The present authors derive some similar results for the equation to be strictly aperiodic (distinct real roots)     

Damping ratio of polynomials with perturbed coefficients

Let a family of polynomials be P(s)=t ₀Sⁿ+t₁s ^n-1 . . .+t_n where O<α _j⩽t_j⩽β. Recently, C.B. Soh and C.S. Berger have shown that a necessary and sufficient condition for this equation to have a damping ratio of φ is that the 2ⁿ⁺¹ polynomials in it which have t_k=α_k or t_k=β_k have a damping ratio of φ. The authors derive a more powerful result requiring only eight polynomials to be Hurwitz for the equation to have a damping ratio of φ using Kharitonov's theorem for complex polynomials     

Decomposition of 2-D linear systems into 1-D systems in thefrequency domain

A method is presented for the decomposition of the frequency domain of 2-D linear systems into two equivalent 1-D systems having dynamics in different directions and connected by a feedback system. It is shown that under some assumptions the decomposition problem can be reduced to finding a realizable solution to the matrix polynomial equation X(z₁)P(z₂ )+Q(z₁)Y(z₂ )=D(z₁, z₂). A procedure for finding a realizable solution X(z₁ ), Y(z₂) to the equation is given     

Damping margins of polynomials with perturbed coefficients

Considers the polynomial P(s)=t₀ Sⁿ+t₁ S^n-1 +···+t_n where 0<a _j⩽t_j⩽b_j. Recently, V.L. Kharitonov (1978) derived a necessary and sufficient condition for this polynomial to have only zeros in the open left-half plane. Two lemmas are derived to investigate the existence of theorems similar to the theorem of Kharitonov. Using these lemmas, the theorem of Kharitonov is generalized for P(s) to have only zeros within a sector in the complex plane. The aperiodic case is also considered     

Linear systems with state and control constraints: the theory andapplication of maximal output admissible sets

The initial state of an unforced linear system is output admissible with respect to a constraint set Y if the resulting output function satisfies the pointwise-in-time condition y(t)∈Y, t⩾0. The set of all possible such initial conditions is the maximal output admissible set O_∞. The properties of O_∞ and its characterization are investigated. In the discrete-time case, it is generally possible to represent O_∞ or a close approximation of it, by a finite number of functional inequalities. Practical algorithms for generating the functions are described. In the continuous-time case simple representations of the maximal output admissible set are not available, however, it is shown that the discrete-time results may be used to obtain approximate representations     

Shaping of the output response in a class of linear multivariablesystems

A state feedback controller is designed to regulate, as desired, the output response of minimum-phase linear multivariable square plants with CB having full rank (B: input matrix and C : output matrix). Properties of the controller are given and an example is worked out for illustration     

A note on the survival time of a dynamic system in an interval

The one-dimensional system dx(t=bu(t)dt+(ct ²)^1/2dW(t), where b (≠0) and c (⩾0) are real constants and W(t ) is a standard Brownian motion, is considered. The aim is to obtain the control u* that minimizes the expected value of a cost function with terminal cost equal to 0 or +∞ depending on whether the survival time in a given region is at least equal to or less than a fixed time     

An approach for pole assignment in singular systems

Pole assignment in a singular system Edx/dt=Ax+Bu is discussed. It is shown that the problem of assigning the roots of det(sE-(A +BF)) by applying a proportional feedback u=Fx+r in a given singular system is equivalent to the problem of pole assignment of an appropriate regular system. An immediate application of this result is that procedures and computational algorithms that were originally developed for assigning eigenvalues in regular systems become useful tools for pole assignment in singular systems. The approach provides a useful tool for the combined problem of eliminating impulsive behavior and stabilizing a singular system     

Vibrational feedback control in the problem of acoustic stability

The problem of absolute stability in a vibrational feedback controller is introduced and discussed. It is shown that for any rational G(s)=n(s)/d(s ) with d(s) Hurwitz and deg d(s) -deg n(s)=1 there exists a linear dynamic periodic controller that ensures, in a certain sense, the infinite sector of absolute stability. This implies that an additional dynamical element, inserted in the feedback loop, may lead to improvements in the robustness of nonlinear systems     

Efficient algorithms for system diagnosis with both processor andcomparator faults

For the comparison-based self-diagnosis of multiprocessor systems, an extended model that considers both processor and comparator faults is presented. It is shown that in this model the system diagnosability is t⩽Zδ/2Z, where δ is the minimum vertex degree of the system graph. However, if the number of faulty comparators is assumed not to exceed the number of faulty processors, the diagnosability of the model reaches t⩽δ. An optimal O(|E|) algorithm, where E is the set of comparators, is given for identifying all faulty processors and comparators, provided that the total number of faulty components does not exceed the system diagnosability, and an O(|E|)² algorithm for the case t⩽δ is also presented. These efficient algorithms determine the faulty processors by calculating each processor's weight, which is mainly defined by the number of adjacent relative tests stating `agreement'. After sorting the processors according to their weights, the algorithms determine all faulty components by separating the sorted processor list     

Linear periodic systems: eigenvalue assignment using discreteperiodic feedback

The eigenvalue assignment problem of a T-periodic linear system using discrete periodic state feedback gains is discussed. For controllable systems, an explicit formula for the feedback law is given that can be used for the arbitrary assignment of the eigenvalues of Φ_c1(T,0), the closed-loop state transition matrix from 0 to T. For the special case of periodic systems controllable over one period, this control law can be used to obtain any desired Φ_c1(T,0)     

Analysis of bilinear systems using Walsh functions

By using Walsh functions to analyze bilinear systems, it is shown that the nonlinear differential system equation can be converted to a linear algebraic generalized Lyapunov equation that can be solved for the coefficients of the state x(t) in terms of the Walsh basis functions. This Lyapunov equation provides an approximate closed-form solution for a bilinear system. Some guidelines are given for selecting the number of terms in the Walsh approximating series     

The stability of a family of polynomials can be deduced from afinite number 0(k3) of frequency checks

Let φ(s,a)=φ₀(s,a)+ a₁φ₁(s)+a₂ φ₂(s)+ . . .+a_kφ _k(s)=φ₀(s)-q(s, a) be a family of real polynomials in s, with coefficients that depend linearly on parameters a_i which are confined in a k-dimensional hypercube Ω_a . Let φ₀(s) be stable of degree n and the φ_i(s) polynomials (i⩾1) of degree less than n. A Nyquist argument shows that the family φ(s) is stable if and only if the complex number φ₀(jω) lies outside the set of complex points -q(jω,Ω_a) for every real ω. In a previous paper (Automat. Contr. Conf., Atlanta, GA, 1988) the authors have shown that -q(jω,Ω_a ), the so-called `-q locus', is a 2k convex parpolygon. The regularity of this figure simplifies the stability test. In the present paper they again exploit this shape and show that to test for stability only a finite number of frequency checks need to be done; this number is polynomial in k, 0(k³), and these critical frequencies correspond to the real nonnegative roots of some polynomials     

Balanced realization of stable transfer function matrices

Simple formulas are presented to compute the internally balanced minimal realization and the singular decomposition of the Hankel operator of a given continuous-time p×m stable transfer function matrix E(s)/d(s). The proposed formulas involve the Schwarz numbers of d(s) and the singular eigenvalues-eigenmatrices of a suitable finite matrix. Similar results are also obtained for a given discrete-time transfer function matrix     

Optimal distributed t-resilient election in completenetworks

The problem of distributed leader election in an asynchronous complete network, in the presence of faults that occurred prior to the execution of the election algorithm, is discussed. Failures of this type are encountered, for example, during a recovery from a crash in the network. For a network with n processors, k of which start the algorithm that uses at most O(n log k +n+kt) messages is presented and shown to be optimal. An optimal algorithm for the case where the identities of the neighbors are known is also presented. It is noted that the order of the message complexity of a t-resilient algorithm is not always higher than that of a nonresilient one. The t-resilient algorithm is a systematic modification of an existing algorithm for a fault-free network     

Geometric structure and feedback in singular systems

The output-nulling (A, E, R(B))-invariant subspaces are defined for singular systems, rigorously justifying the name and demonstrating that special cases of these geometric objects are the familiar subspace of admissible conditions and the supremal (A, E, R(B ))-invariant subspace. A novel singular-system-structure algorithm is used to compute them by numerically efficient means. Their importance for describing the possible closed-loop geometric structure in terms of the open-loop geometric structure is shown. An approach to spectrum assignment in singular systems that is based on a generalized Lyapunov equation is introduced. The equation is used to compute feedback gains to place poles and assign various closed-loop invariant subspaces while guaranteeing closed-loop regularity     

Discrete-time filtering for linear systems with non-Gaussianinitial conditions: asymptotic behavior of the difference between theMMSE and LMSE estimates

The authors consider the one-step prediction problem for discrete-time linear systems in correlated plant and observation Gaussian white noises, with nonGaussian initial conditions. They investigate the large time asymptotics of ϵ_t, the expected squared difference between the MMSE and LMSE (or Kalman) estimates of the state of time t given past observations. They characterize the limit of their error sequence {ϵ_t, t=0,1,. . .} and obtain some related rates of convergence; a complete analysis is provided for the scalar case. The discussion is based on explicit representations for the MMSE and LMSE estimates, recently obtained by the authors, which display the dependence of these quantities on the initial distribution     

Some new properties of the structured singular value

J.C. Doyle et al. (1982) have shown that a necessary and sufficient condition for robust stability or robust performance in the H^∞-frame work may be formulated as a bound on the structured singular value (μ) of a specific matrix M which includes information on the system model, the controller, the model uncertainty, and the performance specifications. Often it is desirable to express the robust stability and performance conditions as norm bounds on transfer matrices (T) which are of direct interest to the engineer, e.g. sensitivity or complementary sensitivity. The present paper shows how to derive bounds on σ(T) from bounds on μ(M)