Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Local time stepping”

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 109 records · Page 6

Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments

This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments. In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE-SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE-SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agents and moving obstacles. Simulation results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.

Bandyopadhyay, Saptarshi↗

Distributed Spatiotemporal Motion Planning for Spacecraft Swarms in Cluttered Environments

This paper focuses on trajectory planning for spacecraft swarms in cluttered environments, like debris fields or the asteroid belt. Our objective is to reconfigure the spacecraft swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. In our prior work we proposed a novel distributed guidance algorithm for spacecraft swarms in static environments.1 In this paper, we present the Multi-Agent Moving-Obstacles Spherical Expansion and Sequential Convex Programming (MAMO SE–SCP) algorithm that extends our prior work to include spatiotemporal constraints such as time-varying, moving obstacles and desired time-varying terminal positions. In the MAMO SE–SCP algorithm, each agent uses a spherical-expansion-based sampling algorithm to cooperatively explore the time-varying environment, a distributed assignment algorithm to agree on the terminal position for each agent, and a sequential-convex-programming-based optimization step to compute the locally-optimal trajectories from the current location to the assigned time-varying terminal position while avoiding collision with other agent and the moving obstacles. Simulations results demonstrate that the proposed distributed algorithm can be used by a spacecraft swarm to achieve a time-varying, desired formation around an object of interest in a dynamic environment with many moving and tumbling obstacles.

Hadaegh, Fred Y.↗

Accuracy and stability of time-split finite-difference schemes

In a recently published work by Abarbanel and Gottlieb (1980), a new class of explicit time-split algorithms designed for application to the compressible Navier-Stokes equations was developed. These algorithms, which utilize locally-one-dimensional (LOD) spatial steps, were shown to possess stability characteristics superior to those of other time-split schemes. In the present work, the properties of an implicit LOD method, analogous to the Abarbanel-Gottlieb algorithm, are examined using the two-dimensional heat conduction equation as the test problem. Both temporal and spatial inconsistencies inherent in the scheme are identified, and a new consistent, implicit splitting approach is developed and applied to the linear Burgers' equation. The relationship between this new method and other time-split implicit schemes is explained and stability problems encountered with the method in three dimensions are discussed.

Dwoyer, D. L.↗

Global/local methods for probabilistic structural analysis

A probabilistic global/local method is proposed to reduce the computational requirements of probabilistic structural analysis. A coarser global model is used for most of the computations with a local more refined model used only at key probabilistic conditions. The global model is used to establish the cumulative distribution function (cdf) and the Most Probable Point (MPP). The local model then uses the predicted MPP to adjust the cdf value. The global/local method is used within the advanced mean value probabilistic algorithm. The local model can be more refined with respect to the g1obal model in terms of finer mesh, smaller time step, tighter tolerances, etc. and can be used with linear or nonlinear models. The basis for this approach is described in terms of the correlation between the global and local models which can be estimated from the global and local MPPs. A numerical example is presented using the NESSUS probabilistic structural analysis program with the finite element method used for the structural modeling. The results clearly indicate a significant computer savings with minimal loss in accuracy.

Millwater, H. R.↗

Modal analysis of multistage gear systems coupled with gearbox vibrations

An analytical procedure to simulate vibrations in gear transmission systems is presented. This procedure couples the dynamics of the rotor-bearing gear system with the vibration in the gear box structure. The model synthesis method is used in solving the overall dynamics of the system, and a variable time-stepping integration scheme is used in evaluating the global transient vibration of the system. Locally each gear stage is modeled as a multimass rotor-bearing system using a discrete model. The modal characteristics are calculated using the matrix-transfer technique. The gearbox structure is represented by a finite element models, and modal parameters are solved by using NASTRAN. The rotor-gear stages are coupled through nonlinear compliance in the gear mesh while the gearbox structure is coupled through the bearing supports of the rotor system. Transient and steady state vibrations of the coupled system are examined in both time and frequency domains. A typical three-geared system is used as an example for demonstration of the developed procedure.

Choy, F. K.↗

Computer implemented empirical mode decomposition method apparatus, and article of manufacture utilizing curvature extrema

