Search NASA⌕ Search

SEARCH · Search NASA

Results for “interface 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 199 records · Page 11

Optimization of residual stresses in MMC's through the variation of interfacial layer architectures and processing parameters

The objective of this work was the development of efficient, user-friendly computer codes for optimizing fabrication-induced residual stresses in metal matrix composites through the use of homogeneous and heterogeneous interfacial layer architectures and processing parameter variation. To satisfy this objective, three major computer codes have been developed and delivered to the NASA-Lewis Research Center, namely MCCM, OPTCOMP, and OPTCOMP2. MCCM is a general research-oriented code for investigating the effects of microstructural details, such as layered morphology of SCS-6 SiC fibers and multiple homogeneous interfacial layers, on the inelastic response of unidirectional metal matrix composites under axisymmetric thermomechanical loading. OPTCOMP and OPTCOMP2 combine the major analysis module resident in MCCM with a commercially-available optimization algorithm and are driven by user-friendly interfaces which facilitate input data construction and program execution. OPTCOMP enables the user to identify those dimensions, geometric arrangements and thermoelastoplastic properties of homogeneous interfacial layers that minimize thermal residual stresses for the specified set of constraints. OPTCOMP2 provides additional flexibility in the residual stress optimization through variation of the processing parameters (time, temperature, external pressure and axial load) as well as the microstructure of the interfacial region which is treated as a heterogeneous two-phase composite. Overviews of the capabilities of these codes are provided together with a summary of results that addresses the effects of various microstructural details of the fiber, interfacial layers and matrix region on the optimization of fabrication-induced residual stresses in metal matrix composites.

Pindera, Marek-Jerzy↗

International Space Station Urine Monitoring System Functional Integration and Science Testing

Exposure to microgravity during human spaceflight needs to be better understood as the human exploration of space requires longer duration missions. It is known that long term exposure to microgravity causes bone loss. Measuring the calcium and other metabolic byproducts in a crew member s urine can evaluate the effectiveness of bone loss countermeasures. The International Space Station (ISS) Urine Monitoring System (UMS) is an automated urine collection device designed to collect urine, separate the urine and air, measure the void volume, and allow for syringe sampling. Accurate measuring and minimal cross-contamination is essential to determine bone loss and the effectiveness of countermeasures. The ISS UMS provides minimal cross-contamination (<0.7 mL urine) and has volume accuracy of 2% between 100 to 1000 mL urine voids. Designed to provide a non-invasive means to collect urine samples from crew members, the ISS UMS operates in-line with the Node 3 Waste and Hygiene Compartment (WHC). The ISS UMS has undergone modifications required to interface with the WHC, including material changes, science algorithm improvements, and software platform revisions. Integrated functional testing was performed to determine the pressure drop, air flow rate, and the maximum amount of fluid capable of being discharged from the UMS to the WHC. This paper will detail the results of the science and the functional integration tests.

Rodriquez, Branelle R.↗

Using Natural Language to Enable Mission Managers to Control Multiple Heterogeneous UAVs

The availability of highly capable, yet relatively cheap, unmanned aerial vehicles (UAVs) is opening up new areas of use for hobbyists and for commercial activities. This research is developing methods beyond classical control-stick pilot inputs, to allow operators to manage complex missions without in-depth vehicle expertise. These missions may entail several heterogeneous UAVs flying coordinated patterns or flying multiple trajectories deconflicted in time or space to predefined locations. This paper describes the functionality and preliminary usability measures of an interface that allows an operator to define a mission using speech inputs. With a defined and simple vocabulary, operators can input the vast majority of mission parameters using simple, intuitive voice commands. Although the operator interface is simple, it is based upon autonomous algorithms that allow the mission to proceed with minimal input from the operator. This paper also describes these underlying algorithms that allow an operator to manage several UAVs.

Trujillo, Anna C.↗

Performance Enhancements for the Lattice-Boltzmann Solver in the LAVA Framework

Performance enhancements in NASA's recently developed Lattice Boltzmann solver within the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented. Two key algorithmic developments are highlighted. A coarse-fine interface treatment that discretely conserves mass and momentum has been implemented and successfully verified and validated. Code optimizations targeting improved serial and parallel performance were presented. For a simple turbulent Taylor-Green Vortex problem, we were able to demonstrate a 2.3 times speedup over the baseline code for a single Skylake-SP node containing 40 physical cores, and a 2.14 times speedup for 64 nodes containing 2560 physical cores. In addition, we were able to show that the optimizations enabled us to scale the code almost perfectly to 20480 physical cores where, including ghost cells, the problem size was 10 billion cells.

