Search NASA⌕ Search

SEARCH · Search NASA

Results for “Context algorithm”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

A numerical algorithm for endochronic plasticity and comparison with experiment

A numerical algorithm based on the finite element method of analysis of the boundary value problem in a continuum is presented, in the case where the plastic response of the material is given in the context of endochronic plasticity. The relevant constitutive equation is expressed in incremental form and plastic effects are accounted for by the method of an induced pseudo-force in the matrix equations. The results of the analysis are compared with observed values in the case of a plate with two symmetric notches and loaded longitudinally in its own plane. The agreement between theory and experiment is excellent.

Valanis, K. C.↗
NASA NTRS1991

Experiments in robotic catching

Real-time coordination of visual information with high-speed manipulator control is studied in the context of three-dimensional robotic catching. All path planning for the catch occurs in real-time during the half-second that the targeted object is airborne. A trajectory-matching algorithm is used that combines an observer with a varying-strength filter, an error estimator, and an initial motion algorithm. The results are demonstrated experimentally using a real-time vision system and a four-degree-of-freedom, cable-driven arm with a workspace of 4.2 m3 and speed capabilities of up to 2.0 m/s.

Hove, Barbara↗
NASA NTRS1998

Computational Aeroheating Predictions for X-34

Radiative equilibrium surface temperatures, heating rates, streamlines, surface pressures, and flow-field features as predicted by the Langley Aerothermodynamic Upwind Relaxation Algorithm (Laura) are presented for the X-34 Technology Demonstrator. Results for two trajectory points corresponding to entry peak heating and two control surface deflections are discussed. This data is also discussed in context of Thermal Protection System (TPS) design issues. The work presented in this report is part of a larger effort to define the X-34 aerothermal environment, including the application of engineering codes and wind-tunnel studies.

Kelb, William L.↗
NASA NTRSDate not supplied

Do Better Satellite Precipitation Algorithms Improve Landslide Hazard Assessment?

Satellites make it possible to estimate precipitation in near real time. Given the challenges of achieving global coverage by other means, these data are used widely. However, few systems for landslide hazard assessment rely on satellite precipitation estimates. This could be due in part to perceptions of accuracy, although latency, spatial resolution, and other factors may also be important. We test whether recent changes to data streams from the Global Precipitation Measurement mission (GPM) have improved its potential for use in landslide prediction. Specifically, we examine data produced by the Integrated Multi-satellitERetrievals for the GPM (IMERG) algorithm, which was upgraded to version 7 this year. IMERG relies upon other algorithms, including the Goddard Profiling Algorithm (GPROF) and the GPM Combined Radar-Radiometer Algorithm (CORRA). Many changes have been made during the switch from IMERG version 6 to version 7. These include upgrading CORRA and GPROF to version 7, to improve the accuracy of precipitation in frozen, mountainous, and coastal areas. The measured intensity of some storms has been enhanced with a new algorithm, the Scheme for Histogram Adjustment with Ranked Precipitation Estimates in the Neighborhood. Combined with many others, these changes to IMERG should improve its utility for landslide hazard assessment in a variety of contexts. To test this idea, we retrain the global Landslide Hazard Assessment for Situational Awareness (LHASA) model twice—first with data from IMERG version 6B and second with 7B. Since current daily rainfall is the most important variable in determining outcomes predicted by LHASA, it should reflect changes made to that input. First, we grid the landslides at a daily, thirty-arcsecond resolution. This serves as the response variable. At each of these sites current and antecedent rainfall are extracted, along with antecedent snow mass and soil moisture, slope, and PGA. In addition, one million grid cells are selected at random points to represent conditions under which landslides (probably) do not occur. After merging these data, we hold back 20% of the dataset for validation purposes and train a machine-learning model with the rest. We assess both the model’s overall ability to identify landslides and its ability to predict specific large landslide disasters.

Thomas A Stanley↗
NASA NTRS2009

Active Learning with Irrelevant Examples

