Search NASA⌕ Search

SEARCH · Search NASA

Results for “heuristic”

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 19 records

Impact of Timing in the Design Process on Students’ Application of Design for Additive Manufacturing Heuristics

The goal of this work is to study the way student designers use design for additive manufacturing (DfAM) rules or heuristics. It can be challenging for novice designers to create successful designs for additive manufacturing (AM), due to its recent surge in popularity and lack of formal education or training. A study was carried out to investigate the way novices apply DfAM heuristics when they receive them at different points in the design process. A design problem was presented to students, and three different groups of student participants were given a lecture on DfAM heuristics at three different points in the design process: before the initial design, between the initial design and redesign, and after the redesign. The novelty and quality of each of the resulting designs were evaluated. Results indicate that although the DfAM heuristics lecture had no impact on the overall quality of the designs generated, participants who were given the heuristics lecture after the initial design session produced designs that were better-suited for 3D printing in the second phase of the design activity. However, receiving this additional information appears to prevent students from creatively iterating upon their initial designs, as participants who received heuristic information between the design sessions experienced a decrease in novelty between the two sessions. Additionally, receiving the heuristics lecture increased all students’ perceptions of their ability to perform DfAM-related tasks. Furthermore, these results validate the practicality of design heuristics in lecture form as AM training tools while also emphasizing the importance of iteration in the design process.

computer-aided design↗

Heuristic Dispatch Based on Price Signals for Behind-the-Meter PV-Battery Systems in the System Advisor Model

The economic potential of a behind-the-meter (BTM) PV-battery system depends greatly on how the battery is dispatched. Different utility rates, system sizes, generation and load profiles can all require different dispatch strategies. This paper presents price signals dispatch, a new algorithm for automated economic dispatch of BTM PV-battery systems, which utilizes 24-hour PV and load forecasts, degradation data, and utility rates. The algorithm is integrated with the System Advisor Model (SAM) tool and is tested with a nonlinear generic electrochemical battery model. Price signals dispatch outperforms SAM's existing algorithms in cases requiring a balance between demand charge management and energy arbitrage, and in cases where battery degradation imposes a significant cost.

batteries↗

Evaluation of Visualization Heuristics

Heuristics have been used since the early 1990's in the Human Computer Interaction (HCI) domain, for evaluating user interfaces. Most notably, heuristics developed by Nielsen and Molich (1990) have been used by the HCI community. Forsell and Johansson (2010) used the same methodology as Nielsen and Molich and developed a set of 10 heuristics for information visualization. Currently, neither the information visualization or the visual analytics community has adopted these heuristics. However, several studies have been conducted using heuristics. Hearst et al. (2015) found that using the heuristics for visualizations along with asking questions about the data resulted in complementary results as the questions about the data could compensate for heuristics that were difficult to understand and apply. Heli Väätäjä et al. (2016) found that heuristics related to interaction, veracity, and aesthetics needed to be added to the Forsell and Johansson (2010) set. They also noted that a lack of domain knowledge caused the evaluators issues in conducting a heuristic evaluation. We conducted a controlled experiment to determine what factors might impact the expert evaluators' capability to conduct a heuristic evaluation of a static information visualization. In particular, we wanted to understand how their familiarity with the visualizations and their experience in conducting heuristic evaluations impacted their evaluations of visualizations. We recruited 10 participants who were domain experts in the visualization field each having experience with one of more of the following: user experience design or research, user interface development, and human computer interaction research. We used a heuristic set proposed by Forsell and Johansson. Participants were also asked to complete a demographic survey in which they rated their experience with each visualization type generally, their experience conducting heuristic evaluations, their experience using each visualization type to extract information, and their experience developing and creating each visualization type. The participants were shown a series of 5 common visualizations (Scatterplots, Sunbursts, Tree Maps, Parallel Sets, and Area Graphs) all displaying the VAST 2008 Mini Challenge Two- Migrant Boats data . Participants were given a suggested analytical question related to each visualization to keep in mind as they applied the 10 heuristics to each visualization. They were asked if they could find any usability problems in the visualizations and which heuristic(s) helped them to identify these problems. The participants were asked to rate how relevant each heuristic was for evaluating each visualization along with rating how confident they felt in their ability to apply the heuristic to evaluate each visualization. At the conclusion of the study, participants provided qualitative feedback on the usability issues of each visualization. Additionally, we collected eye tracking data on 6 of the 10 participants. We will be using this data to determine how long participants looked at the various visualizations and what parts of the visualizations they focused on. We had two hypotheses for this empirical evaluation: 1.The Forsell and Johansson heuristics of Orientation and help, Data set reduction, and Prompting are less useful for static visualizations because they require some interaction in order to test completely. 2.Participants that do not have experience with heuristic evaluation will provide lower evaluation scores for the heuristics compared to those that have experience. Related to hypothesis 1, as our study used only static visualizations, interaction-related usability challenges should be harder to identify. This should result in lower usefulness ratings for those heuristics. Preliminary results indicate that participants found it more difficult to apply heuristics to unfamiliar visualizations.

