Search NASA⌕ Search

SEARCH · Search NASA

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 217 records · Page 12

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↗

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↗

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↗

The research on meta-job scheduling heuristics in heterogeneous environments

As the core of rational utilization of computing resources, the scheduling algorithm has gained the interest of many researchers. Aimed at meta-job scheduling in heterogeneous environments, this paper puts forward three algorithms: the meta-job scheduling algorithm based on deviation (MaxD-min heuristic), the meta-job scheduling algorithm based on relative deviation (MaxRD-min heuristic), and the Cordwood algorithm (CA). The former two Algorithm are improvements of the classic Min-min algorithm. The latter CA algorithm is a new method that tries to place each building block on the tray with minimal amount of Sufferage. In conclusion, the result of experimenting shows that the three algorithms, in comparison to Min-Min and Max-Min algorithm, can effectively reduce the total span of scheduling (makespan).

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

Transient analysis and energy optimization of solar heating and cooling systems in various configurations

In this paper, a transient simulation model of solar-assisted heating and cooling systems (SHC) is presented. A detailed case study is also discussed, in which three different configurations are considered. In all cases, the SHC system is based on the coupling of evacuated solar collectors with a single-stage LiBr-H{sub 2}O absorption chiller, and a gas-fired boiler is also included for auxiliary heating, only during the winter season. In the first configuration, the cooling capacity of the absorption chiller and the solar collector area are designed on the basis of the maximum cooling load, and an electric chiller is used as the auxiliary cooling system. The second layout is similar to the first one, but, in this case, the absorption chiller and the solar collector area are sized in order to balance only a fraction of the maximum cooling load. Finally, in the third configuration, there is no electric chiller, and the auxiliary gas-fired boiler is also used in summer to feed the absorption chiller, in case of scarce solar irradiation. The simulation model was developed using the TRNSYS software, and included the analysis of the dynamic behaviour of the building in which the SHC systems were supposed to be installed. The building was simulated using a single-lumped capacitance model. An economic model was also developed, in order to assess the operating and capital costs of the systems under analysis. Furthermore, a mixed heuristic-deterministic optimization algorithm was implemented, in order to determine the set of the synthesis/design variables that maximize the energy efficiency of each configuration under analysis. The results of the case study were analyzed on monthly and weekly basis, paying special attention to the energy and monetary flows of the standard and optimized configurations. The results are encouraging as for the potential of energy saving. On the contrary, the SHC systems appear still far from the economic profitability: however, this is notoriously true for the great majority of renewable energy systems. (author)

14 SOLAR ENERGY↗

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↗

Iterative ramp sharpening for structure signature-preserving simplification of images

In this paper, we present a simple and heuristic ramp sharpening algorithm that achieves local contrast enhancement of vector-valued images. The proposed algorithm performs a local comparison of intensity values as well as gradient strength and directional information derived from the gradient structure tensor so that the sharpening is applied only for pixels found on the ramps around true edges. This way, the contrast between objects and regions separated by a ramp is enhanced correspondingly, avoiding ringing artefacts. It is found that applying this technique in an iterative manner on blurred imagery produces sharpening preserving both structure and signature of the image. The final approach reaches a good compromise between complexity and effectiveness for image simplification, enhancing in an efficient manner the image details and maintaining the overall image appearance.

97 MATHEMATICS AND COMPUTING↗

Identifying Vulnerabilities and Hardening Attack Graphs for Networked Systems

We investigate efficient security control methods for protecting against vulnerabilities in networked systems. A large number of interdependent vulnerabilities typically exist in the computing nodes of a cyber-system; as vulnerabilities get exploited, starting from low level ones, they open up the doors to more critical vulnerabilities. These cannot be understood just by a topological analysis of the network, and we use the attack graph abstraction of Dewri et al. to study these problems. In contrast to earlier approaches based on heuristics and evolutionary algorithms, we study rigorous methods for quantifying the inherent vulnerability and hardening cost for the system. We develop algorithms with provable approximation guarantees, and evaluate them for real and synthetic attack graphs.

attack graphs↗

Integrated network design and scheduling problems :

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.↗

Atmospheric River Tracking Method Intercomparison Project (ARTMIP): Report of the Second ARTMIP Workshop

Atmospheric rivers (ARs) have for the last decade been broadly recognized for their global and regional significance in mediating energy and water cycles. As a distinct large-scale circulation feature, ARs can be characterized by long, narrow bands of atmospheric moisture transport from the tropics to higher latitudes. They are both an important source of water supply to coastal regions as well as a hazard because of their predisposition to increase flood risk. However, predicting ARs poses a significant challenge to the scientific community, as they exhibit large variability from subseasonal-to-interannual time scales. On multi-decadal and longer time scales, it is unclear how the frequency and intensity of ARs will change with a warming climate. Hence ARs play a significant role in understanding predictability of water cycle variability and extremes as well as becoming a factor in assessing risks to future infrastructures. There is a large body of literature that has explored ARs from both global and regional perspectives and from timescales spanning hourly to centennial. Despite significant progress in understanding ARs, significant gaps remain, e.g., in characterizing the dynamical and thermodynamical processes associated with ARs, improving predictions of ARs at weather and subseasonal-to-seasonal timescales, and understanding and quantifying the impacts of ARs on the design and management of built infrastructures. Furthermore, the consensus definition of ARs remains essentially qualitative, and investigators have had to rely on heuristic definitions of ARs for quantitative studies. In the First Atmospheric River Tracking Method Intercomparison Project (ARTMIP) workshop held in May 2017, it was recognized that (1) there are many heuristic AR tracking algorithms employed in the literature, (2) our quantitative—and possibly qualitative— understanding of ARs and their impacts may depend on the details of the algorithm used, (3) no data set yet exists to systematically explore the impact of AR tracking algorithm choice on scientific results, and (4) the broader scientific community therefore lacks any formal guidance on the advantages and disadvantages of different AR tracking methods. The First ARTMIP workshop defined and launched a multi-tiered intercomparison experiment designed to fill this community need. The first tier of ARTMIP was aimed at understanding the impact of AR algorithms on quantitative baseline statistics and characteristics of ARs, and the second tier includes sensitivity studies designed around specific science questions, such as reanalysis uncertainty and influences associated with climate change. The Second ARTMIP workshop was convened on April 23-24, 2018, as a two-day event, and following the completion of Tier 1 of the ARTMIP effort: an experiment in which most existing AR tracking algorithms were run on a standardized data set of reanalyzed weather conditions.

54 ENVIRONMENTAL SCIENCES↗

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.↗

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↗

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↗

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.↗