Search NASA⌕ Search

SEARCH · Search NASA

Results for “tracking problem”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Data association algorithm for large-scale multi-object tracking with complex interactions

We present an online multi-object tracking algorithm to track multiple objects across a large number of image frames. Our work is motivated by the need to study evolution of nanoscale objects by transmission electron microscopy. The proposed approach is based on the existing multi-way data association tracking algorithm that is capable of tracking interacting objects with complex behaviors (i.e., merge, split, overlap, and appearance or disappearance). The multi-way data association is an offline algorithm to associate objects across all image frames at one step with a global optimization, which does not scale very well for large number of image frames. The proposed online tracking algorithm processes image frames as they arrive by detecting all objects in the newly arrived image frame and making the associations of the objects to those detected from the previous frame by the multi-way data association. This frameby-frame association scheme can cause fragmented traces of the objects that are occasionally misdetected for some image frames. We overcome this issue by allowing previously unassociated objects to be associated when the objects reappear within a fixed number of future image frames, namely the frame-delayed association. We combine the multi-way data association with the frame-delayed association to be able to track interacting objects with accurate handling of object disappearance events. The proposed method is validated through applications to simulated multi-object tracking problem and a real multi-object tracking problem. Here, the outcome of the proposed method is compared with four state-of-the-art algorithms.

36 MATERIALS SCIENCE↗
DOE OSTI2020

ML Track Fitting in Nuclear Physics

Charged particle tracking represents the largest consumer of CPU resources in high data volume Nuclear Physics (NP) experiments. An effort is underway to develop machine learning (ML) networks that will reduce the resources required for charged particle tracking. Tracking in NP experiments represent some unique challenges compared to high energy physics (HEP). In particular, track finding typically represents only a small fraction of the overall tracking problem in NP. This presentation will outline the differences and similarities between NP and HEP charged particle tracking and areas where ML learning may provide a benefit. The status of the specific effort taking place at Jefferson Lab will also be shown.

Britton, Thomas↗
DOE OSTI2024

Design, Selection, and Evaluation of Reinforcement Learning Single Agents for Ground Target Tracking

Previous approaches for small fixed-wing unmanned air systems that carry strapdown rather than gimbaled cameras achieved satisfactory ground target tracking performance using both standard and deep reinforcement learning algorithms. However, these approaches have significant restrictions and abstractions to the dynamics of the vehicle, such as constant airspeed and constant altitude, because the number of states and actions was necessarily limited. Thus, extensive tuning was required to obtain good tracking performance. The expansion from 4 state–action degrees of freedom to 15 enabled the agent to exploit previous reward functions that produced novel yet undesirable emergent behavior. This paper investigates the causes of and various potential solutions to undesirable emergent behavior in the ground target tracking problem. A combination of changes to the environment, reward structure, action space simplification, command rate, and controller implementation provides insight into obtaining stable tracking results. Consideration is given to reward structure selection and refinement to mitigate undesirable emergent behavior. Results presented in the paper for a simulated environment of a single unmanned air system tracking a randomly moving single ground target show that a soft actor–critic algorithm can produce feasible tracking trajectories without limiting the state space and action space, provided that the environment is properly posed.

Engineering↗
DOE OSTI2023

Development of a dynamical model and energy analysis for wheel loader

The objective of this paper is to develop a fully integrated model for the wheel loader, including the subsystem dynamics of the engine, drivetrain, working circuit, steering circuit, and vehicle. It leads to a high-order strongly nonlinear system, and all state variables are coupled together to form a Multi-Input and Multi-Output (MIMO) system. A control architecture is proposed to decouple the MIMO system into several Single-Input and Single-Output (SISO) systems. Here, a tracking problem has been formulated to validate this fully integrated model with the field test data. The accuracy of the model is verified by the 2.3% difference between the measured and simulated fuel consumption. Meanwhile, an energy distribution analysis is conducted to reveal the energy consumption and energy loss of each portion of the wheel loader. Such a model can be used to plan the working pattern, guide the driving habits of human operators, or refine the underlying architecture, leading to the ultimate goal of reducing total fuel consumption and improving productivity.