Barad, Michael↗

Performance Enhancements for the Lattice-Boltzmann Solver in the LAVA Framework

Performance enhancements in NASA's recently developed Lattice Boltzmann solver within the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented. Two key algorithmic developments are highlighted. A coarse-fine interface treatment that discretely conserves mass and momentum has been implemented and successfully verified and validated. Code optimizations targeting improved serial and parallel performance were presented. For a simple turbulent Taylor-Green Vortex problem, we were able to demonstrate a 2.3 times speedup over the baseline code for a single Skylake-SP node containing 40 physical cores, and a 2.14 times speedup for 64 nodes containing 2560 physical cores. In addition, we were able to show that the optimizations enabled us to scale the code almost perfectly to 20480 physical cores where, including ghost cells, the problem size was 10 billion cells.

LAVA↗

Integrating the Science Opportunity Analyzer with a Reusable Opportunity Search Framework

In our interactions with the Science Opportunity Analyzer (SOA) software, we recognized how its ability to search for geometric events in space is a need for robotic space missions in general. To satisfy this need, we propose the Tychonis framework, which is built upon the principles of: (1) separations of concerns, (2) extensibility, (3) reusability, and (4) independent verification and validation. Tychonis’ separation of concerns results in the availability of different constructs to model geometric events and search for them. These constructs can be extended by users as needed and reused across missions without changes. Given the low coupling between concerns, and the fact Tychonis can be augmented in isolation, its constructs can be validated independently from other pieces of software. This paper elaborates on these topics and presents an integration case study between Tychonis and SOA that relies on the concept of dynamic integration. Dynamic integration entails that augmentations of the framework are reflected automatically in the host application without any changes to the host application’s code. The SOA-Tychonis integration case study can be extrapolated to other tools that need to search for geometric events as the pattern repeats across implementations: (i) the manipulation of a user interface to model opportunities, (ii) the execution of algorithms to search for opportunities, and (iii) the presentation of search results to users. Overall, Tychonis’ is a story about how the application of proven software principles and good design choices can reduce risk and cost to space missions

Soria, Manel↗

ORACLES: Optimized Rational Algorithm for Conjecture of Long-term Exploration of Space

ORACLES is a joint venture between the United States Space Force (USSF) and the National Aeronautics and Space Administration (NASA) to develop a model for future space exploration, commercialization, and expansion. Following the success of qualitative future scenario exploration during the Space Futures Workshops (SFW), ORACLES aims to produce a quantitative means of evaluating these same factors. This model considers the social, economic, and political environment and determines possible inflection points; that is, the most crucial investments in technologies, infrastructure, and policy for the support and protection of U.S. and allied space assets. The development of ORACLES is in its infancy, with front end interfaces constructed for discussion and debate before the overall algorithm is finalized. Comments are highly encouraged as the team wishes to gain the broadest level of perspectives before continuing with development.

Robert B Adams↗

An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE

The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.

Baysal, Oktay↗

Improved Coupled Fluid/Structural Dynamical Model

Improved algorithm developed for simulation of coupled motions of fluids and structures. Minimum requirement for correct simulation of damping is forces and velocities at interface compatible in models of structure and fluid at each time step. Improved algorithm, conforms to this requirement, involves fluid-transient model, structural modal/transient model, and an algebraic impedance/coupling subalgorithm. Use of this algorithm greatly improves computational stability.

Fenwick, James R.↗

Applications of artificial intelligence to space station: General purpose intelligent sensor interface

This final report describes the accomplishments of the General Purpose Intelligent Sensor Interface task of the Applications of Artificial Intelligence to Space Station grant for the period from October 1, 1987 through September 30, 1988. Portions of the First Biannual Report not revised will not be included but only referenced. The goal is to develop an intelligent sensor system that will simplify the design and development of expert systems using sensors of the physical phenomena as a source of data. This research will concentrate on the integration of image processing sensors and voice processing sensors with a computer designed for expert system development. The result of this research will be the design and documentation of a system in which the user will not need to be an expert in such areas as image processing algorithms, local area networks, image processor hardware selection or interfacing, television camera selection, voice recognition hardware selection, or analog signal processing. The user will be able to access data from video or voice sensors through standard LISP statements without any need to know about the sensor hardware or software.

