An algorithm for real-time computer control of a tracking system with a nonlinearity
Real time computer algorithm for achieving optimal position of tracking antenna with nonlinear control system
SEARCH · Search NASA
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.
Real time computer algorithm for achieving optimal position of tracking antenna with nonlinear control system
The generation and dissemination of International Atomic Time (TAI), and Coordinated Universal Time (UTC) are explicitly mentioned in the list of principal tasks of the Bureau International des Poids et Mesures (BIPM), that appears in the Compes Rendus of the the 18e Conference Generales des Poids et Measures, in 1987. These time scales are used as the ultimate reference in the most demanding scientific applications and must, therefore, be of the best metrological quality in terms of reliability, long term stability, and conformity of the scale interval with the second, the unit of time of the International System of Units. To meet these requirements, it is necessary that the readings of the atomic clocks, spread all over the world, that are used as basic timing data for TAI and UTC generation, must be combined in the most efficient way possible. In particular, to take full advantage of the quality of each contributing clock calls for observation of its performance over a sufficiently long time. At present, the computation period treats data in blocks covering two months. TAI and UTC are thus deferred-time scales that cannot be immediately available to real-time users. The BIPM can, nevertheless be of help to real-time users. The predictability of UTC is a fundamental attribute of the scale for institutions responsible for the dissemination of real-time time scales. It allows them to improve their local representations of UTC and, thus, implement a more thorough steering of the time scales diffused in real-time. With a view to improving the predicatbility of UTC, the BIPM examines in detail timing techniques and basic theories in order to propose alternative solutions for timing algorithms. This, coupled with a recent improvement of timing data, makes UTC more stable and thus, more predictable. At a more practical level, effort is being devoted to putting in place automatic procedures for reducing the time needed for data collection and treatment: monthly results are already available ten days earlier than before.
In this research, three variations of time shift detection algorithms were tested for their ability to detect time shift issues (including daylight savings time and random time shifts) in measured PV data sets. Two algorithms from the Python PVAnalytics package were assessed, and one algorithm from the Solar-Data-Tools package was assessed. Each algorithm's ability to accurately detect and measure time shifts was assessed.
There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
With the rapid evolution of synchrotron x-ray sources, the demand for high-quality precision x-ray mirrors has greatly increased. Single nanometer shape accuracy is required to keep imaging capabilities at the diffraction limit. Ion beam figuring (IBF) has been used frequently for ultra-precision finishing of mirrors, but achieving the ultimate accuracy depends on three important points: careful alignment, accurate dwell time calculation and implementation, and accurate optical metrology. The Optical Metrology Group at National Synchrotron Light Source II has designed and built a position–velocity–time-modulated two-dimensional IBF system (PVT-IBF) with three novel characteristics: (1) a beam footprint on the mirror was used as a reference to align the coordinate systems between the metrology and the IBF hardware; (2) the robust iterative Fourier transform-based dwell time algorithm proposed by our group was applied to obtain an accurate dwell time map; and (3) the dwell time was then transformed to velocities and implemented with the PVT motion scheme. In this study, the technical aspects of the PVT-IBF systems are described in detail, followed by an experimental demonstration of the figuring results. In our first experiment, the 2D RMS in a 50mm×5mm clear aperture was reduced from 3.4 to 1.1 nm after one IBF run. In our second experiment, due to a 5 mm pinhole installed in front of the source, the 2D RMS in a 50mm×5mm clear aperture was reduced from 39.1 to 1.9 nm after three IBF runs, demonstrating that our PVT-IBF solution is an effective and deterministic figuring process.
The present computer algorithm for the time-accurate flow analysis of rotating turbomachines is based on the finite-volume method and employs a high-resolution approximate Riemann solver for interface flux definitions and an implicit numerical scheme that possesses apparent unconditional stability. Block-block interfaces, including dynamic ones, are treated in such a way as to mimic interior block communication. The turbomachine configurations treated by way of illustration are 8-8-bladed and 11-9-bladed versions of a contrarotating unducted fan engine.
The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysics simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)
A general numerical technique for obtaining unsteady pressure measurements using conventional pressure sensing technology has been developed. A pneumatic distortion model, based on the Navier-Stokes equations of momentum and continuity, was reduced to a low-order, state-variable model retaining most of the dynamic characteristics of the full model. The reduced-order model is coupled with results from minimum variance estimation theory to develop an algorithm to compensate the effects of pneumatic distortion. Both postflight and real-time algorithms were developed and evaluated using simulated and flight data.
In recent years, a novel Parareal-based approach has been developed for fast transient simulations of large power system interconnections. Parareal belongs to the class of Parallel-in-time algorithms for solution of systems of differential-algebraic equations in parallel over an interval of time. The selection of a reasonably fast and accurate coarse solution is crucial to improve the performance of Parareal algorithm. Semi-analytical solution methods are one promising approach to achieve this goal. They have been investigated, and some preliminary results are presented here. In addition, Parareal-based simulator has been expanded to enable co-simulation with OpenDSS, a widely used open-source distribution system simulator. Preserving the parallel nature of the Parareal approach and taking advantage of the parallel capabilities of the latest versions of OpenDSS, each distribution system can be solved in their entirety on different processors in parallel within the main Parareal simulator. This paper also presents the structure of the transmission and distribution co-simulation and some results with different dynamic models of inverter-based resources in the distribution systems.
A technique of compensating for pneumatic distortion in pressure sensing devices was developed and verified. This compensation allows conventional pressure sensing technology to obtain improved unsteady pressure measurements. Pressure distortion caused by frictional attenuation and pneumatic resonance within the sensing system makes obtaining unsteady pressure measurements by conventional sensors difficult. Most distortion occurs within the pneumatic tubing which transmits pressure impulses from the aircraft's surface to the measurement transducer. To avoid pneumatic distortion, experiment designers mount the pressure sensor at the surface of the aircraft, (called in-situ mounting). In-situ transducers cannot always fit in the available space and sometimes pneumatic tubing must be run from the aircraft's surface to the pressure transducer. A technique to measure unsteady pressure data using conventional pressure sensing technology was developed. A pneumatic distortion model is reduced to a low-order, state-variable model retaining most of the dynamic characteristics of the full model. The reduced-order model is coupled with results from minimum variance estimation theory to develop an algorithm to compensate for the effects of pneumatic distortion. Both postflight and real-time algorithms are developed and evaluated using simulated and flight data.
In this paper a technique of compensating for pneumatic distortion in aircraft surface pressure sensing devices is developed. The compensation allows conventional pressure sensing technology to obtain improved unsteady pressure measurements. Pressure distortion caused by frictional attenuation and pneumatic resonance within the sensing system makes obtaining unsteady pressure measurements by conventional sensors difficult. Typically, most of the distortion occurs within the pneumatic tubing used to transmit pressure impulses from the surface of the aircraft to the measurement transducer. This paper develops a second-order distortion model that accurately describes the behavior of the primary wave harmonic of the pneumatic tubing. The model is expressed in state-variable form and is coupled with standard results from minimum-variance estimation theory to develop an algorithm to compensate for the effects of pneumatic distortion. Both postflight and real-time algorithms are developed and evaluated using simulated and flight data. Covariance selection and filter-tuning examples are presented. Results presented verify that, given appropriate covariance magnitudes, the algorithms accurately reconstruct surface pressure values from remotely sensed pressure measurements.
A time-accurate multiple-grid algorithm is described. The algorithm allows one to take much larger time steps with an explicit time-marching scheme than would otherwise be the case. Sample calculations of a scalar advection equation and the Euler equations for an oscillating airfoil are shown. For the oscillating airfoil, time steps an order of magnitude larger than the single-grid algorithm are possible.
A computer program for controlling a high-performance, force-reflecting telerobot has been developed. The goal in designing a telerobot-control system is to make the velocity of the slave match the master velocity, and the environmental force on the master match the force on the slave. Instability can arise from even small delays in propagation of signals between master and slave units. The present software, based on an impedance-shaping algorithm, ensures stability even in the presence of long delays. It implements a real-time algorithm that processes position and force measurements from the master and slave and represents the master/slave communication link as a transmission line. The algorithm also uses the history of the control force and the slave motion to estimate the impedance of the environment. The estimate of the impedance of the environment is used to shape the controlled slave impedance to match the transmission-line impedance. The estimate of the environmental impedance is used to match the master and transmission-line impedances and to estimate the slave/environment force in order to present that force immediately to the operator via the master unit.
This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.
A hierarchical real time algorithm for optimal three dimensional control of aircraft is described. Systematic methods are developed for real time computation of nonlinear feedback controls by means of singular perturbation theory. The results are applied to a six state, three control variable, point mass model of an F-4 aircraft. Nonlinear feedback laws are presented for computing the optimal control of throttle, bank angle, and angle of attack. Real Time capability is assessed on a TI 9900 microcomputer. The breakdown of the singular perturbation approximation near the terminal point is examined Continuation methods are examined to obtain exact optimal trajectories starting from the singular perturbation solutions.
An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").
We report here a real-time pulse processing algorithm for superconducting transition-edge sensor (TES) based x-ray microcalorimeters. TES-based. microca1orimeters offer ultra-high energy resolutions, but the small volume of each pixel requires that large arrays of identical microcalorimeter pixe1s be built to achieve sufficient detection efficiency. That in turn requires as much pulse processing as possible must be performed at the front end of readout electronics to avoid transferring large amounts of data to a host computer for post-processing. Therefore, a real-time pulse processing algorithm that not only can be implemented in the readout electronics but also achieve satisfactory energy resolutions is desired. We have developed an algorithm that can be easily implemented. in hardware. We then tested the algorithm offline using several data sets acquired with an 8 x 8 Goddard TES x-ray calorimeter array and 2x16 NIST time-division SQUID multiplexer. We obtained an average energy resolution of close to 3.0 eV at 6 keV for the multiplexed pixels while preserving over 99% of the events in the data sets.
Advanced Detection, Isolation, and Accommodation (ADIA) algorithm helps digital electronic multivariable-control system of advanced turbofan engine cope with failures of sensors in real time. Algorithm includes four major elements: hard-sensor-failure detection-and-isolation logic, soft-sensor-failure detection-and-isolation logic, accommodation filter, and interface switch matrix.