A study of minimax solutions for Saturn control problems Final report
Chebyshev minimax solutions for Saturn launch vehicle control problems, and hybrid-analog computer realization of algorithm
SEARCH · Search NASA
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.
Chebyshev minimax solutions for Saturn launch vehicle control problems, and hybrid-analog computer realization of algorithm
Significant enhancements are being implemented into the GRIDGEN3D, multiple block, structured grid generation software. Automatic, point-to-point, interblock connectivity will be possible through the addition of the domain entity to GRIDBLOCK's block construction process. Also, the unification of GRIDGEN2D and GRIDBLOCK has begun with the addition of edge grid point distribution capability to GRIDBLOCK. The geometric accuracy of surface grids and the ease with which databases may be obtained is being improved by adding support for standard computer-aided design formats (e.g., PATRAN Neutral and IGES files). Finally, volume grid quality was improved through addition of new SOR algorithm features and the new hybrid control function type to GRIDGEN3D.
The simulation of propulsive flows inherently involves chemical activity. Recent years have seen substantial strides made in the development of numerical schemes for reacting flowfields, in particular those involving finite-rate chemistry. However, finite-rate calculations are computationally intensive and require knowledge of the actual kinetics, which are not always known with sufficient accuracy. Alternatively, flow simulations based on the assumption of local chemical equilibrium are capable of obtaining physically reasonable results at far less computational cost. The present study summarizes the development of efficient numerical techniques for the simulation of flows in local chemical equilibrium, whereby a 'Black Box' chemical equilibrium solver is coupled to the usual gasdynamic equations. The generalization of the methods enables the modelling of any arbitrary mixture of thermally perfect gases, including air, combustion mixtures and plasmas. As demonstration of the potential of the methodologies, several solutions, involving reacting and perfect gas flows, will be presented. Included is a preliminary simulation of the SSME startup transient. Future enhancements to the proposed techniques will be discussed, including more efficient finite-rate and hybrid (partial equilibrium) schemes. The algorithms that have been developed and are being optimized provide for an efficient and general tool for the design and analysis of propulsion systems.
This correspondence presents a hybrid reliability-based decoding algorithm which combines the reprocessing method based on the most reliable basis and a generalized Chase-type algebraic decoder based on the least reliable positions. It is shown that reprocessing with a simple additional algebraic decoding effort achieves significant coding gain. For long codes, the order of reprocessing required to achieve asymptotic optimum error performance is reduced by approximately 1/3. This significantly reduces the computational complexity, especially for long codes. Also, a more efficient criterion for stopping the decoding process is derived based on the knowledge of the algebraic decoding solution.
An efficiently hybrid approach to exploit hyperspectral imagery and unmix spectral pixels. This hybrid approach uses a genetic algorithm to solve the abundance vector for the first pixel of a hyperspectral image cube. This abundance vector is used as initial state in a robust filter to derive the abundance estimate for the next pixel. By using Kalman filter, the abundance estimate for a pixel can be obtained in one iteration procedure which is much fast than genetic algorithm. The output of the robust filter is fed to genetic algorithm again to derive accurate abundance estimate for the current pixel. The using of robust filter solution as starting point of the genetic algorithm speeds up the evolution of the genetic algorithm. After obtaining the accurate abundance estimate, the procedure goes to next pixel, and uses the output of genetic algorithm as the previous state estimate to derive abundance estimate for this pixel using robust filter. And again use the genetic algorithm to derive accurate abundance estimate efficiently based on the robust filter solution. This iteration continues until pixels in a hyperspectral image cube end.
The 2017 Atlantic hurricane season was the 5th most active, featuring 17 named storms, the highest number of major hurricanes since 2005, and by far the costliest season on record. African easterly waves often serve as the seeding circulation for a large portion of hurricanes (i.e. tropical storms with wind over 74mph in the Atlantic and Northeast Pacific). Warm SST, moist air, and low wind shear are the main requirements for tropical cyclones to develop and maintain hurricane strength. In terms of hurricane propagation (so called hurricane tracks), Atlantic hurricanes typically propagate around the periphery of the subtropical ridge called the Bermuda High (Azores High), riding along its strongest winds. If the high is positioned to the east, then hurricanes generally propagate northeastward around the high's western edge into the open Atlantic Ocean without making land fall. If the high is positioned to the west and extends far enough to the south, storms are blocked from curving north and forced to continue west towards Florida, Cuba, and the Gulf of Mexico. If we have accurate atmospheric temperature distribution, which is directly related to atmospheric wave patterns, wind distributions, moisture distribution, and SST distribution in the analyses, we will have better NWP skills in hurricane analyses including hurricane intensity and tracks. Assimilating various observation data are supposed to play these roles in the analyses. To examine impacts of different types of observation data on NASA Goddard Earth Observing System (GEOS) model hurricane analyses and forecasts during the period of 2017 summer, this study performs data denial experiments using GEOS Atmospheric Data Assimilation System (ADAS), which is based on the hybrid 4D-EnVar GSI algorithm. Various types of observations such as microwave sounders, infrared sounders, TCvitals, and conventional data are removed in the experiments. In addition, the interaction between the different observation groups as certain instruments are removed from the analysis is investigated in detail using adjoint based forecast sensitivity observation impact (FSOI).
The maximum principle is applied to minimum-time optimal-control problems, and an optimization algorithm is presented which can be implemented on a hybrid computer. The state and adjoint equations are set up on ASTRAC 2, a high-speed analog computer capable of 1000 differential equation solutions per second. The optimization algorithm is implemented on a PDP-9, an 18-bit, digital computer. The optimization scheme has global and local search phases and uses a vector optimization criterion. Second and third-order bang-bang control systems are studied as examples.
The progress towards the assimilation of hyperspectral infrared radiances affected by clouds in the NASA GEOS system is presented. After positive published results describing the assimilation of adaptively thinned AIRS cloud-cleared radiances in the 3DVAR GEOS, this team has then successfully tested adaptively thinned CrIS and IASI data as well, and then moved to assimilation in a hybrid 4DEnVAR configuration. The latest effort is focused on the creation of a portable, customizable version of the cloud-clearing algorithm that is being tailored for the hybrid 4DEnVAR system.
Coordination of operations with spatially and temporally shared resources such as route segments, fixes, and runways improves the efficiency of terminal airspace management. Problems in this category include scheduling and routing, thus they are normally difficult to solve compared with pure scheduling problems. In order to reduce the computational time, a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA) was introduced in this work and applied to a test case based on existing literature. The experiment showed that new method can solve the whole problem in fast time instead of solving sub-problems sequentially with a window technique. The results showed a 60% or 406 second delay reduction was achieved by sharing departure fixes (more details on the comparison with MILP results will be presented in the final paper). Furthermore, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial segregation, which may introduce unnecessary delays. In this work, spatial segregation, temporal segregation, and hybrid segregation were formulated using the new algorithm. Results showed that spatial and temporal segregation approaches achieved similar delay. Hybrid segregation introduced much less delay than the other two approaches. For a total of 9 interacting departures and arrivals, delay reduction varied from 4 minutes to 6.4 minutes corresponding flight time uncertainty from 0 to 60 seconds. Considering the amount of flights that could be affected, total annual savings with hybrid segregation would be significant.
Near-Earth Objects (NEOs) are comets and/or asteroids that have orbits in proximity with Earth's own orbit. NEOs have collided with the Earth in the past, which can be seen at such places as Chicxulub crater, Barringer crater, and Manson crater, and will continue in the future with potentially significant and devastating results. Fortunately such NEO collisions with Earth are infrequent, but can happen at any time. Therefore it is necessary to develop and validate techniques as well as technologies necessary to prevent them. One approach to mitigate future NEO impacts is the concept of high-speed interceptor. This concept is to alter the NEO's trajectory via momentum exchange by using kinetic impactors as well as nuclear penetration devices. The interceptor has to hit a target NEO at relative velocity which imparts a sufficient change in NEO velocity. NASA's Deep Impact mission has demonstrated this scenario by intercepting Comet Temple 1, 5 km in diameter, with an impact relative speed of approximately 10 km/s. This paper focuses on the development of hybrid guidance navigation and control (GNC) algorithms for precision hypervelocity intercept of small sized NEOs. The spacecraft's hypervelocity and the NEO's small size are critical challenges for a successful mission as the NEO will not fill the field of view until a few seconds before intercept. The investigation needs to consider the error sources modeled in the navigation simulation such as spacecraft initial state uncertainties in position and velocity. Furthermore, the paper presents three selected spacecraft guidance algorithms for asteroid intercept and rendezvous missions. The selected algorithms are classical Proportional Navigation (PN) based guidance that use a first order difference to compute the derivatives, Three Plane Proportional Navigation (TPPN), and the Kinematic Impulse (KI). A manipulated Bennu orbit that has been changed to impact Earth will be used as a demonstrative example to compare the three methods. In addition, a hybrid approach that is a combination between proportional navigation and kinematic impulse will be investigated to find an effective, error tolerant, and power saving approach. A 3-dimension mission scenario for both the asteroid and the interceptor spacecraft software simulator is developed for testing of the controllers. The current result demonstrates that a miss distance magnitude of less than 10m is found using the PN and TPPN guidance laws for small asteroid in the presence of error in the spacecraft states. Moreover, the paper presents these results and also the hybrid control approach simulation results.
The hybrid Lower-Upper Symmetric Gauss-Seidel (LU-SGS) algorithm was added to a widely used series of 2D/3D Euler/Navier-Stokes solvers and was demonstrated for a particular class of high-speed flows. A limited study was conducted to compare the hybrid LU-SGS for approximate Newton iteration and diagonalized Beam-Warming (DBW) schemes on a work and convergence history basis. The hybrid LU-SGS algorithm is more efficient and easier to implement than the DBW scheme originally present in the code for the cases considered. The code was validated for the hypersonic flow through two mutually perpendicular flat plates and then used to investigate the flow field in and around a simplified scramjet module gap seal configuration. Due to the similarities, the gap seal flow was compared to hypersonic corner flow at the same freestream conditions and Reynolds number.
The hybrid Lower-Upper Symmetric Gauss-Seidel (LU-SGS) algorithm was added to a widely used series of 2D/3D Euler/Navier-Stokes solvers and was demonstrated for a particular class of high-speed flows. A limited study was conducted to compare the hybrid LU-SGS for approximate Newton iteration and diagonalized Beam-Warming (DBW) schemes on a work and convergence history basis. The hybrid LU-SGS algorithm is more efficient and easier to implement than the DBW scheme originally present in the code for the cases considered. The code was validated for the hypersonic flow through two mutually perpendicular flat plates and then used to investigate the flow field in and around a simplified scramjet module gap seal configuration. Due to the similarities, the gap seal flow was compared to hypersonic corner flow at the same freestream conditions and Reynolds number.
Here, we introduce an automated workflow for generating non-empirical Wannier-localized optimally-tuned screened range-separated hybrid (WOT-SRSH) functionals. WOT-SRSH functionals have been shown to yield highly accurate fundamental band gaps, band structures, and optical spectra for bulk and 2D semiconductors and insulators. Our workflow automatically and efficiently determines the WOT-SRSH functional parameters for a given crystal structure and composition, approximately enforcing the correct screened long-range Coulomb interaction and an ionization potential ansatz. In contrast to previous manual tuning approaches, our tuning procedure relies on a new search algorithm that only requires a few hybrid functional calculations with minimal user input. We demonstrate our workflow on 23 previously studied semiconductors and insulators, reporting the same high level of accuracy. By automating the tuning process and improving its computational efficiency, the approach outlined here enables applications of the WOT-SRSH functional to compute spectroscopic and optoelectronic properties for a wide range of materials.
A four-node shell element has been implemented on the Connection Machine using the direct vector method and an exchange algorithm previously used with a simpler element. It is shown that the method retains a large measure of its speed in the more complicated setting of a shell element. A hybrid interprocessor communication scheme for the exchange algorithm which uses NEWS within structured subdomains is described.
A hybrid statistical-physical retrieval scheme is explored which combines a statistical approach with an approach based on the development of cloud-radiation models designed to simulate precipitating atmospheres. The algorithm employs the detailed microphysical information from a cloud model as input to a radiative transfer model which generates a cloud-radiation model database. Statistical procedures are then invoked to objectively generate an initial guess composite profile data set from the database. The retrieval algorithm has been tested for a tropical typhoon case using Special Sensor Microwave/Imager (SSM/I) data and has shown satisfactory results.
There are two main algorithmic approaches to autonomous driving systems: (1) An end-to-end system in which a single deep neural network learns to map sensory input directly into appropriate warning and driving responses. (2) A mediated hybrid recognition system in which a system is created by combining independent modules that detect each semantic feature. While some researchers believe that deep learning can solve any problem, others believe that a more engineered and symbolic approach is needed to cope with complex environments with less data. Deep learning alone has achieved state-of-the-art results in many areas, from complex gameplay to predicting protein structures. In particular, in image classification and recognition, deep learning models have achieved accuracies as high as humans. But sometimes it can be very difficult to debug if the deep learning model doesn't work. Deep learning models can be vulnerable and are very sensitive to changes in data distribution. Generalization can be problematic. It's usually hard to prove why it works or doesn't. Deep learning models can also be vulnerable to adversarial attacks. Here, we combine deep learning-based object recognition and tracking with an adaptive neurosymbolic network agent, called the Non-Axiomatic Reasoning System (NARS), that can adapt to its environment by building concepts based on perceptual sequences. We achieved an improved intersection-over-union (IOU) object recognition performance of 0.65 in the adaptive retraining model compared to IOU 0.31 in the COCO data pre-trained model. We improved the object detection limits using RADAR sensors in a simulated environment, and demonstrated the weaving car detection capability by combining deep learning-based object detection and tracking with a neurosymbolic model.
A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.