An improved active learning method has been devised for training data classifiers. One example of a data classifier is the algorithm used by the United States Postal Service since the 1960s to recognize scans of handwritten digits for processing zip codes. Active learning algorithms enable rapid training with minimal investment of time on the part of human experts to provide training examples consisting of correctly classified (labeled) input data. They function by identifying which examples would be most profitable for a human expert to label. The goal is to maximize classifier accuracy while minimizing the number of examples the expert must label. Although there are several well-established methods for active learning, they may not operate well when irrelevant examples are present in the data set. That is, they may select an item for labeling that the expert simply cannot assign to any of the valid classes. In the context of classifying handwritten digits, the irrelevant items may include stray marks, smudges, and mis-scans. Querying the expert about these items results in wasted time or erroneous labels, if the expert is forced to assign the item to one of the valid classes. In contrast, the new algorithm provides a specific mechanism for avoiding querying the irrelevant items. This algorithm has two components: an active learner (which could be a conventional active learning algorithm) and a relevance classifier. The combination of these components yields a method, denoted Relevance Bias, that enables the active learner to avoid querying irrelevant data so as to increase its learning rate and efficiency when irrelevant items are present. The algorithm collects irrelevant data in a set of rejected examples, then trains the relevance classifier to distinguish between labeled (relevant) training examples and the rejected ones. The active learner combines its ranking of the items with the probability that they are relevant to yield a final decision about which item to present to the expert for labeling. Experiments on several data sets have demonstrated that the Relevance Bias approach significantly decreases the number of irrelevant items queried and also accelerates learning speed.

Wagstaff, Kiri↗
NASA NTRS1992

Fuzzy logic and neural network technologies

Applications of fuzzy logic technologies in NASA projects are reviewed to examine their advantages in the development of neural networks for aerospace and commercial expert systems and control. Examples of fuzzy-logic applications include a 6-DOF spacecraft controller, collision-avoidance systems, and reinforcement-learning techniques. The commercial applications examined include a fuzzy autofocusing system, an air conditioning system, and an automobile transmission application. The practical use of fuzzy logic is set in the theoretical context of artificial neural systems (ANSs) to give the background for an overview of ANS research programs at NASA. The research and application programs include the Network Execution and Training Simulator and faster training algorithms such as the Difference Optimized Training Scheme. The networks are well suited for pattern-recognition applications such as predicting sunspots, controlling posture maintenance, and conducting adaptive diagnoses.

Villarreal, James A.↗
NASA NTRS1998

Computational Aeroheating Predictions for X-34

Radiative equilibrium surface temperatures, heating rates, streamlines, surface pressures, and flow-field features as predicted by the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) are presented for the X-34 Technology Demonstrator. Results for two trajectory points corresponding to entry peak heating and two control surface deflections are discussed. This data is also discussed in the context of Thermal Protection System (TPS) design issues. The work presented in this report is part of a larger effort to define the X-34 aerothermal environment, including the application of engineering codes and wind-tunnel studies.

Kleb,William H.↗
NASA NTRSDate not supplied

Explaining Soft-Goal Conflicts through Constraint Relaxations

Recent work suggests to explain trade-offs between soft goals in terms of their conflicts, i. e., minimal unsolvable soft-goal subsets. But this does not explain the conflicts themselves: Why can a given set of soft-goals not be jointly achieved? Here we approach that question in terms of the underlying constraints on plans in the task at hand, namely resource availability and time windows. In this context, a natural form of explanation for a soft-goal conflict is a minimal constraint relaxation under which the conflict disappears (“if the deadline was 1 hour later, it would work”). We explore algorithms for computing such explanations. A baseline is to simply loop over all relaxed tasks and compute the conflicts for each separately. We improve over this by two algorithms that leverage information – conflicts, reachable states – across relaxed tasks. We show that these algorithms can exponentially outperform the baseline in theory, and we run experiments confirming that advantage in practice.

Planning↗
NASA NTRS1987

Gaussian maximum likelihood and contextual classification algorithms for multicrop classification experiments using thematic mapper and multispectral scanner sensor data

The paper presents the results of a four-factor two-level analysis of a variance experiment designed to evaluate the combined effect of the improved quality of remote-sensor data and the use of context by the classifier on classification accuracy. The improvement achievable by using the context via relaxation techniques is significantly smaller than that provided by an increase of the radiometric resolution of the sensor from 6 to 8 bits per sample (the relative increase in radiometric resolution of TM relative to MSS). It is almost equal to that achievable by an increase in the spectral coverage as provided by TM relative to MSS.

Di Zenzo, Silvano↗
NASA NTRS2009

Methods for Probabilistic Fault Diagnosis: An Electrical Power System Case Study

