Search NASA⌕ Search

SEARCH · Search NASA

Results for “Real-time simulation”

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 613 records · Page 34

Metabolic rate control during extravehicular activity simulations and measurement techniques during actual EVAS

A description of the methods used to control and measure metabolic rate during ground simulations is given. Work levels attained at the Space Environment Simulation Laboratory are presented. The techniques and data acquired during ground simulations are described and compared with inflight procedures. Data from both the Skylab and Apollo Program were utilized and emphasis is given to the methodology, both in simulation and during flight. The basic techniques of work rate assessment are described. They include oxygen consumption, which was useful for averages over long time periods, heart rate correlations based on laboratory calibrations, and liquid cooling garment temperature changes. The relative accuracy of these methods as well as the methods of real-time monitoring at the Mission Control Center are discussed. The advantages and disadvantages of each of the metabolic measurement techniques are discussed. Particular emphasis is given to the problem of utilizing oxygen decrement for short time periods and heart rate at low work levels. A summary is given of the effectiveness of work rate control and measurements; and current plans for future EVA monitoring are discussed.

David J. Horrigan↗

Design and implementation of a telecommunication interface for the TAATM/TCV real-time experiment

The traffic situation display experiment of the terminal configured vehicle (TCV) research program requires a bidirectional data communications tie line between an computer complex. The tie line is used in a real time environment on the CYBER 175 computer by the terminal area air traffic model (TAATM) simulation program. Aircraft position data are processed by TAATM with the resultant output sent to the facility for the generation of air traffic situation displays which are transmitted to a research aircraft.

Nolan, J. D.↗

The effectiveness of incorporating a real-time oculometer system in a commercial flight training program

The effectiveness on pilot and trainee performance and scanning behavior of incorporating a real time oculometer system in a commerical flight training program was assessed. Trainees received simulator training in pairs requiring the trainees to alternate the order of training within a session. The 'third day phenomenon' of performance decrement was investigated, including the role of order of training on performance.

Jones, D. H.↗

Development and evaluation of a Kalman-filter algorithm for terminal area navigation using sensors of moderate accuracy

Translational state estimation in terminal area operations, using a set of commonly available position, air data, and acceleration sensors, is described. Kalman filtering is applied to obtain maximum estimation accuracy from the sensors but feasibility in real-time computations requires a variety of approximations and devices aimed at minimizing the required computation time with only negligible loss of accuracy. Accuracy behavior throughout the terminal area, its relation to sensor accuracy, its effect on trajectory tracking errors and control activity in an automatic flight control system, and its adequacy in terms of existing criteria for various terminal area operations are examined. The principal investigative tool is a simulation of the system.

Kanning, G.↗

Algorithms for real-time flutter identification

The work reported here addresses the important algorithm issues necessary to achieve a real-time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of overparameterization, and estimate accuracy predictions, both online and for experiment design. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds has been developed. This enables a convincing comparison of theoretical and simulation results, as well as off-line studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA/Dryden Drones for Aerodynamic and Structural Test (DAST) Program are compared.

Walker, R. A.↗

A Kalman filter algorithm for terminal-area navigation with sensors of moderate accuracy

Translational state estimation in terminal area operations, using a set of commonly available position, air data, nd acceleration sensors, is described. Kalman filtering is applied to obtain maximum estimation occuracy from the sensors but feasibility in real-time computations requires a variety of approximations and devices aimed at minimizing the required computation time with only negligible loss of accuracy. Accuracy behavior throughout the terminal area, its relation to sensor accuracy, its effect on trajectory tracking errors and control activity in an automatic flight control system, and its adequacy in terms of existing criteria for various terminal area operations are examined. The principal investigative tool is a simulation of the system. Previously announced in STAR as N83-29193

Cicolani, L. S.↗

Real-time flutter analysis

The important algorithm issues necessary to achieve a real time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of over parameterization, and estimate accuracy predictions, both online and for experiment design are addressed. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds were developed. This enables a convincing comparison of theoretical and simulation results, as well as offline studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA Drones for Aerodynamic and Structural Test (DAST) Program are compared.

Walker, R.↗

Real-time flutter identification

The techniques and a FORTRAN 77 MOdal Parameter IDentification (MOPID) computer program developed for identification of the frequencies and damping ratios of multiple flutter modes in real time are documented. Physically meaningful model parameterization was combined with state of the art recursive identification techniques and applied to the problem of real time flutter mode monitoring. The performance of the algorithm in terms of convergence speed and parameter estimation error is demonstrated for several simulated data cases, and the results of actual flight data analysis from two different vehicles are presented. It is indicated that the algorithm is capable of real time monitoring of aircraft flutter characteristics with a high degree of reliability.

Roy, R.↗

In-flight thrust determination on a real-time basis

