Search NASA⌕ Search

SEARCH · Search NASA

Results for “prediction 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.

At least 559 records · Page 31

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A real- world highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A realworld highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗

Machine-learning prediction for quasiparton distribution function matrix elements

There have been rapid developments in the direct calculation in lattice QCD (LQCD) of the Bjorken-x dependence of hadron structure through large-momentum effective theory (LaMET). LaMET overcomes the previous limitation of LQCD to moments (that is, integrals over Bjorken x) of hadron structure, allowing LQCD to directly provide the kinematic regions where the experimental values are least known. LaMET requires large-momentum hadron states to minimize its systematics and allow us to reach small- x reliably. This means that very fine lattice spacing to minimize lattice artifacts at order $(P_za)^n$ will become crucial for next-generation LaMET-like structure calculations. Furthermore, such calculations require operators with long Wilson-link displacements, especially in finer lattice units, increasing the communication costs relative to that of the propagator inversion. In this work, we explore whether machine-learning algorithms can make predictions of correlators to reduce the computational cost of these LQCD calculations. We consider two algorithms, gradient-boosting decision tree and linear models, applied to LaMET data, the matrix elements needed to determine the kaon and $η_s$ unpolarized parton distribution functions (PDFs), meson distribution amplitude (DA), and the nucleon gluon PDF. We find that both algorithms can reliably predict the target observables with different prediction accuracy and systematic errors. The predictions from smaller displacement z to larger ones work better than those for momentum p due to the higher correlation among the data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian computational approaches for gene regulation studies of bioethanol and biohydrogen production

It has recently become clear that regulatory RNAs play a major role in regulation of gene expression in bacteria. RNA secondary structures play a major role in the function of many regulatory RNAs, and structural features are often key to their interaction with other cellular components. Thus, there has been considerable interest in the prediction of the secondary structures for RNA families. A paper describing our new algorithm, RNAG, to predict consensus secondary structures for unaligned sequences using the blocked Gibbs sampler has been published[1]. This sampling algorithm iteratively samples from the conditional probability distributions: P(Structure | Alignment) and P(Alignment | Structure). Subsequent to publication of the RNAG paper we have employed the technology from RNAG in the development of an RNA motif finding algorithm. To develop and RNA motif finding algorithm, RGibbs, we capitalized on our long experience in DNA motif finding and RNA secondary structure prediction. We applied RGibbs to three data sets from the literature and compared it to existing methods: one for training and two others for tests sets. In both test sets we found RGibbs out performed existing procedures.

59 BASIC BIOLOGICAL SCIENCES↗

SU-G-JeP3-05: Geometry Based Transperineal Ultrasound Probe Positioning for Image Guided Radiotherapy

Purpose: The use of ultrasound (US) imaging in radiotherapy is not widespread, primarily due to the need for skilled operators performing the scans. Automation of probe positioning has the potential to remove this need and minimize operator dependence. We introduce an algorithm for obtaining a US probe position that allows good anatomical structure visualization based on clinical requirements. The first application is on 4D transperineal US images of prostate cancer patients. Methods: The algorithm calculates the probe position and orientation using anatomical information provided by a reference CT scan, always available in radiotherapy workflows. As initial test, we apply the algorithm on a CIRS pelvic US phantom to obtain a set of possible probe positions. Subsequently, five of these positions are randomly chosen and used to acquire actual US volumes of the phantom. Visual inspection of these volumes reveal if the whole prostate, and adjacent edges of bladder and rectum are fully visualized, as clinically required. In addition, structure positions on the acquired US volumes are compared to predictions of the algorithm. Results: All acquired volumes fulfill the clinical requirements as specified in the previous section. Preliminary quantitative evaluation was performed on thirty consecutive slices of two volumes, on which the structures are easily recognizable. The mean absolute distances (MAD) between actual anatomical structure positions and positions predicted by the algorithm were calculated. This resulted in MAD of 2.4±0.4 mm for prostate, 3.2±0.9 mm for bladder and 3.3±1.3 mm for rectum. Conclusion: Visual inspection and quantitative evaluation show that the algorithm is able to propose probe positions that fulfill all clinical requirements. The obtained MAD is on average 2.9 mm. However, during evaluation we assumed no errors in structure segmentation and probe positioning. In future steps, accurate estimation of these errors will allow for better evaluation of the achieved accuracy.