42 ENGINEERING↗
DOE OSTI2023

End-to-End Pipeline for Trigger Detection on Hit and Track Graphs

There has been a surge of interest in applying deep learning in particle and nuclear physics to replace labor-intensive offline data analysis with automated online machine learning tasks. This paper details a novel AI-enabled triggering solution for physics experiments in Relativistic Heavy Ion Collider and future Electron-Ion Collider. The triggering system consists of a comprehensive end-to-end pipeline based on Graph Neural Networks that classifies trigger events versus background events, makes online decisions to retain signal data, and enables efficient data acquisition. Here, the triggering system first starts with the coordinates of pixel hits lit up by passing particles in the detector, applies three stages of event processing (hits clustering, track reconstruction, and trigger detection), and labels all processed events with the binary tag of trigger versus background events. By switching among different objective functions, we train the Graph Neural Networks in the pipeline to solve multiple tasks: the edge-level track reconstruction problem, the edge-level track adjacency matrix prediction, and the graph-level trigger detection problem. We propose a novel method to treat the events as track-graphs instead of hit-graphs. This method focuses on intertrack relations and is driven by underlying physics processing. As a result, it attains a solid performance (around 72% accuracy) for trigger detection and outperforms the baseline method using hit-graphs by 2% higher accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Reactive particle-tracking solutions to a benchmark problem on heavy metal cycling in lake sediments

Geochemical systems are known to exhibit highly variable spatiotemporal behavior. This may be observed both in non-smooth concentration curves in space for a single sampling time and also in variability between samples taken from the same location at different times. However, most models that are designed to simulate these systems provide only single-solution smooth curves and fail to capture the noise and variability seen in the data. We apply a recently developed reactive particle-tracking method to a system that displays highly complex geochemical behavior. When the method is made to most closely resemble a corresponding Eulerian method, in its unperturbed form, we see near-exact match between solutions of the two models. More importantly, we consider two approaches for perturbing the model and find that the spatially-perturbed condition is able to capture a greater degree of the variability present in the data. This method of perturbation is a task to which particle methods are uniquely suited and Eulerian models are not well-suited. Additionally, because of the nature of the algorithm, noisy spatial gradients can be highly resolved by a large number of mobile particles, and this incurs negligible computational cost, as compared to expensive chemistry calculations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Accurately simulating nine-dimensional phase space of relativistic particles in strong fields

Next-generation high-power laser systems that can be focused to ultra-high intensities exceeding 10 23 W/cm 2 are enabling new physics regimes and applications. The physics of how these lasers interact with matter is highly nonlinear, relativistic, and can involve lowest-order quantum effects. The current tool of choice for modeling these interactions is the particle-in-cell (PIC) method. In the presence of strong electromagnetic fields, the motion of charged particles and their spin is affected by radiation reaction (either the semi-classical or the quantum limit). Standard (PIC) codes usually use Boris or similar operator-splitting methods to advance the particles in standard phase space. These methods have been shown to require very small time steps in the strong-field regime in order to obtain accurate results. In addition, some problems require tracking the spin of particles, which creates a nine-dimensional (9D) particle phase space, i.e., (x, u, s). Therefore, numerical algorithms that enable high-fidelity modeling of the 9D phase space in the strong-field regime (where both the spin and momentum evolution are affected by radiation reaction) are desired. Here we present a new particle pusher that works in 9D and 6D phase space (i.e., with and without spin) based on analytical rather than leapfrog solutions to the momentum and spin advance from the Lorentz force, together with the semi-classical form of radiation reaction in the Landau-Lifshitz equation and spin evolution given by the Bargmann-Michel-Telegdi equation. Analytical solutions for the position advance are also obtained, but these are not amenable to the staggering of space and time in standard PIC codes. These analytical solutions are obtained by assuming a locally uniform and constant electromagnetic field during a time step. The solutions provide the 9D phase space advance in terms of a particle's proper time, and a mapping is used to determine the proper time step duration for each particle as a function of the lab frame time step. Due to the analytical integration of particle trajectory and spin orbit, the constraint on the time step needed to resolve trajectories in ultra-high fields can be greatly reduced. The time step required in a PIC code for accurately advancing the fields may provide additional constraints. We present single-particle simulations to show that the proposed particle pusher can greatly improve the accuracy of particle trajectories in 6D or 9D phase space for given laser fields. We have implemented the new pusher into the PIC code Osiris. Example simulations show that the proposed pusher provides improvement for a given time step. A discussion on the numerical efficiency of the proposed pusher is also provided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum tracking control of the orientation of symmetric-top molecules