A real time computer program was implemented on a F-15 jet fighter to monitor in-flight engine performance of a Digital Electronic Engine Controlled (DEES) F-100 engine. The application of two gas generator methods to calculate in-flight thrust real time is described. A comparison was made between the actual results and those predicted by an engine model simulation. The percent difference between the two methods was compared to the predicted uncertainty based on instrumentation and model uncertainty and agreed closely with the results found during altitude facility testing. Data was obtained from acceleration runs of various altitudes at maximum power settings with and without afterburner. Real time in-flight thrust measurement was a major advancement to flight test productivity and was accomplished with no loss in accuracy over previous post flight methods.

Ray, R. J.↗

Development of a takeoff performance monitoring system

The development and testing of a real-time takeoff performance monitoring system is discussed. The algorithm is madeup of two segments: a pretakeoff segment and a real-time segment. One-time inputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate schedule performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six degree of freedom airplane model in a computer simulation. Results from a series of sensitivity analysis are also included.

Srivatsan, R.↗

A robust adaptive flightpath reconstruction technique

Computational schemes are presented that allow accurate reconstruction of an aircraft's flightpath in real-time. The reconstruction of the flightpath is formulated as a linear state reconstruction problem, which can be solved via Kalman filtering (KF) techniques. This imposes some conditions upon the flight-test equipment. A reliable square root covariance KF (SRCF) implementation is chosen and further developed into a fully adaptive flightpath reconstruction scheme. Therefore, the basic SRCF is modified in order to cope with several practical problems such as: the automatic control of the convergence of the recursive KF calculations, time varying zero-bias errors on the input signal of the system model used in the KF, and the changing aircraft dynamics owing to a change in reference flight condition. The developed solutions for these problems are all implemented in a numerically stable way, which guarantees the overall flightpath reconstruction scheme to be robust. Furthermore, some special features of the used system model are exploited to make the algorithmic implementation very efficient. An experimental simulation study using simulated flight test data demonstrated these different capabilities.

Verhaegen, M. H.↗

Development of a takeoff performance monitoring system

The development and testing of a real-time takeoff performance monitoring system is discussed. The algorithm is made up of two segments: a pretakeoff segment and a real-time segment. One-time inputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate schedule performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six degree of freedom airplane model in a computer simulation. Results from a series of sensitivity analysis are also included.

Srivatsan, R.↗

A multiprocessing architecture for real-time monitoring

A multiprocessing architecture for performing real time monitoring and analysis using knowledge-based problem solving techniques is discussed. To handle asynchronous inputs and perform in real time, the system consists of three or more separate processes which run concurrently on one or more processors and communicate via a message passing scheme. The Data Management Process gathers, compresses, scales and sends the incoming telemetry data to other tasks. The Inference Process consists of a proprietary high performance inference engine that runs at 1000 rules per second using telemetry data to perform real time analysis on the state and health of the Space Telescope. The multiprocessing architecture has been interfaced to a simulator and is able to process the incoming telemetry in real time.

Laffey, Thomas J.↗

Performance limitations in parallel processor simulations

A jet-engine model is partitioned and simulated on a parallel processor system consisting of five 8086/8087 floating-point computers. The simulation uses Heun's integration method. A near-optimal parallel simulation (in the sense of minimum execution time) achieves speedup of only 2.13 and efficiency of 42.6 percent, in effect wasting 57.4 percent of the available processing power. A detailed analysis identifies and graphically demonstrates why the system fails to achieve ideal performance (viz., speedup of 5 and efficiency of 100 percent). Inherent characteristics of the problem equations and solution algorithm account for the loss of nearly half of the available processing power. Overheads associated with interprocessor communication and processor synchronization account for only a small fraction of the lost processing power. The effects of these and other factors which limit parallel processor performance are illustrated through real-time timing-analyzer tracers describing the run/idle status of the parallel processors during the simulation.

O'Grady, E. Pearse↗

Automating Sensor Characterization with Bayesian Optimization

The development of novel instrumentation requires an iterative cycle with three stages: design, prototyping, and testing. Recent advancements in simulation and nanofabrication techniques have significantly accelerated the design and prototyping phases. Nonetheless, detector characterization continues to be a major bottleneck in device development. During the testing phase, a significant time investment is required to characterize the device in different operating conditions and find optimal operating parameters. The total effort spent on characterization and parameter optimization can occupy a year or more of an expert's time. In this work, we present a novel technique for automated sensor calibration that aims to accelerate the testing stage of the development cycle. This technique leverages closed-loop Bayesian optimization (BO), using real-time measurements to guide parameter selection and identify optimal operating states. We demonstrate the method with a novel low-noise CCD, showing that the machine learning-driven tool can efficiently characterize and optimize operation of the sensor in a couple of days without supervision of a device expert.