60 APPLIED LIFE SCIENCES↗

RNAG: a new Gibbs sampler for predicting RNA secondary structure for unaligned sequences

Motivation: RNA secondary structure plays an important role in the function of many RNAs, and structural features are often key to their interaction with other cellular components. Thus, there has been considerable interest in the prediction of secondary structures for RNA families. In this article, we present a new global structural alignment algorithm, RNAG, to predict consensus secondary structures for unaligned sequences. It uses a blocked Gibbs sampling algorithm, which has a theoretical advantage in convergence time. This algorithm iteratively samples from the conditional probability distributions P(Structure | Alignment) and P(Alignment | Structure). Not surprisingly, there is considerable uncertainly in the high-dimensional space of this difficult problem, which has so far received limited attention in this field. We show how the samples drawn from this algorithm can be used to more fully characterize the posterior space and to assess the uncertainty of predictions. Results: Our analysis of three publically available datasets showed a substantial improvement in RNA structure prediction by RNAG over extant prediction methods. Additionally, our analysis of 17 RNA families showed that the RNAG sampled structures were generally compact around their ensemble centroids, and at least 11 families had at least two well-separated clusters of predicted structures. In general, the distance between a reference structure and our predicted structure was large relative to the variation among structures within an ensemble. Availability: The Perl implementation of the RNAG algorithm and the data necessary to reproduce the results described in Sections 3.1 and 3.2 are available at http://ccmbweb.ccv.brown.edu/rnag.html

59 BASIC BIOLOGICAL SCIENCES↗

The Current Status of Unsteady CFD Approaches for Aerodynamic Flow Control

An overview of the current status of time dependent algorithms is presented. Special attention is given to algorithms used to predict fluid actuator flows, as well as other active and passive flow control devices. Capabilities for the next decade are predicted, and principal impediments to the progress of time-dependent algorithms are identified.

Carpenter, Mark H.↗

Determination of stores pointing error due to wing flexibility under flight load

The in-flight elastic wing twist of a fighter-type aircraft was studied to provide for an improved on-board real-time computed prediction of pointing variations of three wing store stations. This is an important capability to correct sensor pod alignment variation or to establish initial conditions of iron bombs or smart weapons prior to release. The original algorithm was based upon coarse measurements. The electro-optical Flight Deflection Measurement System measured the deformed wing shape in flight under maneuver loads to provide a higher resolution database from which an improved twist prediction algorithm could be developed. The FDMS produced excellent repeatable data. In addition, a NASTRAN finite-element analysis was performed to provide additional elastic deformation data. The FDMS data combined with the NASTRAN analysis indicated that an improved prediction algorithm could be derived by using a different set of aircraft parameters, namely normal acceleration, stores configuration, Mach number, and gross weight.

Lokos, William A.↗

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

The field of prognostics and health management provides quantitative methods for monitoring and predicting the health of physical systems. Prognostics algorithms are useful in that they can be employed to assess the current state of a system, propagate the system state throughout time, and predict potential anomalies or failures that may occur. However, effective prognosis can be challenging to achieve in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for some prognostics applications. In this work, we implement three new algorithmic approaches to prediction (sampling methods, variable prediction time step, variable prediction sample size) with the goal of improving computational efficiency while minimizing decrease in model accuracy. To quantitatively analyze our results, we examine a use-case of degradation of a Lithium-ion battery. Notably, through this work it was found that none of the sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. However, our results show that prediction accuracy is highly dependent on the time step used, and that an appropriate time step can optimize both model accuracy and simulation efficiency. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment in an application-specific manner may prove useful in some applications. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency of prognosis.

Prognostics↗

Evaluation and Comparison of Machine Learning Techniques for Rapid QSTS Simulations

