Search NASA⌕ Search

SEARCH · Search NASA

Results for “adaptive discretization”

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.

At least 19 records

Reduction in redundancy of multichannel telemetric information by the method of adaptive discretization with associative sorting

The method of adaptive discretization is the most promising for elimination of redundancy from telemetry messages characterized by signal shape. Adaptive discretization with associative sorting was considered as a way to avoid the shortcomings of adaptive discretization with buffer smoothing and adaptive discretization with logical switching in on-board information compression devices (OICD) in spacecraft. Mathematical investigations of OICD are presented.

Kantor, A. V.↗

Error analysis for a reduced-order discrete adaptive observer

The Kreisselmeier discrete adaptive observer is analyzed for the case in which the observer order is less than that of the plant. The state and parameter estimates from the observer are compared to the states and parameters for an arbitrary reduced-order model (ROM) of the plant, where the observer and ROM are of equal dimension. Conditions sufficient for ultimate boundedness of the observation errors are given, and expressions for the error bounds are derived.

Lilly, J. H.↗

Comparison of continuous and discrete adaptive identification algorithms

Discretization of a popular continuous-time control algorithm is effected and an equivalent discrete-time identification law developed and compared to a published discrete identification algorithm developed from Lyapunov Theory. Results are compared as regards asymptotic stability as insured using Lyapunov theory. Some analysis and design guidelines are proposed as regards implementation and practical utility.

Colburn, B. K.↗

The question of the possibility of using Associative Computer Devices (ACD) for parallel adaptive discretization of multichannel telemetry information

The method of parallel adaptive discretization of data is considered the most promising and allows the effective compression algorithms to be used for high information-capacity radio telemetry systems. An associative computer device (ACD), i.e., parallel computers based on associative memory units (AMU), are recommended for realization of this method. A detailed discussion of the problems of application of AMU is followed by description of a particular ACD and its recommended use.

Kantor, A. V.↗

Digital computer modeling of the process of reduction of redundancy in multichannel telemetry information by the method of adaptive discretization with associative sorting

Digital computer modeling of the process of adaptive discretization with associative sorting of actual multichannel telemetry information is discussed. The main task in modeling is production of initial data for determination of dependences describing the operation of the on-board information compression device. Conclusions are presented including the shortcomings of telemetric information used in modeling.

Tolmadzheva, T. A.↗

A discrete adaptive guidance system for a roving vehicle

An adaptive guidance technique which provides a self-correcting path following capability in an environment sensitive semi-autonomous roving robot is described. A real-time maneuver planning function performs tradeoffs between speed, magnitude of expected deviations and accelerations to best satisfy the design goals of vehicle safety and reliability, subsystem autonomy, performance accuracy and operational efficiency. The appropriate combination of maneuver parameters is selected through an iterative process using knowledge of vehicle performance characteristics, environmental model updates and vehicle state

Miller, J. A.↗

Discrete-time adaptive control of robot manipulators

A discrete-time model reference adaptive control scheme is developed for trajectory tracking of robot manipulators. Hyperstability theory is utilized to derive the adaptation laws for the controller gain matrices. It is shown that asymptotic trajectory tracking is achieved despite gross robot parameter variation and uncertainties. The method offers considerable design flexibility and enables the designer to improve the performance of the control system by adjusting free design parameters. The discrete-time adaptation algorithm is extremely simple and is therefore suitable for real-time implementation.

Tarokh, M.↗

A discrete-time adaptive control scheme for robot manipulators

A discrete-time model reference adaptive control scheme is developed for trajectory tracking of robot manipulators. The scheme utilizes feedback, feedforward, and auxiliary signals, obtained from joint angle measurement through simple expressions. Hyperstability theory is utilized to derive the adaptation laws for the controller gain matrices. It is shown that trajectory tracking is achieved despite gross robot parameter variation and uncertainties. The method offers considerable design flexibility and enables the designer to improve the performance of the control system by adjusting free design parameters. The discrete-time adaptation algorithm is extremely simple and is therefore suitable for real-time implementation. Simulations and experimental results are given to demonstrate the performance of the scheme.

