Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scalable Model”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Communication

NASA s communication work for the UAS Command and Control area will build upon work currently being conducted under NASA Recovery Act funds. Communication portions of UAS NextGen ConOps, Stateof- the-Art assessment, and Gap Analysis. Preliminary simulations for UAS CNPC link scalability assessment. Surrogate UAS aircraft upgrades. This work will also leverage FY10 in-guide funding for communication link model development. UAS are currently managed through exceptions and are operating using DoD frequencies for line-of-sight (LOS) and satellite-based communications links, low-power LOS links in amateur bands, or unlicensed Instrument/Scientific/Medical (ISM) frequencies. None of these frequency bands are designated for Safety and Regularity of Flight. No radio-frequency (RF) spectrum has been allocated by the International Telecommunications Union (ITU) specifically for UAS command and control links, for either LOS or Beyond LOS (BLOS) communication.

Griner, James↗
NASA NTRS2017

Achieving Agreement in Three Rounds with Bounded-Byzantine Faults

A three-round algorithm is presented that guarantees agreement in a system of K greater than or equal to 3F+1 nodes provided each faulty node induces no more than F faults and each good node experiences no more than F faults, where, F is the maximum number of simultaneous faults in the network. The algorithm is based on the Oral Message algorithm of Lamport, Shostak, and Pease and is scalable with respect to the number of nodes in the system and applies equally to traditional node-fault model as well as the link-fault model. We also present a mechanical verification of the algorithm focusing on verifying the correctness of a bounded model of the algorithm as well as confirming claims of determinism.

Malekpour, Mahyar, R.↗
NASA NTRSDate not supplied

Observing Supraglacial Lakes Using Deep Learning and PlanetScope Imagery

Supraglacial lakes (SGL)s result from melt water accumulation in topographic depressions on the surface of glaciers. SGLs primarily affect glacial dynamics through a positive feedback loop in which the albedo-lowering effect of SGLs can escalate surface melt leading to increases in lake extent and depth, amplifying the afore mentioned albedo-lowering effect. The implications of accelerated glacial melt include increased sea level rise and modifications to ocean primary productivity. SGLs are critical indicators of surface melt and its downstream impacts and should be monitored efficiently. In situ observations and measurements of SGLs are time consuming, cost-prohibitive and difficult to scale. Earth observation data and machine learning enable scalable monitoring of SGLs through pattern detection and quantification of lake evolution over time [1]. This work presents a model developed by training a convolutional neural network with imagery and labels from NASA Operation IceBridge and predicting SGLs in high temporal and spatial resolution PlanetScope imagery.

Supraglacial lake↗
NASA NTRS2024

A Fair, Economically-Efficient, Incentive-Aligned, Scalable Airspace Auction Mechanism for UAV Traffic Management

Unmanned Aerial Vehicles (UAVs) are increasingly used in a wide range of applications such as cinematography, package delivery, and surveying. As a result, regulators have become interested in developing UAV Traffic Management (UTM) systems to coordinate UAV traffic. One possible framework for UTM is a combinatorial auction. Under this framework, airspace is modeled as a grid of space-time cells. UAV operators bid on sets of cells which collectively form flight paths for their UAVs. An ideal airspace auction should: be fair, be incentive-aligned, be scalable, allocate airspace economically-efficiently, enable price discovery, and reduce the work required to participate where possible. In this paper, we propose the first auction mechanism for airspace allocation that meets the criteria above. Our mechanism: (a) is provably economically-efficient, fair and incentive-aligned, (b) shares pricing information with bidders and (c) has features which reduce the burden of participating. We evaluate our mechanism on scenarios based on a Japan Aerospace Exploration Agency (JAXA) case study and find that it can scale to 26,000 bids.

Robert Allan Morris↗
NASA NTRS1988

Lab tests of a thermomechanical pump for shoot

Laboratory tests of a thermomechanical (TM) pump utilizing a commercially available porous disk have been conducted. Various size disks, heater configurations, and outlet flow impedances have been used to characterize scale models of the pump proposed for the Superfluid Helium On-Orbit Transfer (SHOOT) Flight Experiment. The results yield the scalability of the TM pump to larger diameters, and hence larger pumping rates, the dependence of flow rate on back pressure and heater power, and the limits of pumping speed due to internal losses within the porous disk due to mutual and superfluid friction. Analysis indicates that for low back pressures the flow rate is limited by the superfluid friction rather than the mutual friction. For the porous plug used in the early tests this amounts to a practical limit of 4.4 liters per hour per square centimeter. For a baselined flight plug area of 180 sq cm this yields 790 liters per hour.

Dipirro, Michael J.↗
NASA NTRS2002

Program Instrumentation and Trace Analysis

