SEARCH · Engineering Papers

Results for “generalized algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,279 records · Page 71

All sources NASA NTRS DOE OSTI

NASA NTRS1999

Co-evolution for Problem Simplification

This paper explores a co-evolutionary approach applicable to difficult problems with limited failure/success performance feedback. Like familiar "predator-prey" frameworks this algorithm evolves two populations of individuals - the solutions (predators) and the problems (prey). The approach extends previous work by rewarding only the problems that match their difficulty to the level of solut,ion competence. In complex problem domains with limited feedback, this "tractability constraint" helps provide an adaptive fitness gradient that, effectively differentiates the candidate solutions. The algorithm generates selective pressure toward the evolution of increasingly competent solutions by rewarding solution generality and uniqueness and problem tractability and difficulty. Relative (inverse-fitness) and absolute (static objective function) approaches to evaluating problem difficulty are explored and discussed. On a simple control task, this co-evolutionary algorithm was found to have significant advantages over a genetic algorithm with either a static fitness function or a fitness function that changes on a hand-tuned schedule.

Haith, Gary L.↗

NASA NTRS1997

Bayesian Blocks: A New Method to Analyze Photon Counting Data

A Bayesian analysis of photon-counting data leads to a new time-domain algorithm for detecting localized structures (bursts), revealing pulse shapes, and generally characterizing intensity variations. The raw counting data -- time-tag events (TTE), time-to-spill (TTS) data, or binned counts -- is converted to a maximum likelihood segmentation of the observation into time intervals during which the photon arrival rate is perceptibly constant -- i.e. has a fixed intensity without statistically significant variations. The resulting structures, Bayesian Blocks, can be thought of as bins with arbitrary spacing determined by the data. The method itself sets no lower limit to the time scale on which variability can be detected. We have applied the method to RXTE data on Cyg X-1, yielding information on this source's short-time-scale variability.

Scargle, Jeffrey D.↗

NASA NTRS2003

Enhancements to an Atmospheric Ascent Guidance Algorithm

Enhancements to an advanced ascent guidance algorithm for rocket-powered launch vehicles are described. A general method has been developed for conveniently and efficiently handling the common case of (asymmetric) launch vehicles with unbalanced thrust and aerodynamic moments. The new part of this development concerns the treatment of endo-atmospheric flight. An alternative method for handing the transversality conditions has been developed that eliminates the need for a priori elimination of the constant multipliers that adjoin the terminal state constraints to the performance index. As a result, new constraints can be formulated and implemented with relative ease. The problem of burn-coast-burn trajectory optimization is treated using a modified multiple shooting technique.

Dukeman, Greg A.↗

NASA NTRS2007

Balloon Design Software

PlanetaryBalloon Version 5.0 is a software package for the design of meridionally lobed planetary balloons. It operates in a Windows environment, and programming was done in Visual Basic 6. By including the effects of circular lobes with load tapes, skin mass, hoop and meridional stress, and elasticity in the structural elements, a more accurate balloon shape of practical construction can be determined as well as the room-temperature cut pattern for the gore shapes. The computer algorithm is formulated for sizing meridionally lobed balloons for any generalized atmosphere or planet. This also covers zero-pressure, over-pressure, and super-pressure balloons. Low circumferential loads with meridionally reinforced load tapes will produce shapes close to what are known as the "natural shape." The software allows for the design of constant angle, constant radius, or constant hoop stress balloons. It uses the desired payload capacity for given atmospheric conditions and determines the required volume, allowing users to design exactly to their requirements. The formulations are generalized to use any lift gas (or mixture of gases), any atmosphere, or any planet as described by the local acceleration of gravity. PlanetaryBalloon software has a comprehensive user manual that covers features ranging from, but not limited to, buoyancy and super-pressure, convenient design equations, shape formulation, and orthotropic stress/strain.

Farley, Rodger↗

NASA NTRS2014

System Engineering of Autonomous Space Vehicles

