Results for “Heuristic Optimization” — Page 16

NASA NTRS1989

A Boltzmann machine for the organization of intelligent machines

In the present technological society, there is a major need to build machines that would execute intelligent tasks operating in uncertain environments with minimum interaction with a human operator. Although some designers have built smart robots, utilizing heuristic ideas, there is no systematic approach to design such machines in an engineering manner. Recently, cross-disciplinary research from the fields of computers, systems AI and information theory has served to set the foundations of the emerging area of the design of intelligent machines. Since 1977 Saridis has been developing an approach, defined as Hierarchical Intelligent Control, designed to organize, coordinate and execute anthropomorphic tasks by a machine with minimum interaction with a human operator. This approach utilizes analytical (probabilistic) models to describe and control the various functions of the intelligent machine structured by the intuitively defined principle of Increasing Precision with Decreasing Intelligence (IPDI) (Saridis 1979). This principle, even though resembles the managerial structure of organizational systems (Levis 1988), has been derived on an analytic basis by Saridis (1988). The purpose is to derive analytically a Boltzmann machine suitable for optimal connection of nodes in a neural net (Fahlman, Hinton, Sejnowski, 1985). Then this machine will serve to search for the optimal design of the organization level of an intelligent machine. In order to accomplish this, some mathematical theory of the intelligent machines will be first outlined. Then some definitions of the variables associated with the principle, like machine intelligence, machine knowledge, and precision will be made (Saridis, Valavanis 1988). Then a procedure to establish the Boltzmann machine on an analytic basis will be presented and illustrated by an example in designing the organization level of an Intelligent Machine. A new search technique, the Modified Genetic Algorithm, is presented and proved to converge to the minimum of a cost function. Finally, simulations will show the effectiveness of a variety of search techniques for the intelligent machine.

Moed, Michael C.↗

NASA NTRS2003

Implied alignment: a synapomorphy-based multiple-sequence alignment method and its use in cladogram search

A method to align sequence data based on parsimonious synapomorphy schemes generated by direct optimization (DO; earlier termed optimization alignment) is proposed. DO directly diagnoses sequence data on cladograms without an intervening multiple-alignment step, thereby creating topology-specific, dynamic homology statements. Hence, no multiple-alignment is required to generate cladograms. Unlike general and globally optimal multiple-alignment procedures, the method described here, implied alignment (IA), takes these dynamic homologies and traces them back through a single cladogram, linking the unaligned sequence positions in the terminal taxa via DO transformation series. These "lines of correspondence" link ancestor-descendent states and, when displayed as linearly arrayed columns without hypothetical ancestors, are largely indistinguishable from standard multiple alignment. Since this method is based on synapomorphy, the treatment of certain classes of insertion-deletion (indel) events may be different from that of other alignment procedures. As with all alignment methods, results are dependent on parameter assumptions such as indel cost and transversion:transition ratios. Such an IA could be used as a basis for phylogenetic search, but this would be questionable since the homologies derived from the implied alignment depend on its natal cladogram and any variance, between DO and IA + Search, due to heuristic approach. The utility of this procedure in heuristic cladogram searches using DO and the improvement of heuristic cladogram cost calculations are discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

Non-NASA Center↗

NASA NTRSDate not supplied

Quantifying Medical Risk on a Long Duration Lunar Mission: A Demonstration of NASA’s IMPACT Tradespace Analysis Tool