Williams, Ryan G.↗

Framework for the Evolution of Heuristics in Advanced Manufacturing

Here, in this study, we work toward addressing a knowledge gap in understanding how heuristics are developed, retrieved, employed, and modified by designers. Having a better awareness of one’s own set of heuristics can be beneficial for relaying to other team members, improving a team’s training processes, and aiding others on their path to design expertise. The ability to understand and justify the use of a heuristic should lead to more effective decision-making in systems design. To do this, the heuristics and their characteristics must be extracted using a repeatable scientific research methodology. This study describes a unique extraction and characterization process compared to prior literature. It includes some of the first work towards documenting heuristics for both designers and operators in a hybrid manufacturing setting. Eight participants performed a series of two design journals, two interviews, and one survey. Heuristics were extracted and refined between each method and then verified by participants in the survey. The surveys produced novel statistically significant findings in regard to heuristic characterizations, impacting how participants view how often a heuristic is used, the reliability of the heuristic, and the evolution of the heuristic. Lastly, an alternate perspective of heuristics as an error management bias is highlighted and discussed.

42 ENGINEERING↗

The Effect of Laser Cutting Heuristic Presentation Modality on Design Learning

Abstract The goal of this work is to study the way student designers use heuristics to effectively design for laser-cut manufacturing methods. With the recent advent of academic makerspaces, digital fabrication tools like laser cutters are relatively new additions to the classroom. Therefore, there is a gap in formal education or training on these tools, and students can find it challenging to design effectively for them. A study was performed to investigate the way students apply heuristics to redesign laser-cut assemblies when received in different modalities. All participants were given an identical lecture on laser cutting heuristics. Then, a redesign problem was presented to students, and three different experimental groups were given the heuristics in different modalities: Text-Only, text with Visual aids, and text with Tactile aids. The novelty and quality of each of the resulting redesigns were evaluated. It was hypothesized that participants would have more difficulty interpreting and applying the Text-Only heuristics, lowering the quality of their redesigned solutions relative to the other two conditions. It was also hypothesized that participants would experience fixation caused by interacting with the tactile aids, leading to the lower novelty of their redesigned solutions relative to the other two conditions. Results showed that modality played a significant role in participants’ feelings of self-efficacy after the intervention, as well as in their understanding of laser cutter design skills when responding to quiz-style questions. However, analysis of novelty and quality showed little significant impact of the intervention and varying modalities on participants’ designs.

Engineering↗

Feasible region-based heuristics for optimal transmission switching

In this paper, we develop a optimal transmission switching (OTS) heuristic based on DC optimal power flow (OPF) and assess the efficacy of the approach when implemented within AC OPF. Traditional formulations of the OTS problem can result in hundreds or thousands of binary variables for large networks, making the OTS problem challenging to solve on fast timescales even for relatively small networks. Here, we identify which constraints and therefore which variables are constraining the DC OPF feasible region, and rank them based on their impact on the cost function. We develop a heuristic algorithm which iteratively removes these constraints and solves a series of standard DC OPF problems. The heuristic is tested on a variety of PGlib networks and the results show that the algorithm can provide substantial cost decreases without having to solve any mixed integer programs. Additionally, we provide insights about the OTS problem, including identifying scenarios outside congestion where OTS can prove useful. Lastly, the performance of the DC-based heuristic is shown when the line switching decisions are implemented within AC OPF.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗

A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem

An alternative to the production of fossil transportation fuels is the production of biofuels, particularly, bioethanol. One of the main opportunity areas is the reduction in the overall cost of biofuel. An approach to reduce this cost is to design and implement a supply chain (SC) that considers the quality-related properties of the biomass as well as the economies of scale to minimize the logistics and quality-related costs. This problem is formulated as a hub location problem, which has been classified as an NP-hard problem, thus, meta-heuristics are a suitable approach to solve this problem. We propose a hybrid meta-heuristic solution procedure to solve large-scale instances of a two-stage stochastic biomass-to-biorefinery hub-and-spoke network problem. This solution procedure is proposed to support the large-scale production and distribution of bioethanol by considering the variability in its moisture and ash contents. The hybrid method utilizes a simulated annealing-simplex method to find an initial solution and a tabu search-simplex method to improve the solution. Numerical experimentation was performed on a realistic case study in Texas. The findings demonstrate that the hybrid procedure outperforms the standard L-shaped (LS) method. The meta-heuristic combining simulated annealing and tabu search with the simplex method (SATS-SM) achieved 2.48% lower costs and required 96.57% less time, on average, when compared to the results from using the LS.