Several attempts have been made recently to apply techniques such as model checking and theorem proving to the analysis of programs. This shall be seen as a current trend to analyze real software systems instead of just their designs. This includes our own effort to develop a model checker for Java, the Java PathFinder 1, one of the very first of its kind in 1998. However, model checking cannot handle very large programs without some kind of abstraction of the program. This paper describes a complementary scalable technique to handle such large programs. Our interest is turned on the observation part of the equation: How much information can be extracted about a program from observing a single execution trace? It is our intention to develop a technology that can be applied automatically and to large full-size applications, with minimal modification to the code. We present a tool, Java PathExplorer (JPaX), for exploring execution traces of Java programs. The tool prioritizes scalability for completeness, and is directed towards detecting errors in programs, not to prove correctness. One core element in JPaX is an instrumentation package that allows to instrument Java byte code files to log various events when executed. The instrumentation is driven by a user provided script that specifies what information to log. Examples of instructions that such a script can contain are: 'report name and arguments of all called methods defined in class C, together with a timestamp'; 'report all updates to all variables'; and 'report all acquisitions and releases of locks'. In more complex instructions one can specify that certain expressions should be evaluated and even that certain code should be executed under various conditions. The instrumentation package can hence be seen as implementing Aspect Oriented Programming for Java in the sense that one can add functionality to a Java program without explicitly changing the code of the original program, but one rather writes an aspect and compiles it into the original program using the instrumentation. Another core element of JPaX is an observation package that supports the analysis of the generated event stream. Two kinds of analysis are currently supported. In temporal analysis the execution trace is evaluated against formulae written in temporal logic. We have implemented a temporal logic evaluator on finite traces using the Maude rewriting system from SRI International, USA. Temporal logic is defined in Maude by giving its syntax as a signature and its semantics as rewrite equations. The resulting semantics is extremely efficient and can handle event streams of hundreds of millions events in few minutes. Furthermore, the implementation is very succinct. The second form of even stream analysis supported is error pattern analysis where an execution trace is analyzed using various error detection algorithms that can identify error-prone programming practices that may potentially lead to errors in some different executions. Two such algorithms focusing on concurrency errors have been implemented in JPaX, one for deadlocks and the other for data races. It is important to note, that a deadlock or data race potential does not need to occur in order for its potential to be detected with these algorithms. This is what makes them very scalable in practice. The data race algorithm implemented is the Eraser algorithm from Compaq, however adopted to Java. The tool is currently being applied to a code base for controlling a spacecraft by the developers of that software in order to evaluate its applicability.

Havelund, Klaus↗
NASA NTRS2010

The Emergence of Agent-Based Technology as an Architectural Component of Serious Games

The evolution of games as an alternative to traditional simulations in the military context has been gathering momentum over the past five years, even though the exploration of their use in the serious sense has been ongoing since the mid-nineties. Much of the focus has been on the aesthetics of the visuals provided by the core game engine as well as the artistry provided by talented development teams to produce not only breathtaking artwork, but highly immersive game play. Consideration of game technology is now so much a part of the modeling and simulation landscape that it is becoming difficult to distinguish traditional simulation solutions from game-based approaches. But games have yet to provide the much needed interactive free play that has been the domain of semi-autonomous forces (SAF). The component-based middleware architecture that game engines provide promises a great deal in terms of options for the integration of agent solutions to support the development of non-player characters that engage the human player without the deterministic nature of scripted behaviors. However, there are a number of hard-learned lessons on the modeling and simulation side of the equation that game developers have yet to learn, such as: correlation of heterogeneous systems, scalability of both terrain and numbers of non-player entities, and the bi-directional nature of simulation to game interaction provided by Distributed Interactive Simulation (DIS) and High Level Architecture (HLA).

Phillips, Mark↗
NASA NTRS2015

Achieving Agreement in Three Rounds With Bounded-Byzantine Faults

A three-round algorithm is presented that guarantees agreement in a system of K (nodes) greater than or equal to 3F (faults) +1 nodes provided each faulty node induces no more than F faults and each good node experiences no more than F faults, where, F is the maximum number of simultaneous faults in the network. The algorithm is based on the Oral Message algorithm of Lamport et al. and is scalable with respect to the number of nodes in the system and applies equally to the traditional node-fault model as well as the link-fault model. We also present a mechanical verification of the algorithm focusing on verifying the correctness of a bounded model of the algorithm as well as confirming claims of determinism.

Malekpour, Mahyar R.↗
NASA NTRSDate not supplied

Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking

The expanding presence in space will place an increased dependency on networked communications– a scalable communications infrastructure; that is, the Solar System Internet (SSI). Upcoming developments towards a SSI include NASA’s upcoming LunaNet, or lunar Internet, which provides multi-hop multi-path communications using Delay Tolerant Networking (DTN). DTN has been an active area of research and development, particularly in routing, security, and optimization. DTNs are marked by mobility, disconnection, and a wide variance of latencies (propagation and processing delays). In this paper, we outline progress towards a theory of time synchronization across such a network. An underlying assumption of DTN is that the network is time synchronized already, rather than synchronization being provided as a service. While this is necessary for schedule-based routing, which is necessarily prevalent in DTNs, it is so deeply ingrained as to be built into the primary unit of data in DTNs– the bundle. Indeed, a bundle’s creation timestamp and its time to live (called the lifetime) are based on time, and there are special recommendations for systems that lack accurate clocks. The assumption of time synchronization makes sense when limiting considerations to smaller-scale and more traditional space communication. However, just as end-to-end connectivity cannot be guaranteed in DTNs, neither can access to a reference or authoritative clock. In this more general case, it might be necessary to synchronize over time-varying meshes, and perhaps even to consider relativistic effects. Moreover, by imposing synchronization restrictions in order to sustain a network, the effectiveness of the network to achieve scalability will be necessarily muted. To work towards a time synchronization theory for DTNs, we build upon past successes in modeling DTNs using time-varying graphs and sheaves. This includes error and limitation estimation, which allows one to define domains over which schedule-based routing is possible, up to some threshold sensitivity. Despite the theoretical nature of these results, the approaches taken are also algorithmic, and hence lend themselves to practical implementations. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay Tolerant Networking↗
NASA NTRSDate not supplied

Assessment of Remote Pilot Maneuver Taskload under Multi-Vehicle Control

Multi-vehicle control schemes where a number of remote pilots (m) supervise a number of uncrewed vehicles (m:N) are desired to enable scalability of operations, such as air cargo delivery, in the face of pilot shortage and other constraints. We use queuing models derived from historical track data to assess the increased task load on a remote pilot due to maneuvering demands as the number of supervised vehicles increase. We quantify metrics such as the probability that the inter-maneuver time and inter-communication time.

Multi-Vehicle Control↗
NASA NTRSDate not supplied

CoCoSim Tutorial: Contract-based Compositional Verification of Simulink Models

This tutorial presents CoCoSim, a verification framework for MATLAB Simulink and Stateflow models. We demonstrate CoCoSim’s architecture, designed to be compatible with Lustre-based verification tools, as well as easily extensible to other candidate backends. We focus on CoCoSim’s powerful compositional verification scheme, which allows for scalable verification through the usage of abstractions of subsystems, express ed in the form of Assume-Guarantee Contracts. We show CoCoSim’s interconnection with NASA’s Formal Requirements Tool (FRET), that enables a seamless transition between authoring and formally verifying requirements for Simulink/Stateflow models. Finally, we discuss work in progress with regards to test case generation options in CoCoSim, demonstrating the generation of MC/DC tests for Simulink artifacts.

Formal Verification↗
NASA NTRS2016

Cloud-Based Orchestration of a Model-Based Power and Data Analysis Toolchain

The proposed Europa Mission concept contains many engineering and scientific instruments that consume varying amounts of power and produce varying amounts of data throughout the mission. System-level power and data usage must be well understood and analyzed to verify design requirements. Numerous cross-disciplinary tools and analysis models are used to simulate the system-level spacecraft power and data behavior. This paper addresses the problem of orchestrating a consistent set of models, tools, and data in a unified analysis toolchain when ownership is distributed among numerous domain experts. An analysis and simulation environment was developed as a way to manage the complexity of the power and data analysis toolchain and to reduce the simulation turnaround time. A system model data repository is used as the trusted store of high-level inputs and results while other remote servers are used for archival of larger data sets and for analysis tool execution. Simulation data passes through numerous domain-specific analysis tools and end-to-end simulation execution is enabled through a web-based tool. The use of a cloud-based service facilitates coordination among distributed developers and enables scalable computation and storage needs, and ensures a consistent execution environment. Configuration management is emphasized to maintain traceability between current and historical simulation runs and their corresponding versions of models, tools and data.

Post, Ethan↗
NASA NTRSDate not supplied

AI-Enhanced Computational Tools for Entry Systems Modeling