Tarokh, M.↗

Inherent robustness of discrete-time adaptive control systems

Global stability robustness with respect to unmodeled dynamics, arbitrary bounded internal noise, as well as external disturbance is shown to exist for a class of discrete-time adaptive control systems when the regressor vectors of these systems are persistently exciting. Although fast adaptation is definitely undesirable, so far as attaining the greatest amount of global stability robustness is concerned, slow adaptation is shown to be not necessarily beneficial. The entire analysis in this paper holds for systems with slowly varying return difference matrices; the plants in these systems need not be slowly varying.

Ma, C. C. H.↗

Initial investigations of an adaptive discrete-time controller for nonlinear time-varying robotic models

The objective of this paper is to design a discrete-time controller which forces y(t) = F(q(t),q'(t)) to follow a desired trajectory, when non-linearities may be uncertain. A self-tuning adaptive control algorithm is then developed that addresses three types of errors: (1) error due to model linearization; (2) errors due to controlling a time-varying plant; and (3) errors due to discretization.

Giang, S. S.↗

Some design guidelines for discrete-time adaptive controllers

There have been many algorithms proposed for adaptive control which will provide globally asymptotically stable controllers if some stringent conditions on the plant are met. The conditions on the plant cannot be met in practice as all plants will contain high frequency unmolded dynamics therefore, blind implementation of the published algorithms can lead to disastrous results. This paper uses a linearization analysis of a non-linear adaptive controller to demonstrate analytically design guidelines which aleviate some of the problems associated with adaptive control in the presence of unmodeled dynamics.

Rohrs, C. E.↗

An averaging analysis of discrete-time indirect adaptive control

An averaging analysis of indirect, discrete-time, adaptive control systems is presented. The analysis results in a signal-dependent stability condition and accounts for unmodeled plant dynamics as well as exogenous disturbances. This analysis is applied to two discrete-time adaptive algorithms: an unnormalized gradient algorithm and a recursive least-squares (RLS) algorithm with resetting. Since linearization and averaging are used for the gradient analysis, a local stability result valid for small adaptation gains is found. For RLS with resetting, the assumption is that there is a long time between resets. The results for the two algorithms are virtually identical, emphasizing their similarities in adaptive control.

Phillips, Stephen M.↗

Image coding of SAR imagery

Five coding techniques in the spatial and transform domains have been evaluated for SAR image compression: linear three-point predictor (LTPP), block truncation coding (BTC), microadaptive picture sequencing (MAPS), adaptive discrete cosine transform (ADCT), and adaptive Hadamard transform (AHT). These techniques have been tested with Seasat data. Both LTPP and BTC spatial domain coding techniques provide very good performance at rates of 1-2 bits/pixel. The two transform techniques, ADCT and AHT, demonstrate the capability to compress the SAR imagery to less than 0.5 bits/pixel without visible artifacts. Tradeoffs such as the rate distortion performance, the computational complexity, the algorithm flexibility, and the controllability of compression ratios are also discussed.

Chang, C. Y.↗

Adaptive procedures in multispectral pattern recognition

Two types of discrete adaptive procedures are proposed for updating statistical parameters such as the means and covariance matrices. These two types include nonweighted adaptive procedures and weighted adaptive procedures. It is believed that the use of the proposed procedures will enhance the performance accuracy of a pattern recognition system. The procedures discussed include an approach for a weighted mean vector adaptation.

Chang, C. Y.↗

Discrete model reference adaptive control with an augmented error signal

A method for designing discrete model reference adaptive control systems when one has access to only the plant's input and output signals is given. Controllers for single-input, single-output, nonlinear, nonautonomous plants are developed via Liapunov's second method. Anticipative values of the plant output are not required, but are replaced by signals easily obtained from a low-pass filter operating on the plant's output. The augmented error signal method is employed, ensuring finally that the normally used error signal also approaches zero asymptotically.

Ionescu, T.↗

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.↗