09 BIOMASS FUELS↗

A Heuristic Approach to Value-Driven Evaluation of Visualizations

Recently, an approach for determining the value of a visualization was proposed, one moving beyond simple measurements of task accuracy and speed. The value equation contains components for the time savings a visualization provides, the insights and insightful questions it spurs, the overall essence of the data it conveys, and the confidence about the data and its domain it inspires. This articulation of value is purely descriptive, however, providing no actionable method of assessing a visualization's value. In this work, we create a heuristic-based evaluation methodology to accompany the value equation for assessing interactive visualizations. We refer to the methodology colloquially as ICE-T, based on an anagram of the four value components. Our approach breaks the four components down into guidelines, each of which is made up of a small set of low-level heuristics. Evaluators who have knowledge of visualization design principles then assess the visualization with respect to the heuristics. We conducted an initial trial of the methodology on three interactive visualizations of the same data set, each evaluated by 15 visualization experts. As a result, we found that the methodology showed promise, obtaining consistent ratings across the three visualizations and mirroring judgments of the utility of the visualizations by instructors of the course in which they were developed.

97 MATHEMATICS AND COMPUTING↗

Heuristic Evaluation Methods Applied to a Predictive Maintenance Chatbot

The need for an accessible iterative approach for evaluating prospective artificial intelligence (AI)/ML based technologies in the nuclear industry is needed, given the nature of algorithms and rapid advancements. This paper explores existing heuristic design principles for user-centered design and evaluates them based on their relevancy and usefulness for evaluating AI/ ML based technologies. Researchers at the Idaho National Laboratory (INL) have developed a machine learning software application called VIsualization for PrEdictive maintenance Recommendation (VIPER), which is used to help users understand and engage with the tool to learn more about work orders, data used, predictive maintenance, and machine learning (ML) algorithms. Early user research studies used to access VIPER’s technology readiness level have occurred; however, there is room for further improvement of the software through heuristic evaluations along with other methods and user testing. This work describes the applicability of heuristic evaluation methods and cognitive walkthroughs to help ensure human readiness for prospective AI/ ML based applications, using VIPER as a candidate use case. This work supports industry in ensuring that prospective AI/ML based technologies are usable and useful for plant personnel at nuclear power plants, ultimately leading to their safe, reliable, and efficient use.

99 - GENERAL AND MISCELLANEOUS↗

Heuristic Evaluation Methods Applied to a Predictive Maintenance Chatbot

The need for an accessible iterative approach for evaluating prospective artificial intelligence (AI)/ML based technologies in the nuclear industry is needed, given the nature of algorithms and rapid advancements. This paper explores existing heuristic design principles for user-centered design and evaluates them based on their relevancy and usefulness for evaluating AI/ ML based technologies. Researchers at the Idaho National Laboratory (INL) have developed a machine learning software application called VIsualization for PrEdictive maintenance Recommendation (VIPER), which is used to help users understand and engage with the tool to learn more about work orders, data used, predictive maintenance, and machine learning (ML) algorithms. Early user research studies used to access VIPER?s technology readiness level have occurred; however, there is room for further improvement of the software through heuristic evaluations along with other methods and user testing. This work describes the applicability of heuristic evaluation methods and cognitive walkthroughs to help ensure human readiness for prospective AI/ ML based applications, using VIPER as a candidate use case. This work supports industry in ensuring that prospective AI/ML based technologies are usable and useful for plant personnel at nuclear power plants, ultimately leading to their safe, reliable, and efficient use. PowerPoint for conference that was reviewed in PRS and LRS PRS/CON-25-05379 and INL/CON-25-82946

99 - GENERAL AND MISCELLANEOUS↗

Cooperative Routing for an Air–Ground Vehicle Team—Exact Algorithm, Transformation Method, and Heuristics

This paper considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between the vehicles. The proposed framework uses a ground vehicle and an unmanned aerial vehicle (UAV) that travel cooperatively and visit a set of targets while satisfying the communication constraints. The problem is formulated as a mixed-integer linear program, and a branch-and-cut algorithm is developed to solve the problem to optimality. Furthermore, a transformation method and a heuristic are also developed for the problem. The effectiveness of all the algorithms is corroborated through extensive computational experiments on several randomly generated instances. Furthermore, this paper is motivated by an intelligence, surveillance, and reconnaissance mission involving a single unmanned aerial vehicle (UAV) and a ground vehicle, where the vehicles must coordinate their activity in the presence of communication constraints. The combination of a small UAV and a ground vehicle is an ideal platform for such missions, since small UAVs can fly at low altitudes and can avoid obstacles or threats that would be problematic for the ground vehicle alone. This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.

33 ADVANCED PROPULSION SYSTEMS↗

The Heuristic Dynamic Programming Approach in Boost Converters