Background NASA’s human exploration spaceflight missions to the Moon and Mars present unprecedented challenges for in-mission medical care. The distance from Earth will mean increased mission durations, communication delays, limited to no resupply opportunities, and constraints on the medical evacuation of astronauts. Mass, volume, power, and data will be limited while higher demands will be placed on the crew to manage medical care. NASA’s Moon to Mars exploration strategy lays out increasingly complex Artemis missions both in terms of duration and operations. In these more challenging deep space missions, it is important to quantitatively estimate the human medical risk to inform a traditional heuristic approach to medical risk. Prior tools have been developed for missions in low Earth orbit, but a new tool is required to plan for future exploration missions. Methods IMPACT (Informing Mission Planning via Analysis of Complex Tradespaces) is a risk assessment tool developed by NASA to advance exploration mission medical system design by quantitatively estimating mission medical risk. IMPACT v1.0 includes a novel evidence library baselined to exploration environments; an expanded list of 119 medical conditions; the addition of medical resources; and the ability for rapid and iterative analysis. Medical system risk estimates include loss of crew life, consideration of the need for return to definitive care (medical evacuation), and an estimate of crew time affected due to medical conditions. A notional long duration lunar orbit and lunar surface design reference mission (DRM) was chosen with a 4-astronaut crew to represent a sustained exploration Artemis mission. Results/Discussion Overall, IMPACT successfully quantified medical risk and derived an optimized medical system to support crew on a long duration lunar mission. In this DRM, the calculated loss of crew life from a medical event was 0.008 events per mission, risk of potential need for evacuation was 0.30 events per mission, and cumulative crew time affected by medical conditions was 103 days. The medical conditions that most contributed to overall medical risk were decompression sickness, trauma conditions, and respiratory failure. The conditions that had the largest effects on crew performance included musculoskeletal injuries and lunar dust exposure. The IMPACT-generated medical system included resources that target the most common and highest risk conditions. This systematic analysis demonstrates the value of the IMPACT tool in medical system design for human exploration spaceflight missions.

Missions to Mars↗

NASA NTRS2024

Quantifying Medical Risk on a Long Duration Lunar Mission: A Demonstration of NASA’s IMPACT Tradespace Analysis Tool

Background NASA’s human exploration spaceflight missions to the Moon and Mars present unprecedented challenges for in-mission medical care. The distance from Earth will mean increased mission durations, communication delays, limited to no resupply opportunities, and constraints on the medical evacuation of astronauts. Mass, volume, power, and data will be limited while higher demands will be placed on the crew to manage medical care. NASA’s Moon to Mars exploration strategy lays out increasingly complex Artemis missions both in terms of duration and operations. In these more challenging deep space missions, it is important to quantitatively estimate the human medical risk to inform a traditional heuristic approach to medical risk. Prior tools have been developed for missions in low Earth orbit, but a new tool is required to plan for future exploration missions. Methods IMPACT (Informing Mission Planning via Analysis of Complex Tradespaces) is a risk assessment tool developed by NASA to advance exploration mission medical system design by quantitatively estimating mission medical risk. IMPACT v1.0 includes a novel evidence library baselined to exploration environments; an expanded list of 119 medical conditions; the addition of medical resources; and the ability for rapid and iterative analysis. Medical system risk estimates include loss of crew life, consideration of the need for return to definitive care (medical evacuation), and an estimate of crew time affected due to medical conditions. A notional long duration lunar orbit and lunar surface design reference mission (DRM) was chosen with a 4-astronaut crew to represent a sustained exploration Artemis mission. Results/Discussion Overall, IMPACT successfully quantified medical risk and derived an optimized medical system to support crew on a long duration lunar mission. In this DRM, the calculated loss of crew life from a medical event was 0.008 events per mission, risk of potential need for evacuation was 0.30 events per mission, and cumulative crew time affected by medical conditions was 103 days. The medical conditions that most contributed to overall medical risk were decompression sickness, trauma conditions, and respiratory failure. The conditions that had the largest effects on crew performance included musculoskeletal injuries and lunar dust exposure. The IMPACT-generated medical system included resources that target the most common and highest risk conditions. This systematic analysis demonstrates the value of the IMPACT tool in medical system design for human exploration spaceflight missions.

Missions to Mars↗

NASA NTRS2021

Propellant Delivery via VDC Driven Pump