Mckee, James W.↗

Implementation and Testing of Inverse Kinematics on Robotic Arm

COSIE (Coronal Spectrographic Imager in the Extreme Ultraviolet) is a proposed solar tracking ISS imaging payload that will help bridge the theoretical gap between the physics of the low corona and the heliosphere. This scientific instrument requires high pointing accuracy, on the order of arc seconds. The instrument is mounted on to a three revolute joint robotic arm in order to track the roll, pitch and yaw motion of the Sun. The goal of this project is to construct a prototype model of the robotic arm and implement the proposed analytical inverse kinematics algorithm. In robotics, the inverse kinematics problem is solving for the set of joint angles that achieve the desired end effect or location and/or orientation. In this case, orientation is the focus. Depending on the configuration, multiple sets of joint angle solutions may exist. Due to the complexity of robotics, typically iterative methods are used to solve for the joint angle solution sets. However, in this case, an analytical solution exists. A small robotic arm representative of the full size hardware was constructed. The inverse kinematics algorithm, originally in MATLAB/Simulink, was converted into C in order to interface with the motors. This C software was implemented on a Windows PC and micro-controller, and serial communication between the two was established, allowing the motors to be directly controlled by the inverse kinematics algorithm. Testing the inverse kinematics on a physical system will allow the validity and accuracy of the analytic solution to be verified.

Franz, Carter↗

Discrete-State Simulated Annealing For Traveling-Wave Tube Slow-Wave Circuit Optimization

Algorithms based on the global optimization technique of simulated annealing (SA) have proven useful in designing traveling-wave tube (TWT) slow-wave circuits for high RF power efficiency. The characteristic of SA that enables it to determine a globally optimized solution is its ability to accept non-improving moves in a controlled manner. In the initial stages of the optimization, the algorithm moves freely through configuration space, accepting most of the proposed designs. This freedom of movement allows non-intuitive designs to be explored rather than restricting the optimization to local improvement upon the initial configuration. As the optimization proceeds, the rate of acceptance of non-improving moves is gradually reduced until the algorithm converges to the optimized solution. The rate at which the freedom of movement is decreased is known as the annealing or cooling schedule of the SA algorithm. The main disadvantage of SA is that there is not a rigorous theoretical foundation for determining the parameters of the cooling schedule. The choice of these parameters is highly problem dependent and the designer needs to experiment in order to determine values that will provide a good optimization in a reasonable amount of computational time. This experimentation can absorb a large amount of time especially when the algorithm is being applied to a new type of design. In order to eliminate this disadvantage, a variation of SA known as discrete-state simulated annealing (DSSA), was recently developed. DSSA provides the theoretical foundation for a generic cooling schedule which is problem independent, Results of similar quality to SA can be obtained, but without the extra computational time required to tune the cooling parameters. Two algorithm variations based on DSSA were developed and programmed into a Microsoft Excel spreadsheet graphical user interface (GUI) to the two-dimensional nonlinear multisignal helix traveling-wave amplifier analysis program TWA3. The algorithms were used to optimize the computed RF efficiency of a TWT by determining the phase velocity profile of the slow-wave circuit. The mathematical theory and computational details of the DSSA algorithms will be presented and results will be compared to those obtained with a SA algorithm.

Wilson, Jeffrey D.↗

A block-based algorithm for the solution of compressible flows in rotor-stator combinations

A block-based solution algorithm is developed for the solution of compressible flows in rotor-stator combinations. The method allows concurrent solution of multiple solution blocks in parallel machines. It also allows a time averaged interaction at the stator-rotor interfaces. Numerical results are presented to illustrate the performance of the algorithm. The effect of the interaction between the stator and rotor is evaluated.

Akay, H. U.↗

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing CAD geometry during surface meshing for CFD are discussed. File translation, inconsistent geometry engines and non-native point construction are all identified as sources of non-robustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing. The native approach is demonstrated through an algorithm for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. The algorithm terminates after achieving a prespecified measure of mesh quality and produces a triangulation such that no angle is less than a given angle bound, a or greater than pi - 2alpha. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

Computational Workbench for Multibody Dynamics

