An optimum decision-directed scheme for Gaussian mixtures.
Optimally weighted and moment method decision directed estimation algorithms for resolving Gaussian mixtures of signals in order to detect signals
Gregg, W. D.↗
SEARCH · Engineering Papers
Results for “optimization algorithms”
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.
A second-order variational method for discrete-time optimal control problems.
Discrete time optimal control problems solved by second order variational algorithm, developing recurrence relations for perturbation equations
Koivo, A. J.↗
Impulsive orbit transfer optimization by an accelerated gradient method.
Impulsive orbit transfer optimization using accelerated gradient program based on Newtonian algorithm for digital computer method
Johnson, I. L., Jr.↗
Rapid optimization of multiple-burn rocket flights
Shooting method for real time optimization of multiple burn rocket flights, presenting analysis, algorithm and test results
Brown, K. R.↗
Automatic equalization using the discrete frequency domain.
A new mean-square-error automatic equalizer for synchronous data transmission is developed. It utilizes Rosen's gradient-projection method to optimize parameters in the discrete frequency domain. The algorithm converges (in the mean) for any channel even in the presence of noise. It is shown that for the channels considered, convergence is faster (in a bounded sense) than for comparable time-domain equalizers.
Walzman, T.↗
Use of known landmarks for satellite navigation
The use of known landmark measurements along with an onboard attitude reference system for estimation of both the ephemeris and attitude of an earth orbiting satellite is discussed. Simulation results are presented which show that, although known landmarks alone do not provide sufficient information to bound the uncertainty in attitude and ephemeris, they are useful in combination with other navigation aids, such as star tracking, ground tracking, or satellite tracking. An extended Kalman filter is used for optimal estimation. The result of using a smoothing algorithm is also shown.
White, R. L.↗
Path selection process utilizing rapid estimation scheme
The paper describes the use of a rapid estimation scheme for path selection by a roving vehicle. Essentially, the evaluation procedure simulates movement of the rover over each of several corridors lying radially outward from the scanning position. Two levels of corridors are used, and the path selection scheme selects the optimal primary corridor according to a dynamic programming algorithm. In the present version, the length of the corridors is variable. The rapid estimation scheme provides information to define corridor dimensions. This corridor structure, which varies as a function of the terrain, eliminates the need for backtracking, except in certain extreme cases. Computer results are promising in that obstacles were avoided while corridor lengths were kept to a maximum where safety permitted.
Ring, H.↗
Inventory estimation on the massively parallel processor
This paper describes algorithms for efficiently computing inventory estimates from satellite based images. The algorithms incorporate a one dimensional feature extraction which optimizes the pairwise sum of Fisher distances. Biases are eliminated with a premultiplication by the inverse of the analytically derived error matrix. The technique is demonstrated with a numerical example using statistics obtained from an actual Landsat scene. Attention was given to implementation of the Massively Parallel processor (MPP). A timing analysis demonstrates that the inventory estimation can be performed an order of magnitude faster on the MPP than on a conventional serial machine.
Argentiero, P. D.↗
A study of interactive control scheduling and economic assessment for robotic systems
A class of interactive control systems is derived by generalizing interactive manipulator control systems. Tasks of interactive control systems can be represented as a network of a finite set of actions which have specific operational characteristics and specific resource requirements, and which are of limited duration. This has enabled the decomposition of the overall control algorithm simultaneously and asynchronously. The performance benefits of sensor referenced and computer-aided control of manipulators in a complex environment is evaluated. The first phase of the CURV arm control system software development and the basic features of the control algorithms and their software implementation are presented. An optimal solution for a production scheduling problem that will be easy to implement in practical situations is investigated.
Source record↗
Antenna pointing of large flexible telecommunications spacecraft
Attitude control problems for large flexible telecommunications spacecraft were investigated. A typical S/C configuration is described and modeled by modal data derived from a finite element analysis. The effect of structural flexibility on radio-frequency sensor is analyzed. Model reduction using modal gain considerations is applied. Two control concepts are investigated: separate central body and antenna pointing control using direct feedback laws, centralized control using modal observer and optimal control. Performances of each concept and the algorithm implementation are assessed.
Govin, B.↗
Two-time scale stabilization of a flexible arm with output feedback
An approach is presented to designing a control system with output feedback for a lightweight flexible arm. A two-time-scale dynamic model is obtained which allows the adoption of a composite control strategy. First a slow control can be designed for the slow (rigid) subsystem, and then a fast stabilizing control for the fast (flexible) subsystem. The problem of the lack of full state measurements connected with the fast control design is solved. An output-feedback, low-order dynamic compensator whose optimal gains are computed by a convergent numerical algorithm is designed. A more robust design can be achieved if a loop transfer recovery procedure is introduced. The design procedure is tested by means of nonlinear simulation, and the results are discussed.
Siciliano, Bruno↗
Advances and trends in computational structures technology
The major goals of computational structures technology (CST) are outlined, and recent advances in CST are examined. These include computational material modeling, stochastic-based modeling, computational methods for articulated structural dynamics, strategies and numerical algorithms for new computing systems, multidisciplinary analysis and optimization. The role of CST in the future development of structures technology and the multidisciplinary design of future flight vehicles is addressed, and the future directions of CST research in the prediction of failures of structural components, the solution of large-scale structural problems, and quality assessment and control of numerical simulations are discussed.
Noor, A. K.↗
Progress Toward an Efficient and General CFD Tool for Propulsion Design/Analysis
The simulation of propulsive flows inherently involves chemical activity. Recent years have seen substantial strides made in the development of numerical schemes for reacting flowfields, in particular those involving finite-rate chemistry. However, finite-rate calculations are computationally intensive and require knowledge of the actual kinetics, which are not always known with sufficient accuracy. Alternatively, flow simulations based on the assumption of local chemical equilibrium are capable of obtaining physically reasonable results at far less computational cost. The present study summarizes the development of efficient numerical techniques for the simulation of flows in local chemical equilibrium, whereby a 'Black Box' chemical equilibrium solver is coupled to the usual gasdynamic equations. The generalization of the methods enables the modelling of any arbitrary mixture of thermally perfect gases, including air, combustion mixtures and plasmas. As demonstration of the potential of the methodologies, several solutions, involving reacting and perfect gas flows, will be presented. Included is a preliminary simulation of the SSME startup transient. Future enhancements to the proposed techniques will be discussed, including more efficient finite-rate and hybrid (partial equilibrium) schemes. The algorithms that have been developed and are being optimized provide for an efficient and general tool for the design and analysis of propulsion systems.
Cox, C. F.↗
Constraints in Genetic Programming
Genetic programming refers to a class of genetic algorithms utilizing generic representation in the form of program trees. For a particular application, one needs to provide the set of functions, whose compositions determine the space of program structures being evolved, and the set of terminals, which determine the space of specific instances of those programs. The algorithm searches the space for the best program for a given problem, applying evolutionary mechanisms borrowed from nature. Genetic algorithms have shown great capabilities in approximately solving optimization problems which could not be approximated or solved with other methods. Genetic programming extends their capabilities to deal with a broader variety of problems. However, it also extends the size of the search space, which often becomes too large to be effectively searched even by evolutionary methods. Therefore, our objective is to utilize problem constraints, if such can be identified, to restrict this space. In this publication, we propose a generic constraint specification language, powerful enough for a broad class of problem constraints. This language has two elements -- one reduces only the number of program instances, the other reduces both the space of program structures as well as their instances. With this language, we define the minimal set of complete constraints, and a set of operators guaranteeing offspring validity from valid parents. We also show that these operators are not less efficient than the standard genetic programming operators if one preprocesses the constraints - the necessary mechanisms are identified.
Janikow, Cezary Z.↗
Multivariate Error Covariance Estimates by Monte-Carlo Simulation for Assimilation Studies in the Pacific Ocean
One of the most difficult aspects of ocean state estimation is the prescription of the model forecast error covariances. The paucity of ocean observations limits our ability to estimate the covariance structures from model-observation differences. In most practical applications, simple covariances are usually prescribed. Rarely are cross-covariances between different model variables used. Here a comparison is made between a univariate Optimal Interpolation (UOI) scheme and a multivariate OI algorithm (MvOI) in the assimilation of ocean temperature. In the UOI case only temperature is updated using a Gaussian covariance function and in the MvOI salinity, zonal and meridional velocities as well as temperature, are updated using an empirically estimated multivariate covariance matrix. Earlier studies have shown that a univariate OI has a detrimental effect on the salinity and velocity fields of the model. Apparently, in a sequential framework it is important to analyze temperature and salinity together. For the MvOI an estimation of the model error statistics is made by Monte-Carlo techniques from an ensemble of model integrations. An important advantage of using an ensemble of ocean states is that it provides a natural way to estimate cross-covariances between the fields of different physical variables constituting the model state vector, at the same time incorporating the model's dynamical and thermodynamical constraints as well as the effects of physical boundaries. Only temperature observations from the Tropical Atmosphere-Ocean array have been assimilated in this study. In order to investigate the efficacy of the multivariate scheme two data assimilation experiments are validated with a large independent set of recently published subsurface observations of salinity, zonal velocity and temperature. For reference, a third control run with no data assimilation is used to check how the data assimilation affects systematic model errors. While the performance of the UOI and MvOI is similar with respect to the temperature field, the salinity and velocity fields are greatly improved when multivariate correction is used, as evident from the analyses of the rms differences of these fields and independent observations. The MvOI assimilation is found to improve upon the control run in generating the water masses with properties close to the observed, while the UOI failed to maintain the temperature and salinity structure.
Borovikov, Anna↗
A Comparison of Techniques for Scheduling Earth-Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.
Globus, Al↗
Putting Priors in Mixture Density Mercer Kernels
This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.
Srivastava, Ashok N.↗
An Ensemble Approach to Building Mercer Kernels with Prior Information
This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.
Srivastava, Ashok N.↗