The SMART (Scalable Mobile Autonomous Rocket engine Test) testbed system initiative at SSC was conceived to attempt to address many of the principal cost drivers in developing and maintaining a rocket engine test facility. The system (optimized to test engines and components generating up to 10K lbf nominal thrust) is serving as a testbed for innovative technologies and processes to provide lower cost test services with a rapid test cadence and expedient turnaround times. The system can also potentially be used as a testbed to test other related technologies relevant to surface situations (e.g., moon, Mars associated with crogenic fluid management, engine/component testing, autonomous operations, etc.). This FY20 CIF project, being conducted as part of the SMART testbed system, is developing and testing a propellant delivery system via electrically driven centrifugal pumps (obviating dependence upon Multi-Layer Pressure Vessels) with configuration and operation by a minimal number of personnel. During FY20 the team identified the requirements and worked with P3 and Masten Space Systems to develop the long lead (9 months after receipt of order) items, the 400 VDC pumps, for delivery in mid FY21. Since control of the 400 VDC pump motor is not well developed the team has established heuristics to control flows in LN2 at off nominal shaft speeds to allow deep throttling of the pump in flow test scenarios. Various test scenarios including nominal i.e. high flow high pressure, high flow low pressure, low flow high pressure, low flow low pressure, minimum throttle step change, and low inlet pressure cavitation testing were developed ahead of the anticipated hardware delivery and test. FY20 COVID Stage 3 conditions restricted access to the center and hindered lab work, so efforts focused on the system design and testing plans along with the project procurement paperwork for the hardware... now with its anticipated delivery in spring FY21. Some limited access to the center is expected by spring/summer FY21 for the continuing second year (FY21) CIF project effort meant to be focused upon system integration and initial testing.

Aaron Head↗

NASA NTRSDate not supplied

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

NASA NTRS2013

Optimal Integration of Departures and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations - spatial, temporal, and hybrid separations - were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buffer, spatial separation outperformed temporal separation when the uncertainty buffer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buffer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buffer sizes.

terminal airspace↗

NASA NTRS2015

Reduction of Subjective and Objective System Complexity

Occam's razor is often used in science to define the minimum criteria to establish a physical or philosophical idea or relationship. Albert Einstein is attributed the saying "everything should be made as simple as possible, but not simpler". These heuristic ideas are based on a belief that there is a minimum state or set of states for a given system or phenomena. In looking at system complexity, these heuristics point us to an idea that complexity can be reduced to a minimum. How then, do we approach a reduction in complexity? Complexity has been described as a subjective concept and an objective measure of a system. Subjective complexity is based on human cognitive comprehension of the functions and inter relationships of a system. Subjective complexity is defined by the ability to fully comprehend the system. Simplifying complexity, in a subjective sense, is thus gaining a deeper understanding of the system. As Apple's Jonathon Ive has stated," It's not just minimalism or the absence of clutter. It involves digging through the depth of complexity. To be truly simple, you have to go really deep". Simplicity is not the absence of complexity but a deeper understanding of complexity. Subjective complexity, based on this human comprehension, cannot then be discerned from the sociological concept of ignorance. The inability to comprehend a system can be either a lack of knowledge, an inability to understand the intricacies of a system, or both. Reduction in this sense is based purely on a cognitive ability to understand the system and no system then may be truly complex. From this view, education and experience seem to be the keys to reduction or eliminating complexity. Objective complexity, is the measure of the systems functions and interrelationships which exist independent of human comprehension. Jonathon Ive's statement does not say that complexity is removed, only that the complexity is understood. From this standpoint, reduction of complexity can be approached in finding the optimal or 'best balance' of the system functions and interrelationships. This is achievable following von Bertalanffy's approach of describing systems as a set of equations representing both the system functions and the system interrelationships. Reduction is found based on an objective function defining the system output given variations in the system inputs and the system operating environment. By minimizing the objective function with respect to these inputs and environments, a reduced system can be found. Thus, a reduction of the system complexity is feasible.

Watson, Michael D.↗

DOE OSTI2026

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