Health management systems that more accurately and quickly diagnose faults that may occur in different technical systems on-board a vehicle will play a key role in the success of future NASA missions. We discuss in this paper the diagnosis of abrupt continuous (or parametric) faults within the context of probabilistic graphical models, more specifically Bayesian networks that are compiled to arithmetic circuits. This paper extends our previous research, within the same probabilistic setting, on diagnosis of abrupt discrete faults. Our approach and diagnostic algorithm ProDiagnose are domain-independent; however we use an electrical power system testbed called ADAPT as a case study. In one set of ADAPT experiments, performed as part of the 2009 Diagnostic Challenge, our system turned out to have the best performance among all competitors. In a second set of experiments, we show how we have recently further significantly improved the performance of the probabilistic model of ADAPT. While these experiments are obtained for an electrical power system testbed, we believe they can easily be transitioned to real-world systems, thus promising to increase the success of future NASA missions.

Ricks, Brian W.↗
NASA NTRS2018

An Innovative Control Allocation Scheme to Address Reaction Thruster Interactions on a 3U CubeSat

A wealth of literature exists on control allocation algorithms for over-actuated air vehicles, launch vehicles, and spacecraft's. Most of these algorithms focus primarily on minimizing some objective function such as command tracking error and/or control effector usage. Linear allocators (pseudo inverses) are usually the conventional choice due to their simplicity and the ability to achieve a significant portion of the theoretical moment/impulse space. Generally, it is assumed that there exists minimal interaction effects between control effectors. In fact, very few studies address the problem of control effector interactions in the context of control allocation, especially for small spacecraft's with a reaction control system (RCS). This paper presents a CubeSat RCS design with a four thruster tetrahedral layout such that when two or more thrusters re, the resultant impulse differs noticeably compared to the sum of the contributions from individual thruster rings. This undesirable effect is caused by the design of the propellant tank and regulator. To mitigate this issue, an innovative modified pseudo inverse (MPI) control allocation algorithm was developed that adjusts the pseudo inverse solution based on test data. The algorithm is iteration-free and superior to the standard pseudo inverse in minimizing the command tracking error.

Pei, Jing↗
NASA NTRS1997

Continued Development of the Discontinuous Galerkin Method for Computational Aeroacoustic Applications

The formulation and the implementation of boundary conditions within the context of the quadrature-free form of the discontinuous Galerkin method are presented for several types of boundary conditions for the Euler equations. An important feature of the discontinuous Galerkin method is that the interior point algorithm is well behaved in the neighborhood of the boundary and requires no modifications. This feature leads to a simple and accurate treatment for wall boundary conditions and simple inflow and outflow boundary conditions. Curved walls are accurately treated with only minor changes to the implementation described in earlier work. The 'perfectly matched layer' approach to nonreflecting boundary conditions is easily applied to the discontinuous Galerkin. The compactness of the discontinuous Galerkin method makes it better suited for buffer-zone-type methods than high-order finite-difference methods. Results are presented for wall, characteristic inflow and outflow, and nonreflecting boundary conditions.

Atkins, H. L.↗
NASA NTRS1976

Solving the optimal attention allocation problem in manual control

Within the context of the optimal control model of human response, analytic expressions for the gradients of closed-loop performance metrics with respect to human operator attention allocation are derived. These derivatives serve as the basis for a gradient algorithm that determines the optimal attention that a human should allocate among several display indicators in a steady-state manual control task. Application of the human modeling techniques are made to study the hover control task for a CH-46 VTOL flight tested by NASA.

Kleinman, D. L.↗
NASA NTRS1999

Autonomous Onboard Science Image Analysis for Future Mars Rover Missions

To explore high priority landing sites and to prepare for eventual human exploration, future Mars missions will involve rovers capable of traversing tens of kilometers. However, the current process by which scientists interact with a rover does not scale to such distances. Specifically, numerous command cycles are required to complete even simple tasks, such as, pointing the spectrometer at a variety of nearby rocks. In addition, the time required by scientists to interpret image data before new commands can be given and the limited amount of data that can be downlinked during a given command cycle constrain rover mobility and achievement of science goals. Experience with rover tests on Earth supports these concerns. As a result, traverses to science sites as identified in orbital images would require numerous science command cycles over a period of many weeks, months or even years, perhaps exceeding rover design life and other constraints. Autonomous onboard science analysis can address these problems in two ways. First, it will allow the rover to transmit only "interesting" images, defined as those likely to have higher science content. Second, the rover will be able to anticipate future commands. For example, a rover might autonomously acquire and return spectra of "interesting" rocks along with a high resolution image of those rocks in addition to returning the context images in which they were detected. Such approaches, coupled with appropriate navigational software, help to address both the data volume and command cycle bottlenecks that limit both rover mobility and science yield. We are developing fast, autonomous algorithms to enable such intelligent on-board decision making by spacecraft. Autonomous algorithms developed to date have the ability to identify rocks and layers in a scene, locate the horizon, and compress multi-spectral image data. Output from these algorithms could be used to autonomously obtain rock spectra, determine which images should be transmitted to the ground, or to aid in image compression. We will discuss these and other algorithms and demonstrate their performance during a recent rover field test.