Rapid and accurate quasi-static time series (QSTS) analysis is becoming increasingly important for distribution system analysis as the complexity of the distribution system intensifies with the addition of new types, and quantities, of distributed energy resources (DER). The expanding need for hosting capacity analysis, control systems analysis, photovoltaic (PV) and DER impact analysis, and maintenance cost estimations are just a few reasons that QSTS is necessary. Historically, QSTS analysis has been prohibitively slow due to the number of computations required for a full-year analysis. Therefore, new techniques are required that allow QSTS analysis to rapidly be performed for many different use cases. This research demonstrates a novel approach to doing rapid QSTS analysis for analyzing the number of voltage regulator tap changes in a distribution system with PV components. A representative portion of a yearlong dataset is selected and QSTS analysis is performed to determine the number of tap changes, and this is used as training data for a machine learning algorithm. The machine learning algorithm is then used to predict the number of tap changes in the remaining portion of the year not analyzed directly with QSTS. The predictions from the machine learning algorithms are combined with the results of the partial year simulation for a final prediction for the entire year, with the goal of maintaining an error <10% on the full-year prediction. Five different machine learning techniques were evaluated and compared with each other; a neural network ensemble, a random forest decision tree ensemble, a boosted decision tree ensemble, support vector machines, and a convolutional neural network deep learning technique. A combination of the neural network ensemble together with the random forest produced the best results. Using 20% of the year as training data, analyzed with QSTS, the average performance of the technique resulted in ~2.5% error in the yearly tap changes, while maintaining a <10% 99.9 th percentile error bound on the results. This is a 5x speedup compared to a standard, full-length QSTS simulation. These results demonstrate the potential for applying machine learning techniques to facilitate modern distribution system analysis and further integration of distributed energy resources into the power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

First principles prediction of amorphous phases using evolutionary algorithms

We discuss the efficacy of evolutionary method for the purpose of structural analysis of amorphous solids. At present, ab initio molecular dynamics (MD) based melt-quench technique is used and this deterministic approach has proven to be successful to study amorphous materials. We show that a stochastic approach motivated by Darwinian evolution can also be used to simulate amorphous structures. Applying this method, in conjunction with density functional theory based electronic, ionic and cell relaxation, we re-investigate two well known amorphous semiconductors, namely silicon and indium gallium zinc oxide. We find that characteristic structural parameters like average bond length and bond angle are within ∼2% of those reported by ab initio MD calculations and experimental studies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An ultra-incompressible Mn3N compound predicted by first-principles genetic algorithm

Using genetic algorithms for an unbiased structure search and first-principles total-energy calculations, a stable manganese nitride, Mn3N, is discovered. Mn3N is a nonmagnetic metal and isostructural to superhard Re3N. Mn3N exhibits a large bulk modulus and incompressibility comparable to that of the ultra-incompressible OsB. We show that the large bulk modulus can be attributed to the strong covalent bonding in this system. Phonon calculations and analysis confirm the dynamical stability of the Mn3N compound. We also show that weak electron–phonon coupling leads to a small superconducting transition temperature for Mn3N.

Zhang, Chao (ORCID:0000000259572287)↗

Genome Majority Vote Improves Gene Predictions

Recent studies have noted extensive inconsistencies in gene start sites among orthologous genes in related microbial genomes. Here we provide the first documented evidence that imposing gene start consistency improves the accuracy of gene start-site prediction. We applied an algorithm using a genome majority vote (GMV) scheme to increase the consistency of gene starts among orthologs. We used a set of validated Escherichia coli genes as a standard to quantify accuracy. Results showed that the GMV algorithm can correct hundreds of gene prediction errors in sets of five or ten genomes while introducing few errors. Using a conservative calculation, we project that GMV would resolve many inconsistencies and errors in publicly available microbial gene maps. Our simple and logical solution provides a notable advance toward accurate gene maps.

59 BASIC BIOLOGICAL SCIENCES↗

Development of simplified model for injection rate prediction of diesel injectors during transient and steady operation