The goal of quantum tracking control is to identify shaped fields to steer observable expectation values along designated time-dependent tracks. The fields are determined via an iteration-free procedure, which is based on inverting the underlying dynamical equations governing the controlled observables. In this paper, we generalize the ideas in [Phys. Rev. A 98, 043429 (2018)] to the task of orienting symmetric top molecules in three dimensions. To this end, we derive equations for the control fields capable of directly tracking the expected value of the three-dimensional dipole orientation vector along a desired path in time. In conclusion, we show this framework can be utilized for tracking the orientation of linear molecules as well, and present numerical illustrations of these principles for symmetric-top tracking control problems.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Multiresolution GPC-Structured Control of a Single-Loop Cold-Flow Chemical Looping Testbed

Chemical looping is a near-zero emission process for generating power from coal. It is based on a multi-phase gas-solid flow and has extremely challenging nonlinear, multi-scale dynamics with jumps, producing large dynamic model uncertainty, which renders traditional robust control techniques, such as linear parameter varying H ∞ design, largely inapplicable. This process complexity is addressed in the present work through the temporal and the spatiotemporal multiresolution modeling along with the corresponding model-based control laws. Namely, the nonlinear autoregressive with exogenous input model structure, nonlinear in the wavelet basis, but linear in parameters, is used to identify the dominant temporal chemical looping process dynamics. The control inputs and the wavelet model parameters are calculated by optimizing a quadratic cost function using a gradient descent method. The respective identification and tracking error convergence of the proposed self-tuning identification and control schemes, the latter using the unconstrained generalized predictive control structure, is separately ascertained through the Lyapunov stability theorem. The rate constraint on the control signal in the temporal control law is then imposed and the control topology is augmented by an additional control loop with self-tuning deadbeat controller which uses the spatiotemporal wavelet riser dynamics representation. The novelty of this work is three-fold: (1) developing the self-tuning controller design methodology that consists in embedding the real-time tunable temporal highly nonlinear, but linearly parametrizable, multiresolution system representations into the classical rate-constrained generalized predictive quadratic optimal control structure, (2) augmenting the temporal multiresolution loop by a more complex spatiotemporal multiresolution self-tuning deadbeat control loop, and (3) demonstrating the effectiveness of the proposed methodology in producing fast recursive real-time algorithms for controlling highly uncertain nonlinear multiscale processes. The latter is shown through the data from the implemented temporal and augmented spatiotemporal solutions of a difficult chemical looping cold flow tracking control problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Comparison of nested geometry treatments within GPU-based Monte Carlo neutron transport simulations of fission reactors

Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic tracker types with different tracking algorithms to exploit the repeated configurations of reactors, but virtual function calls have high overhead on the GPU. The Shift MC code was modified to support GPU-based tracking with three strategies: dynamic polymorphism with virtual functions, static polymorphism, and a single tracker type with tree-based acceleration. On the Frontier supercomputer these methods achieve 77.8%, 91.2%, and 83.4%, respectively, of the tracking rate obtained using a specialized tracker optimized for rectilinear-grid-based reactors. This indicates that all three methods are suitable for typical reactor problems in which tracking does not dominate runtime. The flexibility of the single tracker method is highlighted with a hexagonal-grid microreactor problem, performed without hexagonal-grid-specific tracking routines, providing a 2.19× speedup over CPU execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Deep Reinforcement Learning for Automatic Generation Control of Wind Farms