A computer implemented physical signal analysis method is includes two essential steps and the associated presentation techniques of the results. All the steps exist only in a computer: there are no analytic expressions resulting from the method. The first step is a computer implemented Empirical Mode Decomposition to extract a collection of Intrinsic Mode Functions (IMF) from nonlinear, nonstationary physical signals based on local extrema and curvature extrema. The decomposition is based on the direct extraction of the energy associated with various intrinsic time scales in the physical signal. Expressed in the IMF's, they have well-behaved Hilbert Transforms from which instantaneous frequencies can be calculated. The second step is the Hilbert Transform. The final result is the Hilbert Spectrum. Thus, the invention can localize any event on the time as well as the frequency axis. The decomposition can also be viewed as an expansion of the data in terms of the IMF's. Then, these IMF's, based on and derived from the data, can serve as the basis of that expansion. The local energy and the instantaneous frequency derived from the IMF's through the Hilbert transform give a full energy-frequency-time distribution of the data which is designated as the Hilbert Spectrum.

Huang, Norden Eh↗

High-Frequency Secondary Instabilities Downstream of a Forward-Facing Step

Localized high-frequency velocity fluctuations were measured downstream of a forward-facing step on a 30◦swept flat plate with an imposed pressure gradient. Phase-locked time-resolved particle image velocimetry measurements were performed to determine the source of the fluctuations, which ultimately lead to transition. The steps result in localized regions of reversed flow for a short region downstream of the step. These regions are highly localized due to the impact of the stationary crossflow vortices. The velocity fluctuations typically increase significantly in amplitude shortly downstream of reattachment in these localized regions, indicating that the fluctuations are related to reattachment of the shear layer. The phase-averaged measurements confirm that the unsteadiness in the shear layer results in the shedding of a plethora of vortices, some oriented in the streamwise direction, and others in the spanwise direction. These vortices are impacted by the local properties of the mean flow, such as streamwise vorticity and streamwise velocity gradient. The origin of the unsteadiness in the shear layer is not definitively shown, but evidence suggests it is due to a shear-layer instability. Ultimately, the unsteadiness of the shear layer, and the vortices that are shed as a result of this unsteadiness, are responsible for transition in this scenario.

Jenna L Eppink↗

Analysis of Preconditioning and Relaxation Operators for the Discontinuous Galerkin Method Applied to Diffusion

The explicit stability constraint of the discontinuous Galerkin method applied to the diffusion operator decreases dramatically as the order of the method is increased. Block Jacobi and block Gauss-Seidel preconditioner operators are examined for their effectiveness at accelerating convergence. A Fourier analysis for methods of order 2 through 6 reveals that both preconditioner operators bound the eigenvalues of the discrete spatial operator. Additionally, in one dimension, the eigenvalues are grouped into two or three regions that are invariant with order of the method. Local relaxation methods are constructed that rapidly damp high frequencies for arbitrarily large time step.

Atkins, H. L.↗

Computer implemented empirical mode decomposition method, apparatus and article of manufacture

A computer implemented physical signal analysis method is invented. This method includes two essential steps and the associated presentation techniques of the results. All the steps exist only in a computer: there are no analytic expressions resulting from the method. The first step is a computer implemented Empirical Mode Decomposition to extract a collection of Intrinsic Mode Functions (IMF) from nonlinear, nonstationary physical signals. The decomposition is based on the direct extraction of the energy associated with various intrinsic time scales in the physical signal. Expressed in the IMF's, they have well-behaved Hilbert Transforms from which instantaneous frequencies can be calculated. The second step is the Hilbert Transform. The final result is the Hilbert Spectrum. Thus, the invention can localize any event on the time as well as the frequency axis. The decomposition can also be viewed as an expansion of the data in terms of the IMF's. Then, these IMF's, based on and derived from the data, can serve as the basis of that expansion. The local energy and the instantaneous frequency derived from the IMF's through the Hilbert transform give a full energy-frequency-time distribution of the data which is designated as the Hilbert Spectrum.

Huang, Norden E.↗

Local and Remote Sources of Precipitation during the 1993 Midwestern United States Flood