Determining the injection rate of the diesel injector during the transient short injection operations is a critical matter to enhance the combustion process by improving air/fuel mixture formation. In this regard, numerous injection models have been suggested in the literature to predict the injection rate accurately. However, such algorithms have not precisely predicted the rate of injection (ROI) in transient short injection events. In addition, most of those models require many input parameters to characterize hydraulic and mechanical subsystems in the injector, which can make them inconvenient to tune for different injector specifications, in other words not suitable for universal usage. Therefore, our study aims to develop a simple injection model that can predict injection rate precisely in the short and long injection durations considering relatively fewer input parameters. The model traces the pressure variation inside the sac based on the bulk modulus theory to predict nozzle exit velocity, thus the injection rate of the injector. In the algorithm, the bulk modulus of fuel (E) and discharge coefficients of the nozzle hole and needle seat (C d,H and C d,N ) have been considered to vary rather than set constant during the injection process since such flow parameters would have a critical impact on the flow development at the transient stage, thus affecting the injection rate of diesel injectors. Here with this modelling strategy, the accuracy of the new model on ROI prediction was confirmed with acceptable model error for both short and long injection durations by validating against experimental results. To understand the effect of the new model scheme on ROI prediction, ROI results with the new model have been discussed by comparing it with the ROI results predicted with constant flow parameters.

42 ENGINEERING↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Smoothing of respiratory motion traces for motion-compensated radiotherapy

Purpose: The CyberKnife system has been used successfully for several years to radiosurgically treat tumors without the need for stereotactic fixation or sedation of the patient. It has been shown that tumor motion in the lung, liver, and pancreas can be tracked with acceptable accuracy and repeatability. However, highly precise targeting for tumors in the lower abdomen, especially for tumors which exhibit strong motion, remains problematic. Reasons for this are manifold, like the slow tracking system operating at 26.5 Hz, and using the signal from the tracking camera ''as is''. Since the motion recorded with the camera is used to compensate for system latency by prediction and the predicted signal is subsequently used to infer the tumor position from a correlation model based on x-ray imaging of gold fiducials around the tumor, camera noise directly influences the targeting accuracy. The goal of this work is to establish the suitability of a new smoothing method for respiratory motion traces used in motion-compensated radiotherapy. The authors endeavor to show that better prediction--With a lower rms error of the predicted signal--and/or smoother prediction is possible using this method. Methods: The authors evaluated six commercially available tracking systems (NDI Aurora, PolarisClassic, Polaris Vicra, MicronTracker2 H40, FP5000, and accuTrack compact). The authors first tracked markers both stationary and while in motion to establish the systems' noise characteristics. Then the authors applied a smoothing method based on the a trous wavelet decomposition to reduce the devices' noise level. Additionally, the smoothed signal of the moving target and a motion trace from actual human respiratory motion were subjected to prediction using the MULIN and the nLMS{sub 2} algorithms. Results: The authors established that the noise distribution for a static target is Gaussian and that when the probe is moved such as to mimic human respiration, it remains Gaussian with the exception of the FP5000 and the Aurora systems. The authors also showed that the proposed smoothing method can indeed be used to filter noise. The signal's jitter dropped by as much as 95% depending on the tracking system employed. Subsequently, the 3D prediction error (rms) for a prediction horizon of 150 ms on a synthetic signal dropped by up to 37% when using a normalized LMS prediction algorithm (nLMS{sub 2}) and hardly changed when using a MULIN algorithm. When smoothing a real signal obtained in our laboratory, the improvement of prediction was similar: Up to 30% for both the nLMS{sub 2} and the best MULIN algorithm. The authors also found a noticeable increase in smoothness of the predicted signal, the relative jitter dropped by up to 95% on the real signal, and on the simulated signal. Conclusions: In conclusion, the authors can say that preprocessing of marker data is very useful in motion-compensated radiotherapy since the quality of prediction increases. This will result in better performance of the correlation model. As a side effect, since the prediction of a preprocessed signal is also less noisy, the authors expect less robot vibration resulting in better targeting accuracy and less strain on the robot gears.

62 RADIOLOGY AND NUCLEAR MEDICINE↗