To advance the understanding of complex atmospheric entry phenomena, NASA’s Entry Systems Modeling (ESM) team [1] has developed high-fidelity computational tools addressing multiscale challenges, from material microstructures to full-scale heatshield response. This abstract highlights a subset of ESM tools, focusing on AI integration to enhance workflows and predictive modeling. - PuMA [2] computes effective material properties from high-resolution micro-CT scans, supporting TPS analysis for NASA missions. - TomoSAM [3] automates 3D tomography dataset segmentation for PuMA using the Segment Anything Model, reducing manual effort and improving accuracy. - PATO [4] models porous reactive materials under extreme conditions, with advancements such as unified solvers, mechanical erosion, and TPS coatings for NASA missions. - arcjetCV [5] employs deep learning to analyze arc jet test footage, measuring recession rates, shape changes, and shock standoff distances, bridging simulations, and experiments to reveal TPS ablation behavior. - ARCHeS [6] simulates arc heater plasma flows, modeling turbulence, radiation, and electromagnetic interactions to optimize arc heater performance, validate TPS under extreme conditions, and serve as a foundation for developing digital twins of arc heater facilities. - SPARTA [7] simulates rarefied hypersonic flows and gas-surface interactions for planetary entry missions, leveraging GPU architectures for scalable and efficient aerothermal and ablation analyses. AI-driven solutions, such as deep learning segmentation, have streamlined workflows in ESM tools and still hold significant potential to further accelerate processes and enhance automation in entry systems modeling. [1] Haskins, J.B. (2023), [2] Ferguson, J.C. (2018), [3] Meurisse, J.B.E. (2018), [4] Semeraro, F. (2023), [5] Quintart, A. (2024) [6] Meurisse, J.B.E. (2022), [7] Plimpton, S.J. (2019)

Predictive Modeling↗
NASA NTRS2010

A Hardware Model Validation Tool for Use in Complex Space Systems

One of the many technological hurdles that must be overcome in future missions is the challenge of validating as-built systems against the models used for design. We propose a technique composed of intelligent parameter exploration in concert with automated failure analysis as a scalable method for the validation of complex space systems. The technique is impervious to discontinuities and linear dependencies in the data, and can handle dimensionalities consisting of hundreds of variables over tens of thousands of experiments.

Davies, Misty Dawn↗
NASA NTRS2018

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗
NASA NTRS2007

Symbolic LTL Compilation for Model Checking: Extended Abstract

In Linear Temporal Logic (LTL) model checking, we check LTL formulas representing desired behaviors against a formal model of the system designed to exhibit these behaviors. To accomplish this task, the LTL formulas must be translated into automata [21]. We focus on LTL compilation by investigating LTL satisfiability checking via a reduction to model checking. Having shown that symbolic LTL compilation algorithms are superior to explicit automata construction algorithms for this task [16], we concentrate here on seeking a better symbolic algorithm.We present experimental data comparing algorithmic variations such as normal forms, encoding methods, and variable ordering and examine their effects on performance metrics including processing time and scalability. Safety critical systems, such as air traffic control, life support systems, hazardous environment controls, and automotive control systems, pervade our daily lives, yet testing and simulation alone cannot adequately verify their reliability [3]. Model checking is a promising approach to formal verification for safety critical systems which involves creating a formal mathematical model of the system and translating desired safety properties into a formal specification for this model. The complement of the specification is then checked against the system model. When the model does not satisfy the specification, model-checking tools accompany this negative answer with a counterexample, which points to an inconsistency between the system and the desired behaviors and aids debugging efforts.

Rozier, Kristin Y.↗
NASA NTRS2008

Distributed Aviation Concepts and Technologies

Aviation has experienced one hundred years of evolution, resulting in the current air transportation system dominated by commercial airliners in a hub and spoke infrastructure. While the first fifty years involved disruptive technologies that required frequent vehicle adaptation, the second fifty years produced a stable evolutionary optimization of decreasing costs with increasing safety. This optimization has resulted in traits favoring a centralized service model with high vehicle productivity and cost efficiency. However, it may also have resulted in a system that is not sufficiently robust to withstand significant system disturbances. Aviation is currently facing rapid change from issues such as environmental damage, terrorism threat, congestion and capacity limitations, and cost of energy. Currently, these issues are leading to a loss of service for weaker spoke markets. These catalysts and a lack of robustness could result in a loss of service for much larger portions of the aviation market. The impact of other competing transportation services may be equally important as casual factors of change. Highway system forecasts indicate a dramatic slow down as congestion reaches a point of non-linearly increasing delay. In the next twenty-five years, there is the potential for aviation to transform itself into a more robust, scalable, adaptive, secure, safe, affordable, convenient, efficient and environmentally friendly system. To achieve these characteristics, the new system will likely be based on a distributed model that enables more direct services. Short range travel is already demonstrating itself to be inefficient with a centralized model, providing opportunities for emergent distributed services through air-taxi models. Technologies from the on-demand revolution in computers and communications are now available as major drivers for aviation on-demand adaptation. Other technologies such as electric propulsion are currently transforming the automobile industry, and will also significantly alter the functionality of future distributed aviation concepts. Many hurdles exist, including technology, regulation, and perception. Aviation has an inherent governmental role not present in other recent on-demand transformations, which may pose a risk of curtailing aviation democratization .

Moore, Mark D.↗