Gulick, V. C.↗
NASA NTRS1999

Autonomous Image Analysis for Future Mars Missions

To explore high priority landing sites and to prepare for eventual human exploration, future Mars missions will involve rovers capable of traversing tens of kilometers. However, the current process by which scientists interact with a rover does not scale to such distances. Specifically, numerous command cycles are required to complete even simple tasks, such as, pointing the spectrometer at a variety of nearby rocks. In addition, the time required by scientists to interpret image data before new commands can be given and the limited amount of data that can be downlinked during a given command cycle constrain rover mobility and achievement of science goals. Experience with rover tests on Earth supports these concerns. As a result, traverses to science sites as identified in orbital images would require numerous science command cycles over a period of many weeks, months or even years, perhaps exceeding rover design life and other constraints. Autonomous onboard science analysis can address these problems in two ways. First, it will allow the rover to preferentially transmit "interesting" images, defined as those likely to have higher science content. Second, the rover will be able to anticipate future commands. For example, a rover might autonomously acquire and return spectra of "interesting" rocks along with a high-resolution image of those rocks in addition to returning the context images in which they were detected. Such approaches, coupled with appropriate navigational software, help to address both the data volume and command cycle bottlenecks that limit both rover mobility and science yield. We are developing fast, autonomous algorithms to enable such intelligent on-board decision making by spacecraft. Autonomous algorithms developed to date have the ability to identify rocks and layers in a scene, locate the horizon, and compress multi-spectral image data. We are currently investigating the possibility of reconstructing a 3D surface from a sequence of images acquired by a robotic arm camera. This would then allow the return of a single completely in focus image constructed only from those portions of individual images that lie within the camera's depth of field. Output from these algorithms could be used to autonomously obtain rock spectra, determine which images should be transmitted to the ground, or to aid in image compression. We will discuss these algorithms and their performance during a recent rover field test.

Gulick, V. C.↗
NASA NTRS2010

Assessment of Aerosol Distributions from GEOS-5 Using the CALIPSO Feature Mask

A-train sensors such as MODIS, MISR, and CALIPSO are used to determine aerosol properties, and in the process a means of estimating aerosol type (e.g. smoke vs. dust). Correct classification of aerosol type is important for climate assessment, air quality applications, and for comparisons and analysis with aerosol transport models. The Aerosols-Clouds-Ecosystems (ACE) satellite mission proposed in the NRC Decadal Survey describes a next generation aerosol and cloud suite similar to the current A-train, including a lidar. The future ACE lidar must be able to determine aerosol type effectively in conjunction with modeling activities to achieve ACE objectives. Here we examine the current capabilities of CALIPSO and the NASA Goddard Earth Observing System general circulation model and data assimilation system (GEOS-5), to place future ACE needs in context. The CALIPSO level 2 feature mask includes vertical profiles of aerosol layers classified by type. GEOS-5 provides global 3D aerosol mass for sulfate, sea salt, dust, and black and organic carbon. A GEOS aerosol scene classification algorithm has been developed to provide estimates of aerosol mixtures and extinction profiles along the CALIPSO orbit track. In previous work, initial comparisons between GEOS-5 derived aerosol mixtures and CALIPSO derived aerosol types were presented for July 2007. In general, the results showed that model and lidar derived aerosol types did not agree well in the boundary layer. Agreement was poor over Europe, where CALIPSO indicated the presence of dust and pollution mixtures yet GEOS-5 was dominated by pollution with little dust. Over the ocean in the tropics, the model appeared to contain less sea salt than detected by CALIPSO, yet at high latitudes the situation was reserved. Agreement between CALIPSO and GEOS-5, aerosol types improved above the boundary layer, primarily in dust and smoke dominated regions. At higher altitudes (> 5 km), the model contained aerosol layers not detected by CALIPSO. Here we present new results for a full year study using the new Version 3 CALIPSO data and most recent GEOS-5 model results.

