SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
This tutorial paper reviews some of the advantages and disadvantages of a discrete time representation of a signal. Also reviewed are some of the recent theoretical advances in digital signal processing which can be implemented by the use of charge transfer signal processing devices. In particular, the design and implementation of transversal filters and spectrum analyzers will be discussed.
The problem of maneuvering large space structures is formulated as a discrete-time, finite-duration optimal regulator problem. Two methods are considered for minimizing the elastic motion during the maneuver. The methods are applied to retargetting maneuver of a large space antenna, and the results are compared with those obtained using bang-bang control. The optimal regulator designed using the model error sensitivity supression method gives the best performance.
The paper is concerned with the discrete-time H(sub infinity) control problem with measurement feedback. The authors extend previous results by having weaker assumptions on the system parameters. The authors also show explicitly the structure of H(sub infinity) controllers. Finally, they show that it is in certain cases possible, without loss of performance, to reduce the dynamical order of the controllers.
The behavior of a general hybrid system in discrete-time can be represented by a non-linear difference equation x(k + 1) = Fk(x(k), theta(k)), where theta(k) is assumed to be a finite-state Markov chain. An important step in the stability analysis of these systems is to establish the Markov property of (x(k), theta(k)). There are, however, no complete proofs of this property which are simple to understand. This paper aims to correct this problem by presenting a complete and explicit proof, which uses only fundamental measure-theoretical concepts.
Differential dynamic programming algorithm for discrete time orbit transfer optimization
A suboptimal dynamic compensator to be used in conjunction with the ordinary discrete time Kalman filter was derived. The resultant compensated Kalman Filter has the property that steady state bias estimation errors, resulting from modelling errors, were eliminated.
Using discrete time state variable representation, a generalized computer-aided modeling and analysis of dc-dc converters is presented. The methodology provides exact modeling and is applicable to all types of power stages and duty-cycle control, including continuous and discontinuous inductor current operation. Converter stability, transient behavior and audio susceptibility can be analytically evaluated and predicted. The generalized theory of the proposed approach to converter modeling and analysis is presented first, followed by a demonstrative example applying the theory to a constant frequency buck converter operating in continuous and discontinuous inductor current mode. Excellent agreement with laboratory test data has been observed.
A suboptimal dynamic compensator to be used in conjunction with the ordinary discrete-time Kalman filter is derived. The resultant compensated Kalman filter has the property that steady-state bias estimation errors, resulting from modelling errors, are eliminated. The implementation of the compensated Kalman filter involves the use of accumulators in the residual channels in addition to the nominal dynamic model of the stochastic system.
Some of the problems are discussed which are encountered in the design of discrete-time stochastic controllers for problems that may adequately be described by the Linear Quadratic Gaussian (LQG) assumptions; namely, the problems of obtaining acceptable relative stability, robustness, and disturbance rejection properties. A dynamic compensator is proposed to replace the optimal full state feedback regulator gains at steady state, provided that all states are measurable. The compensator increases the stability margins at the plant input, which may possibly be inadequate in practical applications. Though the optimal regulator has desirable properties the observer based controller as implemented with a Kalman filter, in a noisy environment, has inadequate stability margins. The proposed compensator is designed to match the return difference matrix at the plant input to that of the optimal regulator while maintaining the optimality of the state estimates as directed by the measurement noise characteristics.
This paper is concerned with the optimal control of discrete-time linear systems that possess randomly jumping parameters described by finite-state Markov processes. For problems having quadratic costs and perfect observations, the optimal control laws and expected costs-to-go can be precomputed from a set of coupled Riccati-like matrix difference equations. Necessary and sufficient conditions are derived for the existence of optimal constant control laws which stabilize the controlled system as the time horizon becomes infinite, with finite optimal expected cost.
The design of an Evolvable Machine VHDL Core is presented, representing a discrete-time processing structure capable of supporting control system applications. This VHDL Core is implemented in an FPGA and is interfaced with an evolutionary algorithm implemented in firmware on a Digital Signal Processor (DSP) to create an evolvable system platform. The salient features of this architecture are presented. The capability to implement IIR filter structures is presented along with the results of the intrinsic evolution of a filter. The robustness of the evolved filter design is tested and its unique characteristics are described.
Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed. The appropriate Cramer-Rao bounds and maximum-likelihood (ML) estimation algorithms are derived. Some properties of the ML estimators are proved. The relationship of ML estimation to the discrete Fourier transform is exploited to obtain practial algorithms. The threshold effect of one algorithm is analyzed and compared to simulation results. Other simulation results verify other aspects of the analysis.
Optimum estimates of nonobservable random variables or random processes which influence the rate functions of a discrete time jump process (DTJP) are obtained. The approach is based on the a posteriori probability of a nonobservable event expressed in terms of the a priori probability of that event and of the sample function probability of the DTJP. A general representation for optimum estimates and recursive equations for minimum mean squared error (MMSE) estimates are obtained. MMSE estimates are nonlinear functions of the observations. The problem of estimating the rate of a DTJP when the rate is a random variable with a probability density function of the form cx super K (l-x) super m and show that the MMSE estimates are linear in this case. This class of density functions explains why there are insignificant differences between optimum unconstrained and linear MMSE estimates in a variety of problems.
Optimum estimates of nonobservable random variables or random processes which influence the rate functions of a discrete time jump process (DTJP) are derived. The approach used is based on the a posteriori probability of a nonobservable event expressed in terms of the a priori probability of that event and of the sample function probability of the DTJP. Thus a general representation is obtained for optimum estimates, and recursive equations are derived for minimum mean-squared error (MMSE) estimates. In general, MMSE estimates are nonlinear functions of the observations. The problem is considered of estimating the rate of a DTJP when the rate is a random variable with a beta probability density function and the jump amplitudes are binomially distributed. It is shown that the MMSE estimates are linear. The class of beta density functions is rather rich and explains why there are insignificant differences between optimum unconstrained and linear MMSE estimates in a variety of problems.
A complete analysis of loop transfer recovery (LTR) for general nonstrictly proper, not necessarily minimum phase discrete time systems is presented. Three different observer-based controllers, namely, `prediction estimator' and full or reduced-order type `current estimator' based controllers, are used. The analysis corresponding to all these three controllers is unified into a single mathematical framework. The LTR analysis given here focuses on three fundamental issues: (1) the recoverability of a target loop when it is arbitrarily given, (2) the recoverability of a target loop while taking into account its specific characteristics, and (3) the establishment of necessary and sufficient conditions on the given system so that it has at least one recoverable target loop transfer function or sensitivity function. Various differences that arise in LTR analysis of continuous and discrete systems are pointed out.
This paper presents a decentralized observer with a consensus filter for the state observation of a discrete-time linear distributed systems. In this setup, each agent in the distributed system has an observer with a model of the plant that utilizes the set of locally available measurements, which may not make the full plant state detectable. This lack of detectability is overcome by utilizing a consensus filter that blends the state estimate of each agent with its neighbors' estimates. We assume that the communication graph is connected for all times as well as the sensing graph. It is proven that the state estimates of the proposed observer asymptotically converge to the actual plant states under arbitrarily changing, but connected, communication and sensing topologies. As a byproduct of this research, we also obtained a result on the location of eigenvalues, the spectrum, of the Laplacian for a family of graphs with self-loops.
Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.
An abstract approximation and convergence theory for the closed-loop solution of discrete-time linear-quadratic regulator problems for parabolic systems with unbounded input is developed. Under relatively mild stabilizability and detectability assumptions, functional analytic, operator techniques are used to demonstrate the norm convergence of Galerkin-based approximations to the optimal feedback control gains. The application of the general theory to a class of abstract boundary control systems is considered. Two examples, one involving the Neumann boundary control of a one-dimensional heat equation, and the other, the vibration control of a cantilevered viscoelastic beam via shear input at the free end, are discussed.