Human exploration of the solar system requires fully autonomous systems when travelling more than 5 light minutes from Earth. This autonomy is necessary to manage a large, complex spacecraft with limited crew members and skills available. The communication latency requires the vehicle to deal with events with only limited crew interaction in most cases. The engineering of these systems requires an extensive knowledge of the spacecraft systems, information theory, and autonomous algorithm characteristics. The characteristics of the spacecraft systems must be matched with the autonomous algorithm characteristics to reliably monitor and control the system. This presents a large system engineering problem. Recent work on product-focused, elegant system engineering will be applied to this application, looking at the full autonomy stack, the matching of autonomous systems to spacecraft systems, and the integration of different types of algorithms. Each of these areas will be outlined and a general approach defined for system engineering to provide the optimal solution to the given application context.

Watson, Michael D.↗

NASA NTRS2014

Reconstructing the Sky Location of Gravitational-Wave Detected Compact Binary Systems: Methodology for Testing and Comparison

The problem of reconstructing the sky position of compact binary coalescences detected via gravitational waves is a central one for future observations with the ground-based network of gravitational-wave laser interferometers, such as Advanced LIGO and Advanced Virgo. Different techniques for sky localization have been independently developed. They can be divided in two broad categories: fully coherent Bayesian techniques, which are high latency and aimed at in-depth studies of all the parameters of a source, including sky position, and "triangulation-based" techniques, which exploit the data products from the search stage of the analysis to provide an almost real-time approximation of the posterior probability density function of the sky location of a detection candidate. These techniques have previously been applied to data collected during the last science runs of gravitational-wave detectors operating in the so-called initial configuration. Here, we develop and analyze methods for assessing the self consistency of parameter estimation methods and carrying out fair comparisons between different algorithms, addressing issues of efficiency and optimality. These methods are general, and can be applied to parameter estimation problems other than sky localization. We apply these methods to two existing sky localization techniques representing the two above-mentioned categories, using a set of simulated inspiralonly signals from compact binary systems with a total mass of equal to or less than 20M solar mass and nonspinning components. We compare the relative advantages and costs of the two techniques and show that sky location uncertainties are on average a factor approx. equals 20 smaller for fully coherent techniques than for the specific variant of the triangulation-based technique used during the last science runs, at the expense of a factor approx. equals 1000 longer processing time.

technique used↗

NASA NTRS1996

Evaluation of Star Identification Techniques

A number of different strategies are used or have been suggested for identifying star fields atitude determination in space. We offer a general classification of the existing techniques and select three representative algorithms for more comprehensive evaluation. In addition, we describe a software simulation environment we developed for the design, paramter determination, and evaluation of star identification algorithms. The identification rates and performance on the three algorithms are presented over a variety of noise conditions using two different sized onboard catalogs.

star↗

NASA NTRSDate not supplied

Avoiding Selection Bias in Generating Examples of Plans in the Presence of Heuristic Error

It is generally understood that heuristic error hurts the performance of search algorithms, measured in terms of search effort. Hence there is an interest in understanding how to reduce heuristic error. One way to do this is to learn a heuristic from a set of examples of plans generated offline, e.g. bootstrapping methods. In this paper, we consider how some methods for generating examples of plans may skew the training set in the presence of heuristic errors. Initial theoretical results show that duplicate detection is one source of selection bias in the canonical A* algorithm. We introduce a duplicate selection scheme for A* that avoids selection bias in generating cost-optimal examples, without compromising memory efficiency, and develop ideas in the satisficing setting. We evaluate our approach on n x m grids with multiple cost-optimal solutions and synthetic heuristic error. Finally, we attempt to extend these ideas to the problem of generating extreme examples of plans.

Alison S Paredes↗

NASA NTRSDate not supplied

Multigraph-based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing

Satellites are leaving the realms of niche use, extending our day-to-day networked infrastructure to space – thereby forcing a generalization of network architectures. The Delay Tolerant Networking (DTN) protocol is being developed to give rise to this new Solar System Internet. Predominantly, DTNs in space use globally-distributed contact tables to compute routes. In this paper, we propose and analyze a novel optimized approach for route computations that improves upon traditional approaches. As the general DTN will always include some scheduled links, our new algorithm enables greater scalability and practicality of DTN routing. These contact tables include windows when two nodes can communicate and were classically organized into a contact graph, where the vertices represent contact opportunities. Because the complexity of a contact graph grows with the number of contacts, pathfinding on it does not scale. A new structure using multigraphs with the same data is proposed. We show that a multigraph-based approach, which we call contact multigraph routing, exhibits performance superior to routing based on contact graphs, allowing greater scaling to schedule-based routing. In this paper, the multigraph-based algorithm is detailed and a proof is included showing it outperforms the previous algorithm given the same input. Pseudocode is included, as are simulation results. We conclude with suggested future work.

Delay Tolerant Networking↗

NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

COBRA-DDP↗

DOE OSTI2024

Towards Precision Photometric Type ia Supernova Cosmology With Machine Learning

The revolutionary discovery of dark energy and accelerating cosmic expansion was made with just 42 type Ia supernovae (SNe Ia) in 1999. Since then, large synoptic surveys, e.g., Dark Energy Survey (DES), have observed thousands more SNe Ia and the upcoming Rubin Legacy Survey of Space and Time (LSST) and Roman Space Telescope promise to deliver millions in the next decade. This unprecedented data volume can produce the required precision to unambiguously test concordance cosmology which could represent a monumental shift in our understanding of dark energy and its role in cosmic history. However, extracting a pure SN Ia sample with accurate redshifts for such a large dataset will be a challenge. Specifically, spectroscopic classification will not be possible for the vast majority of discovered objects, and only ~25% will have spectroscopic redshifts. This thesis presents a series of observational and methodological studies designed to address the questions associated with this new era of photometric SN Ia cosmology. First, we present a machine learning method for photometric classification of SNe, Supernova Classification with a COnvolutional Neural Network (SCONE). Photometric classification enables SNe with no spectroscopic information to be confidently categorized, and is a critical component of current and future analysis pipelines. SCONE achieves >99% accuracy distinguishing simulated SNe Ia from non-Ia SNe, and has been integrated into DES, LSST, and Roman analysis pipelines. We also demonstrate the efficacy of SCONE on early-time photometric classification, which will be vital for optimal allocation of spectroscopic resources. We show that SCONE can distinguish between 6 SN types with 75% accuracy on the night of initial discovery, comparable to results in the literature for full-phase SNe. Next, we study current methods for estimating SN Ia redshifts and propose a machine learning alternative that uses SN photometry alone to extract redshift information. Most SNe Ia inherit redshift information from their host galaxy, but the process of matching SNe to the correct host galaxy can be challenging. We systematically analyze the impact of incorrect redshifts from host galaxy mismatch on 5 years of DES SN data, and conclude that improved host matching or redshift estimation methods can reduce our systematic errors by ~10%. In response to this finding, we present a SN photometry-only method for estimating redshifts independent of host galaxy information, Photo-zSNthesis. We show that Photo-zSNthesis redshift estimates are accurate to within 2% across the full redshift range of LSST, a first in the literature. Finally, we focus on the robustness of machine learning (ML) algorithms for real-world and scientific applications. ML models generalize poorly beyond their training set and often experience severe performance degradation when deployed on new data. We demonstrate a general method for improving robustness that achieves new state-of-the-art results on astronomical object classification, wildlife identification, and tumor detection.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

The Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers

The design and implementation of a new framework for adaptive mesh refinement calculations are described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both nonrelativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1984

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗

NASA NTRS1988

Supervised learning of probability distributions by neural networks

Supervised learning algorithms for feedforward neural networks are investigated analytically. The back-propagation algorithm described by Werbos (1974), Parker (1985), and Rumelhart et al. (1986) is generalized by redefining the values of the input and output neurons as probabilities. The synaptic weights are then varied to follow gradients in the logarithm of likelihood rather than in the error. This modification is shown to provide a more rigorous theoretical basis for the algorithm and to permit more accurate predictions. A typical application involving a medical-diagnosis expert system is discussed.

Baum, Eric B.↗

NASA NTRS1990

Global optimization methods for engineering design

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Arora, Jasbir S.↗

NASA NTRS2022

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

NASA NTRS1993

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