Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic algorithms”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
DOE OSTI2024

A Full-scale Demonstration of Pressurized Water Reactor Core Design Optimization using Multi-Cycle Optimization Methodology

The U.S. nuclear sector encounters a difficulty in upholding essential safety standards while also securing economic viability for continued operation. Safety stands as a pivotal factor across all facets of operations within light-water reactor nuclear power plants. Achieving economic feasibility alongside safety can be facilitated through the utilization of a risk-informed framework, exemplified by the ongoing development within the Risk-Informed Systems Analysis Pathway under the auspices of the U.S. Department of Energy's LWRS Program. This initiative advocates for a diverse array of research and development endeavors aimed at optimizing both safety and economic efficacy within nuclear power plants, particularly pertinent as many plants contemplate second license renewals. The Risk-Informed Systems Analysis Pathway has two main goals: deploy methodologies and technologies that better represent safety margins and cost and safety factors and develop advanced applications that enable cost-effective plant operation. This report assesses the potential for resolving multi-cycle plant reload challenges through real-world scenarios utilizing the Plant ReLoad Optimization (PRLO) framework. This framework offers reactor core design developers analytic tools of reactor safety and fuel performance with the assistance of artificial intelligence (AI) to enhance core design solutions. Multi-objective genetic algorithm alongside acceleration techniques is explored as an enabling technology for improving fuel efficiency while upholding safety thresholds. The demonstration of multi-cycle core design optimization is performed. This report investigates the practical application of the PRLO platform in addressing real-world core design challenges, supporting AI efforts, and contrasting outcomes with those derived from heuristic or conventional algorithms.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

Ensuring reliable connectivity to cellular-connected UAVs with up-tilted antennas and interference coordination

To integrate unmanned aerial vehicles (UAVs) in future large-scale deployments, a new wireless communication paradigm, namely, the cellular-connected UAV has recently attracted interest. However, the line-of-sight dominant air-to-ground channels along with the antenna pattern of the cellular ground base stations (GBSs) introduce critical interference issues in cellular-connected UAV communications. In particular, the complex antenna pattern and the ground reflection (GR) from the down-tilted antennas create both coverage holes and patchy coverage for the UAVs in the sky, which leads to unreliable connectivity from the underlying cellular network. To overcome these challenges, in this paper, we propose a new cellular architecture that employs an extra set of co-channel antennas oriented towards the sky to support UAVs on top of the existing down-tilted antennas for ground user equipment (GUE). To model the GR stemming from the down-tilted antennas, we propose a path-loss model, which takes both antenna radiation pattern and configuration into account. Next, we formulate an optimization problem to maximize the minimum signal-to-interference ratio (SIR) of the UAVs by tuning the up-tilt (UT) angles of the up-tilted antennas. Since this is an NP-hard problem, we propose a genetic algorithm (GA) based heuristic method to optimize the UT angles of these antennas. After obtaining the optimal UT angles, we integrate the 3GPP Release-10 specified enhanced inter-cell interference coordination (eICIC) to reduce the interference stemming from the down-tilted antennas. Our simulation results based on the hexagonal cell layout show that the proposed interference mitigation method can ensure higher minimum SIRs for the UAVs over baseline methods while creating minimal impact on the SIR of GUEs.

3GPP↗
DOE OSTI2021

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2010

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗
DOE OSTI2022

Utilizing commercial heating, ventilating, and air conditioning systems to provide grid services: A review

The modern power grid faces multiple challenges due to an increase in the adoption of renewable generation, such as dynamically balancing supply and demand at different time scales. Demand side management in buildings plays a vital role in achieving this balance because buildings can provide grid services through a variety of building assets. However, the development of grid-interactive, efficient buildings is still in its infancy, and a systematic and holistic understanding of grid service delivery strategies in terms of energy efficiency, load shifting, load shedding and load modulating is still limited. This paper is a comprehensive review of the development and application of building-level control strategies for utilizing heating, ventilating, and air conditioning systems to provide grid services. These strategies have been investigated through numerical and experimental studies. Control algorithms, such as heuristic rule-based control and model-based control, have been used to enable the automatic control delivery of grid services. The advantages and disadvantages of the strategies are summarized and discussed. Finally, research trends are also identified, which include considering predicted mean vote-based and occupant-based thermal comfort, modeling of occupant behavior, integrating power grid operations with building control, and combining different demand flexibility modes in the control design.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Automated design of an additive manufactured compact broadband antenna for plasma reflectometry

Broadband antennas operating in the gigahertz frequency range are regularly used for plasma reflectometry diagnostics. Due to a lack of space and unique diagnostic constraints, these antennas are often custom in design and frequency range. Recent advances in additive manufacturing of high temperature copper alloys allow for expanded freedom in design of these diagnostic antennas. In this work, a heuristic simulated annealing algorithm is used alongside 3-D finite element simulation to automate the design of a double ridged rectangular horn antenna for a reflectometry diagnostic on the DIII-D tokamak. Optimization of antenna performance given the design constraints results in a compact broadband (6-20+ GHz) antenna design. Measured transmission from the additively manufactured antenna matches simulation within reasonable error, and experimental plasma electron density profiles from the DIII-D high-field side scrape-off layer are shown.

Additive manufacturing↗
DOE OSTI2024

Optimizing the location and configuration of disaster resilience hubs under transportation and electric power network failures