This paper provides a model-free framework for real-time control of wind farms to accurately track a power reference signal. This problem requires tractable dynamical models for capturing the aerodynamic interaction between wind turbines and controllers that can make decisions in realtime given varying atmospheric conditions. In this paper, we propose a deep reinforcement learning framework to provide real-time yaw control of a wind farm. Modifications have been made to FLOw Redirection and Induction in Steady State (FLORIS), a modeling tool that incorporates transient wake behavior. The control problem is formulated to track a synthetic power reference signal based on historical atmospheric (wind speed and direction) information, price signals, and regulation deployment data from U.S. regional transmission operators. Results indicate that a wind farm, with this control paradigm, can achieve good tracking performance when tested with real atmospheric data.

49 EE - Wind and Water Power Program - Wind (EE-4W↗
DOE OSTI2021

The Tracking Machine Learning challenge : Throughput phase

This paper reports on the second "Throughput" phase of the Tracking Machine Learning (TrackML) challenge on the Codalab platform. As in the first "Accuracy" phase, the participants had to solve a difficult experimental problem linked to tracking accurately the trajectory of particles as e.g. created at the Large Hadron Collider (LHC): given O($10^5$) points, the participants had to connect them into O($10^4$) individual groups that represent the particle trajectories which are approximated helical. While in the first phase only the accuracy mattered, the goal of this second phase was a compromise between the accuracy and the speed of inference. Both were measured on the Codalab platform where the participants had to upload their software. The best three participants had solutions with good accuracy and speed an order of magnitude faster than the state of the art when the challenge was designed. Although the core algorithms were less diverse than in the first phase, a diversity of techniques have been used and are described in this paper. The performance of the algorithms are analysed in depth and lessons derived.

Amrouche, Sabrina↗
DOE OSTI2025

Siting bioenergy facilities in the United States: Measuring participation in decisions and distribution of effects

Scientists and stakeholders can inform the process of siting renewable energy facilities in ways that do not perpetuate socioeconomic disparities associated with fossil fuel industries or create new ones. Procedural justice indicators and distributional justice indicators that incorporate environmental, social, and economic objectives can be used to site energy facilities in ways that increase benefits and reduce negative impacts to disadvantaged and underserved populations. A generic list of potential energy justice indicators for siting bioenergy facilities was developed collaboratively between U.S. bioenergy researchers and diverse agriculture, energy, and energy and environmental justice stakeholders and experts. From this list smaller numbers of indicators can be selected or modified with communities for local siting of bioenergy facilities. Groups of indicators can be used to guide biorefinery or biopower siting and permitting decisions, e.g., to compare siting options, to draw early attention to key problems, or to track progress toward justice-related targets.

09 BIOMASS FUELS↗
DOE OSTI2021

Using Machine Learning to Track Objects Across Cameras

Video surveillance is one of the most important technologies used by the International Atomic Energy Agency in international safeguards. At large, complicated facilities, multiple surveillance cameras are deployed to monitor the transfer of safeguards-relevant objects across the site. During inspections, all surveillance videos are reviewed to ensure the objects are not manipulated or diverted during transfer, a laborious, time-consuming task. This work describes using deep machine learning algorithms to track objects automatically across multiple cameras, greatly improving the efficiency of the review process. The fundamental problem in this object tracking task across multiple cameras is how to associate the same object, which may show extreme intra-class variations, such as viewpoints, occlusions, and various scales, in different and even non-overlapped cameras. Object re-identification (Re-ID) in nuclear facility video surveillance is even more challenging than classic person or vehicle Re-ID problems because different instances in the same category may display an identical appearance. One observation from nuclear facility surveillance videos is that all objects must be carted (e.g., via forklift) to move. Therefore, the spatial context information of an object, which provides the feature from the carrier, is critical for the object Re-ID task. This work proposes a two-stream convolutional neural networks model that takes features of objects and their surrounding regions into account. Moreover, the custom videos usually are gleaned from different scenes from the training data, which may have extreme variations in illumination changes and/or cluttered backgrounds. Directly applying the trained model to custom videos will dramatically decrease the performance. To tackle this problem, an advanced domain adaptation technique is proposed to mitigate the gap between the data taken from different scenes. The proposed framework will track objects of interest across a nuclear complex. The resulting tracks can be used in further analyses, such as event/activity recognition, anomaly detection, etc.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2022

Muon track reconstruction in a segmented bolometric array using multi-objective optimization

Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless double-beta decay or direct dark matter detection, such experiments also have the capability to search for exotic particles that leave track-like signatures across their volume. However, the segmented nature of such detector arrays often sets the spatial resolution and makes the problem of reconstructing track-like paths non-trivial. Here, in this paper, we present an algorithm that improves reconstruction of track-like events in segmented detectors using multi-objective optimization — a computational technique that optimizes more than one cost function at a time without specifying a quantitative weighting between them. Such a technique allows the reconstruction of tracks through a detector and the determination of path-lengths through individual elements. When combined with the reconstructed energy depositions in each element this allows for a calculation of the stopping power of track-like particles and opens the door to searches for particles with abnormal stopping power like monopoles or lightly-ionizing particles (LIPs). Results are presented which evaluate the precision of the reconstruction tools as they currently stand against Monte Carlo generated data. The algorithm is presented in the context of the CUORE experiment, but has applications to other segmented calorimeter detectors.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Improvements to Contributions from Neutron Inelastic Scattering for Next-Event Estimators in MCNP ® Software

An improvement to the handling of contributions from neutron inelastic scattering to next-event estimators has been implemented in the MCNP6 ® software for release with version 6.3.1. The kinematic equations that govern the outgoing energy of inelastic neutron scattering contributions to next-event estimators have two roots. Historically, the implementation in the MCNP coding has only used the upper root to the quadratic equation. This includes all versions predating version 6.3.1 including all versions of MCNP5 and MCNPX software. However, a review of the neutron next-event estimator physics has shown that this does not reproduce the track-length estimator results at low energies. Several examples are presented that test single neutron inelastic scattering reaction types, Level Scattering (Law 3), Tabulated Energy Angle (Law 61), and Kalbach-Mann distribution (Law 44). The test problems compare the track-length estimator (f4 tally) in the MCNP software, with the existing implementation of the neutron next-event estimator (f5 tally), and the modified changes to the neutron next-event estimator implementation. As the MCNP implementation ignores the lower root, the unmodified neutron next-event estimators will generally underestimate the lower energy contribution. However, a second issue with the Kalbach-Mann distribution (Law 44) implementation allows contributions to backward scattering in the center-of-mass frame that is not kinematically possible, thus overestimating backward scattering contributions. A third issue with the way the MCNP implementation handles floating point comparison for scattering directly ahead or directly backward in the center-of-mass frame generally leads to underestimation (except for backwards scattering for Law 44).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Emulation of radiation transport in 3D stochastic media using 1D planar Monte Carlo stochastic media radiation transport algorithms

A subset of stochastic media radiation transport problems involves those in which radiation is incident on a thin slab of stochastic material. Particle tracking in 3D for such problems is expensive, and 1D planar models lack accuracy because they only allow the material to change in one dimension. Therefore, we propose dimensional emulation, which through a slight modification allows existing 1D planar geometry stochastic media radiation transport models to reproduce results from the equivalent 3D models by allowing the material to change in all three dimensions, reproducing the fidelity of the 3D model for the low computational cost of the 1D planar model. In this work, we apply dimensional emulation to three Monte Carlo stochastic media radiation transport models: Chord Length Sampling (CLS), the Local Realization Preserving method (LRP), and a variant of Conditional Point Sampling (CoPS). For a common Markovian benchmark set, the 3D emulation variants of these algorithms are numerically verified to reproduce the results of the 3D variants within statistics while running 1.3 to 2 times faster in the implementation within Sandia National Laboratories open-source research code PlaybookMC. The 3D emulation variants are also shown to yield a 72%–92% reduction in error for the thin slab problems in comparison to the 1D benchmark. As a result, the 3D emulation variant of CLS and CoPS-1 are shown to reproduce 3D CLS results that were used to approximate results for a 3D spherical inclusion geometry benchmark set.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