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 novel adaptive discrete cosine transform-domain filter for gap-inpainting of high resolution PET scanners

Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗

Modification of the SAS4A Safety Analysis Code for Integration with the ADAPT Discrete Dynamic Event Tree Framework.

It is difficult to assess the consequences of a transient in a sodium-cooled fast reactor (SFR) using traditional probabilistic risk assessment (PRA) methods, as numerous safety-related sys- tems have passive characteristics. Often there is significant dependence on the value of con- tinuous stochastic parameters rather than binary success/failure determinations. One form of dynamic PRA uses a system simulator to represent the progression of a transient, tracking events through time in a discrete dynamic event tree (DDET). In order to function in a DDET environment, a simulator must have characteristics that make it amenable to changing physical parameters midway through the analysis. The SAS4A SFR system analysis code did not have these characteristics as received. This report describes the code modifications made to allow dynamic operation as well as the linking to a Sandia DDET driver code. A test case is briefly described to demonstrate the utility of the changes.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

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

A WENO-solver combined with adaptive momentum discretization for the Wigner transport equation and its application to resonant tunneling diodes

We present a novel numerical scheme for the deterministic solution of the Wigner transport equation, especially suited to deal with situations in which strong quantum effects are present. The unique feature of the algorithm is the expansion of the Wigner function in local basis functions, similar to finite element or finite volume methods. This procedure yields a discretization of the pseudo-differential operator that conserves the particle density on arbitrarily chosen grids. The high flexibility in refining the grid spacing together with the weighted essentially non-oscillatory (WENO) scheme for the advection term allows for an accurate and well-resolved simulation of the phase space dynamics. A resonant tunneling diode is considered as test case and a detailed convergence study is given by comparing the results to a non-equilibrium Green's functions calculation. The impact of the considered domain size and of the grid spacing is analyzed. The obtained convergence of the results towards a quasi-exact agreement of the steady state Wigner and Green's functions computations demonstrates the accuracy of the scheme, as well as the high flexibility to adjust to different physical situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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