Cuevas-Zepeda, Julian [Chicago U., KICP; Chicago U↗

Enhancing Security and Resiliency in Operational Technology Environments Through Network Slicing and Federated Learning

The growing convergence of Information Technology (IT) and Operational Technology (OT) within Industry 4.0 environments has introduced new demands on industrial network infrastructure. As cyber-physical systems become increasingly interconnected, ensuring the secure, timely, and efficient exchange of critical data is essential. This thesis explores how network slicing, a method of creating isolated virtual network segments, can be applied within OT environments to address challenges such as latency, security, and resource allocation. The first research question addressed in this thesis is: How can OT networks take advantage of NFV and SDN technology to become cyber resilient? This study examines the operational, security, and architectural implications of introducing network slicing into traditionally static OT infrastructures such as Industrial Control Systems (ICS) and SCADA. Through simulated deployments and case studies, the research demonstrates how slicing enables better isolation between critical and non-critical services, thereby improving response time, throughput, and security in sensitive environments. The second question considers: How to dynamically implement network slicing and take advantage of network resources towards integrating decentralized machine learning? In response, this thesis proposes a framework that combines Software-Defined Networking (SDN), Network Function Virtualization (NFV), and Federated Learning (FL) to enable real-time analytics while maintaining data locality. The proposed approach reduces the burden on centralized infrastructure and minimizes privacy risks by supporting on-site training of models across distributed OT nodes, coordinated through dynamically allocated network slices. The third focus explores: How slicing helps to increase the resiliency of OT networks through the orchestration of a dynamic DMZ? To answer this, the thesis presents a method for creating and managing Dynamic Demilitarized Zones (DMZs) using network slicing. This enables flexible and automated isolation of sensitive subsystems during threat scenarios or high-risk operations. Coupled with intelligent orchestration and containerized security services, the dynamic DMZ significantly enhances the system's ability to respond to cyber incidents without halting production. Ultimately, this thesis contributes a comprehensive architecture that blends network slicing with machine learning, secure segmentation, and automation, paving the way for resilient, adaptive, and intelligent OT environments. Performance evaluations across multiple scenarios show improvements in system reliability, threat response time, model accuracy, and resource utilization, providing a strong foundation for future industrial automation systems.

Rodiles Delgado, Brian G↗

Learning to Trigger: Reinforcement Learning at the Large Hadron Collider

High-throughput scientific facilities such as the Large Hadron Collider depend on real-time event filtering (\textit{triggering}) under tight constraints on bandwidth, latency, and storage. In practice, trigger menus are largely static and hand-tuned and can become suboptimal as detector conditions, pileup, and background composition drift over time. We cast online threshold tuning as a sequential decision-making problem: a reinforcement learning agent ingests streaming summaries of recent rates and signal-sensitive features and updates trigger thresholds to maximize signal efficiency while tracking a target background rate within a tolerance band. We adapt Group-Filtered Policy Optimization (GFPO) to streaming control and introduce two variants (GFPO-F, GFPO-FR) that enforce background rate feasibility during training. On a benchmark that emulates realistic collider operation, we study two representative triggers: a total transverse energy ($H_{T}$) trigger sensitive to pileup variation, and an anomaly-detection (AD) trigger based on reconstruction loss for rare or non-standard signatures. On Monte Carlo streams, our agent increases the fraction of in-tolerance time intervals by 48% ($H_T$) and 28% (AD), with a cumulative gain of up to 2% in signal efficiency on those in-tolerance intervals. Transferring from simulation to \emph{real} collision data (CMS Run 283408), the same agent, without fine-tuning, achieves a 56% ($H_T$) and 28% (AD) in-tolerance improvement over baselines, with further signal-efficiency gain on both triggers. To our knowledge, this is the \emph{first} demonstration of RL-based trigger control on real Large Hadron Collider collision data. Code is available at https://github.com/Zixind/GFPO_LHC (see repo for details).

Ding, Zixin [Chicago U.]↗

Exploration of Real Time Inference for MI-RR Deblending on GPU/TPU Systems

The Fermilab Main Injector (MI) and Recycler Ring (RR) share a common beam loss monitor (BLM) system, making loss events difficult to attribute to their source machine when beam is present in both simultaneously. The Real-time Edge AI for Distributed Systems (READS) project addresses this by deblending BLM readings in real time using machine learning (ML). The current FPGA based implementation meets the sub-3 ms latency requirement but carries a resource intensive hls4ml development cycle, motivating exploration of GPU based deployment. This paper characterizes inference latency on an NVIDIA Jetson Orin Nano and introduces a packet organization scheme for assembling synchronized event frames from seven distributed BLM DAQ streams. Using a Python based DAQ simulation with injected timing jitter in place of unavailable live beam data, the pipeline achieved an average end to end latency of 0.456 ms (σ = 0.122 ms) across 167,000 test frames, comfortably meeting the timing constraint. Early outliers were attributed to TensorRT warm-up rather than steady state limitations, suggesting GPU based inference is a viable alternative to the existing FPGA implementation.

Yu, Kellen [Fermilab; Cornell U.]↗