Natural disasters often result in failures of transportation network components and blackouts that imperil the wellbeing of vulnerable populations. In response to these events, resilience hubs have been proposed as a pre-disaster planning strategy to improve access to critical services. This paper introduces an optimization-based approach to locate and configure electric power-generating resilience hubs considering the possibility of failures in transportation and electric power systems. The model's objective is to identify hub locations and configurations that maximize transportation accessibility to the hubs and maximize the satisfaction of basic energy needs through hub-generated electric power. Besides a budget constraint, the model accounts for limits on the levels of hub energy generation vis-à-vis community energy demands, and on the transportation network distance of communities to hubs. Three heuristics are presented for the proposed planning problem. The first heuristic is a genetic algorithm (GA) with problem-specific solution generation procedures. The other two heuristics implement greedy search techniques. Numerical experiments were conducted, using data from rural Puerto Rico, to illustrate the application of the proposed model and heuristics, and examine their performance. In the numerical experiments, the GA heuristic found better solutions than the greedy heuristics. Additionally, design solutions consisting of spatially dispersed hubs with low energy generation capacity were better than solutions with spatially concentrated high-capacity hubs. Lastly, across a wide range of hub demand scenarios, only a small number of candidate hub locations consistently ranked among the best locations for establishing a hub.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1987

Diagnosis and sensor validation through knowledge of structure and function

The liquid oxygen expert system 'LES' is proposed as the first capable of diagnostic reasoning from sensor data, using model-based knowledge of structure and function to find the expected state of all system objects, including sensors. The approach is generally algorithmic rather than heuristic, and represents uncertainties as sets of possibilities. Functional relationships are inverted to determine hypothetical values for potentially faulty objects, and may include conditional functions not normally considered to have inverses.

Scarl, Ethan A.↗
NASA NTRS1990

Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

Banerjee, Prithviraj↗
NASA NTRS1995

Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads

Traditionally, allocation of data in distributed database management systems has been determined by off-line analysis and optimization. This technique works well for static database access patterns, but is often inadequate for frequently changing workloads. In this paper we address how to dynamically reallocate data for partionable distributed databases with changing access patterns. Rather than complicated and expensive optimization algorithms, a simple heuristic is presented and shown, via an implementation study, to improve system throughput by 30 percent in a local area network based system. Based on artificial wide area network delays, we show that dynamic reallocation can improve system throughput by a factor of two and a half for wide area networks. We also show that individual site load must be taken into consideration when reallocating data, and provide a simple policy that incorporates load in the reallocation decision.

Brunstrom, Anna↗
NASA NTRS1994

Unstructured grids on SIMD torus machines

Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.

Bjorstad, Petter E.↗
NASA NTRS1997

Load Balancing Sequences of Unstructured Adaptive Grids

Mesh adaption is a powerful tool for efficient unstructured grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. This paper makes several important additions to our previous work. First, a new remapping cost model is presented and empirically validated on an SP2. Next, our load balancing strategy is applied to sequences of dynamically adapted unstructured grids. Results indicate that our framework is effective on many processors for both steady and unsteady problems with several levels of adaption. Additionally, we demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required for a fine initial mesh. Finally, we show that the data remapping overhead can be significantly reduced by applying our heuristic processor reassignment algorithm.

Biswas, Rupak↗
NASA NTRS2017

Initial Results of Heuristic Guided Orbit Selection for a Low Frequency Radio Interferometric Spacecraft Constellation

A constellation of radio telescope spacecraft can leverage interferometry to accurately image distant objects throughout the universe, but mission design must balance among many interrelated constraints. In particular, the number of craft and the selection of time-varying orbital parameters play a pivotal role in determining what interferometric baselines are feasible with respect to different targets, and thus drives the breadth and quality of data available to the constellation. The large combinatorial orbit configuration space and competing concerns present a challenging problem that is not well addressed by traditional mission design processes. This paper describes application of automated optimization methods to help direct mission design effort to the most promising dynamic constellation geometries: those that achieve broad interferometric coverage but remain cost-effective and resilient to failures. Several automatic heuristic-driven optimization algorithms representing complementary search strategies were created to explore among concrete constellation configuration plans. Evaluation of each candidate constellation plan was accelerated by efficiently combining precomputed caches of orbital and interferometric data. Results indicate that leveraging automated optimization for constellation mission design is both practical and illuminating: generated solutions provided both evidence for existing design intuitions as well as fresh insights into novel configurations.

Hernandez, Sonia↗
DOE OSTI2023

Method and apparatus for constructing informative outcomes to guide multi-policy decision making

In Multi-Policy Decision-Making (MPDM), many computationally-expensive forward simulations are performed in order to predict the performance of a set of candidate policies. In risk-aware formulations of MPDM, only the worst outcomes affect the decision making process, and efficiently finding these influential outcomes becomes the core challenge. Recently, stochastic gradient optimization algorithms, using a heuristic function, were shown to be significantly superior to random sampling. In this disclosure, it was shown that accurate gradients can be computed-even through a complex forward simulation—using approaches similar to those in dep networks. The proposed approach finds influential outcomes more reliably, and is faster than earlier methods, allowing one to evaluate more policies while simultaneously eliminating the need to design an easily-differentiable heuristic function.

Olson, Edwin↗
DOE OSTI2026

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗
NASA NTRS1996

A System for Automatically Generating Scheduling Heuristics

The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

Morris, Robert↗
NASA NTRS1996

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Alexander, June↗