During June and July of 1993, devastating and persistent rainfall caused substantial damage in the Midwest United States primarily focused on the Mississippi River Basin. Above noma1 springtime rains primed the region for flooding. The resulting wet soil was thought to be a major source of water for the heavy summer precipitation. On the other hand, northward moisture transport was extremely intense during the summer. In this study, we have implemented passive tracers to diagnose the geographic source of water for precipitation, called Water Vapor Tracers (WVT), into the NASA Data Assimilation Office (DAO) Data Assimilation System (DAS). The WVT diagnostics can produce detailed budgets of the geographical sources of water that precipitates in any region, and they consider physical and dynamical tendencies at the model time step. The 1993 summer has been reanalyzed with the new WVT diagnostics to better understand the local and remote source of water for precipitation during the flood. Because the DAS also uses observations of water in the atmospheric hydrologic budget, we will also evaluate the impact of the observations on the local and remote sources of water in the DAS.

Bosilovich, Michael↗

QUICR-learning for Multi-Agent Coordination

Coordinating multiple agents that need to perform a sequence of actions to maximize a system level reward requires solving two distinct credit assignment problems. First, credit must be assigned for an action taken at time step t that results in a reward at time step t > t. Second, credit must be assigned for the contribution of agent i to the overall system performance. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning. The second credit assignment problem is typically addressed by creating custom reward functions. To address both credit assignment problems simultaneously, we propose the "Q Updates with Immediate Counterfactual Rewards-learning" (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. QUICR-learning is based on previous work on single-time-step counterfactual rewards described by the collectives framework. Results on a traffic congestion problem shows that QUICR-learning is significantly better than a Q-learner using collectives-based (single-time-step counterfactual) rewards. In addition QUICR-learning provides significant gains over conventional and local Q-learning. Additional results on a multi-agent grid-world problem show that the improvements due to QUICR-learning are not domain specific and can provide up to a ten fold increase in performance over existing methods.

Agogino, Adrian K.↗

An upwind differencing scheme for the time-accurate incompressible Navier-Stokes equations

The two-dimensional incompressible Navier-Stokes equations are solved in a time-accurate manner in using the method of pseudocompressibility. Using this method, subiterations in pseudotime are required to satisfy the continuity equation at each time step. An upwind differencing scheme based on flux-difference splitting is used to compute the convective terms. The upwind differencing is biased based on the sign of the local eigenvalue of the Jacobian matrix. Third-order or fifth-order spatial accuracy is maintained throughout the interior grid points. The equations are solved using an implicit line-relaxation scheme. This solution scheme is stable and is capable of running at large time steps in pseudotime, leading to fast convergence for each physical time step. A variety of computed results are presented to validate the present scheme. Results for the flow over an oscillating plate are compared with the exact analytic solution, good agreement is seen. Excellent comparison is obtained between the computed solution and the analytical results for inviscid channel flow with an oscillating back pressure. Flow solutions over a circular cylinder with vortex shedding are also presented. Finally, the flow past an airfoil at -90 deg angle-of-attack is also computed.

Rogers, Stuart E.↗

Time-marching solution of incompressible Navier-Stokes equations for internal flow

Primitive variables with central differencing on a staggered grid are used in the present, factored ADI finite-difference scheme for artificial compressibility method solution of the incompressible Navier-Stokes equations, leading to a close coupling between velocity and pressure that both enhances stability and eliminates the need for artificial damping. Computational efficiency is enhanced through the use of a spatially variable, fixed Courant number-based time-step. The numerical results obtained for a driven cavity at Re of 10,000, with local cell Re as high as 100, exhibits no flow variable spatial oscillations on a 40 x 40 stretched grid solution.

Soh, W. Y.↗

An adaptive multigrid model for hurricane track prediction

This paper describes a simple numerical model for hurricane track prediction which uses a multigrid method to adapt the model resolution as the vortex moves. The model is based on the modified barotropic vorticity equation, discretized in space by conservative finite differences and in time by a Runge-Kutta scheme. A multigrid method is used to solve an elliptic problem for the streamfunction at each time step. Nonuniform resolution is obtained by superimposing uniform grids of different spatial extent; these grids move with the vortex as it moves. Preliminary numerical results indicate that the local mesh refinement allows accurate prediction of the hurricane track with substantially less computer time than required on a single uniform grid.

Fulton, Scott R.↗

Methodology for Designing Fault-Protection Software

A document describes a methodology for designing fault-protection (FP) software for autonomous spacecraft. The methodology embodies and extends established engineering practices in the technical discipline of Fault Detection, Diagnosis, Mitigation, and Recovery; and has been successfully implemented in the Deep Impact Spacecraft, a NASA Discovery mission. Based on established concepts of Fault Monitors and Responses, this FP methodology extends the notion of Opinion, Symptom, Alarm (aka Fault), and Response with numerous new notions, sub-notions, software constructs, and logic and timing gates. For example, Monitor generates a RawOpinion, which graduates into Opinion, categorized into no-opinion, acceptable, or unacceptable opinion. RaiseSymptom, ForceSymptom, and ClearSymptom govern the establishment and then mapping to an Alarm (aka Fault). Local Response is distinguished from FP System Response. A 1-to-n and n-to- 1 mapping is established among Monitors, Symptoms, and Responses. Responses are categorized by device versus by function. Responses operate in tiers, where the early tiers attempt to resolve the Fault in a localized step-by-step fashion, relegating more system-level response to later tier(s). Recovery actions are gated by epoch recovery timing, enabling strategy, urgency, MaxRetry gate, hardware availability, hazardous versus ordinary fault, and many other priority gates. This methodology is systematic, logical, and uses multiple linked tables, parameter files, and recovery command sequences. The credibility of the FP design is proven via a fault-tree analysis "top-down" approach, and a functional fault-mode-effects-and-analysis via "bottoms-up" approach. Via this process, the mitigation and recovery strategy(s) per Fault Containment Region scope (width versus depth) the FP architecture.

Barltrop, Kevin↗

Finite element Euler calculations of unsteady transonic cascade flows

A Galerkin finite element procedure incorporating an explicit Runge-Kutta time-stepping scheme has been developed in this work to solve unsteady transonic flow in cascades. The computational domain is discretized by a globally unstructured but locally structured blade-fitted deformable mesh. The Galerkin approximation is applied to the unsteady Euler equations based on a mixed Eulerian-Lagrangian description. The semi-discretized equations are integrated forward in time using a multistage Runge-Kutta scheme. An artificial dissipation operator of the type proposed by Jameson is adapted in the current scheme to capture shocks and suppress nonphysical oscillations. Phase-shifted boundary conditions are used to reduce the computational domain to a single reference passage. Results for both steady and unsteady transonic flows through cascades are presented and compared to existing finite volume solutions.

Hsiao, Chingteng↗

Ground-Based Localization of Mars Rovers

The document discusses a procedure for localizing the Mars rovers in site frame, a locally defined reference frame on the Martian surface. MER onboard position within a site frame is estimated onboard and is based on wheel odometry. Odometry estimation of rover position is only reliable over relatively short distances assuming no wheel slip, sinkage, etc. As the rover traverses, its onboard estimate of position in the current site frame accumulates errors and will need to be corrected on occasions via relocalization on the ground (mission operations). The procedure provides a systematic process for ground operators to localize the rover. The method focuses on analysis of acquired images used to declare a site frame and images acquired post-drive. Target selection is performed using two main steps. In the first step, the user identifies features of interest from the images used to declare the current site. Each of the selected target s position in site frame is recorded. In the second step, post-traverse measurements of the selected features positions are recorded again, this time in rover frame, using images acquired post-traverse. In the third step, we transform the post-traverse target s positions to local level frame. In the fourth step, we compute the delta differences in the pre- and post-traverse target s position. In the fifth step, we analyze the delta differences with techniques that compute their statistics to determine the rover s position in the site frame.

Trebi-Ollennu, Ashitey↗

Efficient Multi-Stage Time Marching for Viscous Flows via Local Preconditioning

A new method has been developed to accelerate the convergence of explicit time-marching, laminar, Navier-Stokes codes through the combination of local preconditioning and multi-stage time marching optimization. Local preconditioning is a technique to modify the time-dependent equations so that all information moves or decays at nearly the same rate, thus relieving the stiffness for a system of equations. Multi-stage time marching can be optimized by modifying its coefficients to account for the presence of viscous terms, allowing larger time steps. We show it is possible to optimize the time marching scheme for a wide range of cell Reynolds numbers for the scalar advection-diffusion equation, and local preconditioning allows this optimization to be applied to the Navier-Stokes equations. Convergence acceleration of the new method is demonstrated through numerical experiments with circular advection and laminar boundary-layer flow over a flat plate.

Kleb, William L.↗