Welton, Ellsworth↗
NASA NTRS2012

Forecasting Evaluation of WindSat in the Coastal Environment

WindSat has demonstrated that measurements from polarimetric space-based microwave radiometers can be used to retrieve global ocean surface vector winds. Since the date of launch in 2003, substantial incremental improvements have been made to WindSat data processing, calibration, and retrieval algorithms. The retrievals now have higher resolution, improved wind vector ambiguity removal, and enhanced capability to represent high winds. Utilization of WindSat retrievals (wind vectors, total precipitable water, rainrate and sea surface temperature) will be demonstrated in the context of operational weather forecasting applications, especially the monitoring of topographically-forced winds. Examples will be presented from various parts of the world, including inland seas, midlatitude oceans, the tropics, and the United States. We will illustrate retrievals in extreme high- and extreme low-wind regimes, both of which can be problematic. Rain contamination will be addressed. We will include a comparison of WindSat vector maps to corresponding maps from the QuikScat scatterometer. We will discuss how near-realtime data from WindSat is being transitioned to specific offices within the National Weather Service.

Lee, Thomas F.↗
NASA NTRS2012

Constructing an Efficient Self-Tuning Aircraft Engine Model for Control and Health Management Applications

Self-tuning aircraft engine models can be applied for control and health management applications. The self-tuning feature of these models minimizes the mismatch between any given engine and the underlying engineering model describing an engine family. This paper provides details of the construction of a self-tuning engine model centered on a piecewise linear Kalman filter design. Starting from a nonlinear transient aerothermal model, a piecewise linear representation is first extracted. The linearization procedure creates a database of trim vectors and state-space matrices that are subsequently scheduled for interpolation based on engine operating point. A series of steady-state Kalman gains can next be constructed from a reduced-order form of the piecewise linear model. Reduction of the piecewise linear model to an observable dimension with respect to available sensed engine measurements can be achieved using either a subset or an optimal linear combination of "health" parameters, which describe engine performance. The resulting piecewise linear Kalman filter is then implemented for faster-than-real-time processing of sensed engine measurements, generating outputs appropriate for trending engine performance, estimating both measured and unmeasured parameters for control purposes, and performing on-board gas-path fault diagnostics. Computational efficiency is achieved by designing multidimensional interpolation algorithms that exploit the shared scheduling of multiple trim vectors and system matrices. An example application illustrates the accuracy of a self-tuning piecewise linear Kalman filter model when applied to a nonlinear turbofan engine simulation. Additional discussions focus on the issue of transient response accuracy and the advantages of a piecewise linear Kalman filter in the context of validation and verification. The techniques described provide a framework for constructing efficient self-tuning aircraft engine models from complex nonlinear simulations.Self-tuning aircraft engine models can be applied for control and health management applications. The self-tuning feature of these models minimizes the mismatch between any given engine and the underlying engineering model describing an engine family. This paper provides details of the construction of a self-tuning engine model centered on a piecewise linear Kalman filter design. Starting from a nonlinear transient aerothermal model, a piecewise linear representation is first extracted. The linearization procedure creates a database of trim vectors and state-space matrices that are subsequently scheduled for interpolation based on engine operating point. A series of steady-state Kalman gains can next be constructed from a reduced-order form of the piecewise linear model. Reduction of the piecewise linear model to an observable dimension with respect to available sensed engine measurements can be achieved using either a subset or an optimal linear combination of "health" parameters, which describe engine performance. The resulting piecewise linear Kalman filter is then implemented for faster-than-real-time processing of sensed engine measurements, generating outputs appropriate for trending engine performance, estimating both measured and unmeasured parameters for control purposes, and performing on-board gas-path fault diagnostics. Computational efficiency is achieved by designing multidimensional interpolation algorithms that exploit the shared scheduling of multiple trim vectors and system matrices. An example application illustrates the accuracy of a self-tuning piecewise linear Kalman filter model when applied to a nonlinear turbofan engine simulation. Additional discussions focus on the issue of transient response accuracy and the advantages of a piecewise linear Kalman filter in the context of validation and verification. The techniques described provide a framework for constructing efficient self-tuning aircraft engine models from complex nonlinear simulatns.

Armstrong, Jeffrey B.↗