In this study, a heuristic dynamic programming controller is proposed to control a boost converter. Conventional controllers such as proportional-integral-derivative (PID) or proportional-integral (PI) are designed based on the linearized small-signal model near the operating point. Therefore, the performance of the controller during the start-up, the load change, or the input voltage variation is not optimal since the system model changes by varying the operating point. The heuristic dynamic programming controller optimally controls the boost converter by following the approximate dynamic programming. The advantage of the HDP is that the neural network-based characteristic of the proposed controller enables boost converters to easily cope with large disturbances. An HDP with a well-trained critic and action networks can perform as an optimal controller for the boost converter. To compare the effectiveness of the traditional PI-based and the HDP boost converter, the simulation results are provided.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Physical Interpretation of Strict Solutions of Diffraction Problems by Heuristic Relations

We propose a new approach to construct heuristic relations describing solutions of diffraction problems. Those relations are based on physical principles and allow one to interpret mathematically strict solutions. Since the heuristic relations possess high performance and accuracy, they can also be used along with any strict approach or experimental results for a significant improvement of efficiency of solutions of practical problems related to applications of the diffraction theory.

97 MATHEMATICS AND COMPUTING↗

Intersecting heuristic adaptive strategies, building design and energy saving intentions when facing discomfort environment: A cross-country analysis

Occupants' adaptive strategies play an important role in the energy consumption of office buildings. Previous research has mostly focused on the adaptive strategies triggered by occupants' indoor discomfort; however, it is crucial to understand if specific adaptive strategies are linked to occupants' energy-saving intentions. This study explores the relationships among employees’ heuristic decision-making in their first choice of adaptive strategies (technological solutions or personal adjustments) when facing extreme discomfort conditions, and their energy-saving intentions, then links these patterns with building design, workplace contextual factors, and demographics. A cross-sectional survey was collected among university employees from China, Brazil, Italy, Poland, Switzerland, and the US. Our results demonstrated that the accessibility to indoor environmental controls (IECs) and office type are the significant factors for adaptive strategies. There was a positive relationship between the number of IEC features and the percentage of employees choosing a technological solution. When feeling too hot, occupants in private offices are more likely to adopt a technological solution, whereas occupants in cubicles are more likely to choose a personal adjustment. Occupants with energy-saving intentions are less likely to choose thermostat adjustments or use portable devices as adaptive strategies than their counterparts. Lastly, the cluster analysis suggests females were more likely to use adaptive strategies for energy-saving purposes than males. The majority of occupants would turn on/off lighting to save energy. The study provides the contributions in the connection between the heuristic decision-making process and energy-saving intentions and recommendations on design strategies for building architects, engineers, and managers.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗

A heuristic classification of woody plants based on contrasting shade and drought strategies

Woody plants vary in their adaptations to drought and shade. For a better prediction of vegetation responses to drought and shade within dynamic global vegetation models, it is critical to group species into functional types with similar adaptations. One of the key challenges is that the adaptations are generally determined by a large number of plant traits that may not be available for a large number of species. In this study, we present two heuristic woody plant groups that were separated using cluster analysis in a three-dimensional trait–environment space based on three key metrics for each species: mean xylem embolism resistance, shade tolerance and habitat aridity. The two heuristic groups separate these species into tolerators and avoiders. Furthermore, the tolerators either rely on their high embolism resistance to tolerate drought in arid habitats (e.g., Juniperus and Prunus ) or rely on high shade tolerance to withstand shaded conditions in wet habitats (e.g., Picea , Abies and Acer ). In contrast, all avoiders have low embolism resistance and low shade tolerance. In arid habitats, avoiders tend to minimize catastrophic embolism (e.g., most Pinus species) while in wet habitats, they may survive despite low shade tolerance (e.g., Betula , Populus , Alnus and Salix ). Because our approach links traits to the environmental conditions, we expect it could be a promising framework for predicting changes in species composition, and therefore ecosystem function, under changing environmental conditions.

59 BASIC BIOLOGICAL SCIENCES↗

A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction

We present a computationally improved heuristic algorithm for transmission switching (TS) to recover load shed. Research from the past showed that changing power system topology may control power flows and remove line congestion. Hence, TS may reduce the required load shed. One of the main challenges is to find a potential TS candidate in a suitable time. Here, we propose a novel heuristic method that is capable of finding the potential TS candidate faster than existing algorithms in literature. The proposed method is compatible with both the AC and DC optimal power flows (OPF). Three metrics are used to compare the proposed algorithm with the state-of-the-art from literature to show the speedup and accuracy achieved. The proposed method is implemented on the IEEE 30-bus system, PEGASE 89-bus system, IEEE 118-bus system, and Polish 2383- bus system. The results on the large-scale Polish 2383-bus system shows that the proposed algorithm is scalable to large real-world systems. Parallel computing is implemented to further improve the computational performance of the proposed algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