PyCraft is a computer program that provides an interactive, workbenchlike computing environment for developing and testing algorithms for multibody dynamics. Examples of multibody dynamic systems amenable to analysis with the help of PyCraft include land vehicles, spacecraft, robots, and molecular models. PyCraft is based on the Spatial-Operator- Algebra (SOA) formulation for multibody dynamics. The SOA operators enable construction of simple and compact representations of complex multibody dynamical equations. Within the Py-Craft computational workbench, users can, essentially, use the high-level SOA operator notation to represent the variety of dynamical quantities and algorithms and to perform computations interactively. PyCraft provides a Python-language interface to underlying C++ code. Working with SOA concepts, a user can create and manipulate Python-level operator classes in order to implement and evaluate new dynamical quantities and algorithms. During use of PyCraft, virtually all SOA-based algorithms are available for computational experiments.

Edmonds, Karina↗

Use of non-spherical gravity harmonics for relative motion GN/C (category 2)

Detailed analysis of the Automatic Rendezvous and Capture problem indicate a need for three different regions of mathematical description for the GN&C algorithms: (1) multi-vehicle orbital mechanics to the rendezvous interface point, i.e., within 100 nm; (2) relative motion solutions (such as Clohessy-Wiltshire type) from the far-field to the near-field interface, i.e., within 1 nm and; (3) close proximity motion - the near-field motion where the relative differences in the gravitational and orbit inertial accelerations can be neglected from the equations of motion. Limit boundaries to these regions can be precisely defined by further analysis and will be functions of the tracking measurement accuracies and the computer resources available for the solution of the algorithms. This paper analyzes the relative motion in Regions 2 and 3 above and present the derivation and discussion of the general case of non-spherical gravitational perturbed relative motion. Mathematical deviations from the numerically integrated spherical gravity case and solutions from the Clohessy-Wiltshire equations are presented in the analysis. Based upon this preliminary analysis, it is recommended that further efforts be used to assess the relative position and velocity differences in Region 2 due to non-spherical gravity harmonics and that viable GN&C algorithms be developed to include these gravity perturbations (especially the effects of the first gravity harmonic, J2).

Henderson, David M.↗

The Optimization of Trained and Untrained Image Classification Algorithms for Use on Large Spatial Datasets

The HARVIST project seeks to automatically provide an accurate, interactive interface to predict crop yield over the entire United States. In order to accomplish this goal, large images must be quickly and automatically classified by crop type. Current trained and untrained classification algorithms, while accurate, are highly inefficient when operating on large datasets. This project sought to develop new variants of two standard trained and untrained classification algorithms that are optimized to take advantage of the spatial nature of image data. The first algorithm, harvist-cluster, utilizes divide-and-conquer techniques to precluster an image in the hopes of increasing overall clustering speed. The second algorithm, harvistSVM, utilizes support vector machines (SVMs), a type of trained classifier. It seeks to increase classification speed by applying a "meta-SVM" to a quick (but inaccurate) SVM to approximate a slower, yet more accurate, SVM. Speedups were achieved by tuning the algorithm to quickly identify when the quick SVM was incorrect, and then reclassifying low-confidence pixels as necessary. Comparing the classification speeds of both algorithms to known baselines showed a slight speedup for large values of k (the number of clusters) for harvist-cluster, and a significant speedup for harvistSVM. Future work aims to automate the parameter tuning process required for harvistSVM, and further improve classification accuracy and speed. Additionally, this research will move documents created in Canvas into ArcGIS. The launch of the Mars Reconnaissance Orbiter (MRO) will provide a wealth of image data such as global maps of Martian weather and high resolution global images of Mars. The ability to store this new data in a georeferenced format will support future Mars missions by providing data for landing site selection and the search for water on Mars.

Kocurek, Michael J.↗

Multimodal neuroelectric interface development

We are developing electromyographic and electroencephalographic methods, which draw control signals for human-computer interfaces from the human nervous system. We have made progress in four areas: 1) real-time pattern recognition algorithms for decoding sequences of forearm muscle activity associated with control gestures; 2) signal-processing strategies for computer interfaces using electroencephalogram (EEG) signals; 3) a flexible computation framework for neuroelectric interface research; and d) noncontact sensors, which measure electromyogram or EEG signals without resistive contact to the body.

Evaluation Studies↗