An adaptable spacecraft telemetry system.
Centralized Flexible Automatic Computer Telemetry System /FACTS/ for spacecraft, providing capability of revising sampling structure
SEARCH · Engineering Papers
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.
Centralized Flexible Automatic Computer Telemetry System /FACTS/ for spacecraft, providing capability of revising sampling structure
Thanks to recent advances in the fields of anisotropic grid adaptation, error estimation, and geometry modeling, a sketch-to-solution work flow is now possible for viscous computational fluid dynamic (CFD) simulations. With this workflow, a CFD application engineer provides geometry, boundary conditions, and flow parameters; and the sketch-to-solution process yields a CFD simulation through automatic, error-based, grid adaptation. To explore the benefits of this nascent capability, a conventional manual grid generation work flow is compared to this new automatic grid generation work flow for a given engineering question: What are the aerodynamic interactions caused by the reaction control system (RCS) on an entry vehicle? This case study indicates that while the automatic grid generation sketch-to- solution process is not yet mature, it is preferred over a manual grid generation work flow because it greatly reduces manual labor, eliminates many opportunities for human error, and provides grid sensitivity information.
The ability to dynamically adapt an unstructured mesh is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive numerical computations in a message-passing environment. PLUM requires that all data be globally redistributed after each mesh adaption to achieve load balance. We present an algorithm for minimizing this remapping overhead by guaranteeing an optimal processor reassignment. We also show that the data redistribution cost can be significantly reduced by applying our heuristic processor reassignment algorithm to the default mapping of the parallel partitioner. Portability is examined by comparing performance on a SP2, an Origin2000, and a T3E. Results show that PLUM can be successfully ported to different platforms without any code modifications.
Structural damage identification based on physical models is often transformed into an optimization problem that minimizes the difference between measurement information of structure being monitored and the model prediction in the parametric space. However, the objective function in this context often exhibits multimodality, involving high-dimensional variables due to the reliance on finite element models for damage identification. These features pose challenges to optimization algorithms, where entrapment in local solutions can lead to false positives and false negatives in damage identification. In this research, we propose a reinforcement learning based multi-swarm optimizer to tackle such challenges in pursuit of a small yet diverse solution set that can capture the true damage scenario as one of the solutions. The proposed method leverages the flexibility of the particle swarm optimizer and incorporates novel strategies of metaheuristics to realize targeted improvement. To enable the particle swarm to adaptively select the appropriate search strategy based on the current environment, we adopt the learning automata technique, which sidesteps the need for reward strategy selection that is usually ad hoc at each step of the search. The integration harnesses the automatic learning and self-adaptation capabilities of learning automata, enabling the particles to navigate based on environmental signals. This leads to accumulated probabilities tied to advantageous movements, fostering an adaptive exploration of particles in the search space. The proposed approach is first validated through implementing into benchmark test cases with comparisons. It is then applied to structural damage identification with piezoelectric admittance experimental signals. `The results highlight the capability of the algorithm to identify a small solution set with high accuracy to match the actual damage scenario.
Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.
Simulations of the Air Force Research Laboratory (AFRL) Modular Axisymmetric Scramjet Test Rig (MASTeR) are presented. MASTeR is a parametric test article capable of investigating various scramjet cavity flameholder designs and fueling strategies with the goal to characterize and optimize flameholding capability. In the current work, three cavity aspect ratios, and two fueling strategies (upstream and in-cavity) with ethylene at a nominal facility pressure and temperature condition are evaluated. The reacting simulations are performed, and the resulting flow characteristics are discussed. For each configuration and fueling strategy, cavity residence time, entrainment rate, and fuel-air equivalence ratio are computed. The MASTeR geometry is defined in Engineering Sketch Pad (ESP) and the simulations use a sketch-to-solution (S2S) automated unstructured grid adaptation tool in VULCAN-CFD. This tool automatically generates a simulation grid from the ESP geometry and systematically adapts it to the numerical solution based on the Hessian error estimate of a specified flow field parameter. Reynolds averaged simulations (RAS) are used with a two-equation linear eddy viscosity and diffusivity model. The resulting database can be compared with the experimental data as those become available, and explored to develop models for cavity performance for scramjet propulsion design applications.
Simulations of the Air Force Research Laboratory (AFRL) Modular Axisymmetric Scramjet Test Rig (MASTeR) are presented. MASTeR is a parametric test article capable of investigating various scramjet cavity flameholder designs and fueling strategies with the goal to characterize and optimize flameholding capability. In the current work, three cavity aspect ratios, three depths, and two fueling strategies (upstream and in-cavity) with ethylene at a nominal facility pressure and temperature conditions are evaluated. The simulations are performed for mixing-only and reacting flows, and the resulting flow characteristics are compared. For each configuration and fueling strategy, cavity residence time, entrainment rate, and fuel-air equivalence ratio are computed. The MASTeR geometry is defined in the Engineering Sketch Pad (ESP) and the simulations use a sketch-to-solution (S2S) automated unstructured grid adaptation tool in VULCAN-CFD. This tool automatically generates a simulation grid from the ESP geometry and systematically adapts it to the numerical solution based on the Hessian error estimate of a specified flow field parameter. Reynolds averaged simulations (RAS) are used with typical two-equation linear eddy viscosity and diffusivity model. The resulting database can be compared with the experimental data as those becomes available and explored to develop models for cavity performance for scramjet propulsion design applications.
Design procedures for VTOL automatic control systems have been developed and are presented. Using linear-optimal estimation and control techniques as a starting point, digital-adaptive control laws have been designed for the VALT Research Aircraft, a tandem-rotor helicopter which is equipped for fully automatic flight in terminal area operations. These control laws are designed to interface with velocity-command and attitude-command guidance logic, which could be used in short-haul VTOL operations. Developments reported here include new algorithms for designing non-zero-set-point digital regulators, design procedures for rate-limited systems, and algorithms for dynamic control trim setting.
Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.
Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.
Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.
Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.
Tensor decomposition is an effective approach to compress over-parameterized neural networks and to enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the training process is a challenging task due to the difficulty of choosing a proper tensor rank. In order to address this challenge, this paper proposes a low-rank Bayesian tensorized neural network. Our Bayesian method performs automatic model compression via an adaptive tensor rank determination. We also present approaches for posterior density calculation and maximum a posteriori (MAP) estimation for the end-to-end training of our tensorized neural network. Here, we provide experimental validation on a two-layer fully connected neural network, a 6-layer CNN and a 110-layer residual neural network where our work produces 7.4x to 137x more compact neural networks directly from the training while achieving high prediction accuracy.
Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.
Physical and deployment factors that influence infrasound signal detection and assess automatic detection performance for a regional infrasound network of arrays in the Western U.S. are explored using signatures of ground truth (GT) explosions (yields). Despite these repeated known sources, published infrasound event bulletins contain few GT events. Arrays are primarily distributed toward the south-southeast and south-southwest at distances between 84 and 458 km of the source with one array offering azimuthal resolution toward the northeast. Events occurred throughout the spring, summer, and fall of 2012 with the majority occurring during the summer months. Depending upon the array, automatic detection, which utilizes the adaptive F-detector successfully, identifies between 14% and 80% of the GT events, whereas a subsequent analyst review increases successful detection to 24%–90%. Combined background noise quantification, atmospheric propagation analyses, and comparison of spectral amplitudes determine the mechanisms that contribute to missed detections across the network. This analysis provides an estimate of detector performance across the network, as well as a qualitative assessment of conditions that impact infrasound monitoring capabilities. Finally, the mechanisms that lead to missed detections at individual arrays contribute to network-level estimates of detection capabilities and provide a basis for deployment decisions for regional infrasound arrays in areas of interest.
Autotest is a flexible, fully automatic, programmable test system. It is externally controlled by a mnemonic test language. Once started, tests can run to completion without further manual intervention. Autotest can be operated manually as well as in automatic mode. Autotest can be adapted to a wide variety of test requirements. Though originally designed to test the Atmosphere Explorer (AE) spacecraft and experiments, autotest can easily be modified to test any electronic device suitable for automated computer testing.
Attention is given to supervisory control of remote manipulation, an automatic device for measuring viscoelasticity, adaptable programmable assembly systems for teleoperator applications, and proximity sensor technology for manipulator end effectors. Also considered are control and stability problems of remote orbital capture, orbital servicing and remotely manned systems, gray-level transformations for interactive image enhancement, and the design of a three-fingered hand
Equalization filters designed to minimize the mean square error between a delayed version of the original electrical signal and the equalized response at a point in a room have previously been investigated. In general, such a strategy degrades the response at positions in a room away from the equalization point. A method is presented for designing an equalization filter by adjusting the filter coefficients to minimize the sum of the squares of the errors between the equalized responses at multiple points in the room and delayed versions of the original, electrical signal. Such an equalization filter can give a more uniform frequency response over a greater volume of the enclosure than can the single point equalizer above. Computer simulation results are presented of equalizing the frequency responses from a loudspeaker to various typical ear positions, in a room with dimensions and acoustic damping typical of a car interior, using the two approaches outlined above. Adaptive filter algorithms, which can automatically adjust the coefficients of a digital equalization filter to achieve this minimization, will also be discussed.