Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Heuristic Modeling for TRMM Lifetime Predictions

Analysis time for computing the expected mission lifetimes of proposed frequently maneuvering, tightly altitude constrained, Earth orbiting spacecraft have been significantly reduced by means of a heuristic modeling method implemented in a commercial-off-the-shelf spreadsheet product (QuattroPro) running on a personal computer (PC). The method uses a look-up table to estimate the maneuver frequency per month as a function of the spacecraft ballistic coefficient and the solar flux index, then computes the associated fuel use by a simple engine model. Maneuver frequency data points are produced by means of a single 1-month run of traditional mission analysis software for each of the 12 to 25 data points required for the table. As the data point computations are required only a mission design start-up and on the occasion of significant mission redesigns, the dependence on time consuming traditional modeling methods is dramatically reduced. Results to date have agreed with traditional methods to within 1 to 1.5 percent. The spreadsheet approach is applicable to a wide variety of Earth orbiting spacecraft with tight altitude constraints. It will be particularly useful to such missions as the Tropical Rainfall Measurement Mission scheduled for launch in 1997, whose mission lifetime calculations are heavily dependent on frequently revised solar flux predictions.

Jordan, P. S.↗
NASA NTRS1999

A Heuristic Approach to Examining Volatile Equilibrium at Titan's Surface

R. D. Lorenz, J. I. Lunine, and C. P. McKay have shown in a manuscript accepted for publication that, for a given ethane abundance and surface temperature, the nitrogen and methane abundances in Titan's atmosphere can be calculated, yielding a surface pressure that can be compared with the observed value. This is potentially a very valuable tool for examining the evolution of Titan's climatology. Its validity does depend on two important assumptions, however: 1) that the atmosphere of Titan is in global radiative equilibrium, and 2) that volatiles present are in vapor equilibrium with the surface. The former assumption has been shown to be likely, but the latter has not. Water vapor in the Earth's atmosphere, in fact, is generally not very close to equilibrium in a global sense. In the present work a heuristic approach is used to examine the likelihood that methane vapor is in equilibrium with Titan's surface. Plausible climate scenerios are examined that are consistent with methane vapor abundances derived from Voyager IRIS data. Simple precipitation and surface diffusion models are incorporated into the analysis. It is tentatively inferred that methane may be in surface equilibrium near the poles, but that equilibrium at low latitudes is more difficult to establish.

Samuelson, Robert E.↗
NASA NTRS2003

Symbolic Heuristic Search for Factored Markov Decision Processes

We describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states. We combine these two approaches in a novel way that exploits symbolic model-checking techniques and demonstrates their usefulness for decision-theoretic planning.

Morris, Robert↗
NASA NTRS2003

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗
NASA NTRS2010

A Heuristic Model of Consciousness with Applications to the Development of Science and Society

A working model of consciousness is fundamental to understanding of the interactions of the observer in science. This paper examines contemporary understanding of consciousness. A heuristic model of consciousness is suggested that is consistent with psycophysics measurements of bandwidth of consciousness relative to unconscious perception. While the self reference nature of consciousness confers a survival benefit by assuring the all points of view regarding a problem are experienced in sufficiently large population, conscious bandwidth is constrained by design to avoid chaotic behavior. The multiple hypotheses provided by conscious reflection enable the rapid progression of science and technology. The questions of free will and the problem of attention are discussed in relation to the model. Finally the combination of rapid technology growth with the assurance of many unpredictable points of view is considered in respect to contemporary constraints to the development of society.

Curreri, Peter A.↗
NASA NTRS2013

Mixed Integer Programming and Heuristic Scheduling for Space Communication

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Lee, Charles H.↗
NASA NTRS2015

A Heuristic Approach to Correlating ERAM Flight Data from Twenty Centers

Among its many other functions, the Federal Aviation Administration’s En Route Automation Modernization (ERAM) provides external systems with real-time air traffic data for flights in enroute airspace in the National Airspace System. It replaced the En Route Host computer and backup system used at 20 FAA Air Route Traffic Control Centers (Centers) nationwide. Among the new features of ERAM, its output data stream of flight plan and track data includes a unique identifier for a flight originating in any one of the 20 ERAM Centers. The unique identifier, called the Global Unique Flight Identifier (GUFI), is persistent across all the Centers that track the flight. However, certain factors make it difficult to correlate data using the GUFI. First, the value of the GUFI is only unique within a time window of seven days. Second, the GUFI is attached only to flight-plan related data messages. Finally, track positions reported by ERAM do not reference the GUFI. In order to correlate historical as well as real time flight-plan and position related ERAM data, an efficient, heuristic approach was developed, and a prototype was developed. The approach showed that the processing speed, through parallel processing, is sufficient to correlate ERAM data in real-time. As described in this paper, when there are multiple track positions reported from multiple Centers within a few seconds, each position is assigned with a weighted score to indicate the quality of the position relative to its last know position. The weighted score can be used to eliminate potentially duplicate track positions. The approach is database-agnostic, and can be implemented in a Big Data system such as an Apache Hadoop system, as well as in traditional database systems.

Correlating ERAM Flight Data↗
NASA NTRS2019

On Benchmarking Quantum Heuristics

Present an outline of important aspects for benchmarking quantum algorithms, in particular quantum heuristics. Using quantum approximate optimization algorithm as an example, we demonstrate how the choice of cost Hamiltonian, of mixer, and of initial states can affect the performance. We also discuss how realistic aspects of near-term quantum hardware will influence the algorithm performance.

Wang, Zhihui↗
NASA NTRSDate not supplied

REACTER: A Heuristic Method for Reactive Molecular Dynamics

REACTER (www.reacter.org) is a heuristic protocol that enables the simulation of complex reactions using atomistic molecular dynamics (MD) with a fixed-valence force field. Incorporating reactions into classical MD with this approach allows modeling of reactive systems over greatly-increased time scales, enabling systems to be modeled with MD that would not otherwise be feasible. One or more competing multi-step reactions or series of reactions can be invoked simultaneously. Special treatment can be applied to neighboring atoms to relax high energy configurations while the simulation progresses. The original version of REACTER, which was implemented in the open-source LAMMPS simulation package as fix bond/react, was only available for serial simulations. This work describes the expansion of fix bond/react for use in parallel simulations, as well as the addition of various new options, including deletion of reaction by-products, reversible reactions, and custom reaction constraints. These new capabilities are demonstrated through large-scale simulations (200,000+ atoms) of the polymerization of polystyrene and nylon 6,6. The morphologies of both polymers are analyzed after reaching >99% extent of polymerization. Finally, the newly-added reversible reactions feature is demonstrated by rupturing these highly-entangled systems under uniaxial strain by defining a chain scission reaction.

polymer simulations, molecular dynamics↗
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 OSTI2024

Heuristic algorithms for design of integrated monitoring of geologic carbon storage sites

Designs for Risk Evaluation and Management (DREAM) is a tool developed under the National Risk Assessment Partnership (NRAP) to enhance geologic carbon storage safety and efficiency. Using potential leakage scenarios generated externally by the users preferred history-matching approach, DREAM constructs ideal combinations of sensor locations in the right place at the right time to detect as many leaks as possible, detect them as early as possible, and minimize cost. This user-friendly tool, developed in Java, features a window-based GUI for input and a 3D visualization tool for viewing the domain space and optimized monitoring plans. DREAM's latest version accommodates real-world usage by allowing for joint optimization of wellbore point sensor placements and surface geophysics survey geometries, and by using more efficient multi-objective optimization algorithms. We show an example where, these two improvements combined allow us to support containment assurance and go from detecting 80–90 % of the potential CO 2 leakage to +99.7 %, a step-change improvement that can make the deciding difference in whether a site is suitable for geologic carbon storage. Though developed for geologic carbon storage, this tool would be equally applicable in many surface or offshore environmental monitoring projects.

58 GEOSCIENCES↗
DOE OSTI2024

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Heuristic predictions of RMP configurations for ELM suppression in ITER burning plasmas and their impact on divertor performance

Abstract A subspace of resonant magnetic perturbation (RMP) configurations for edge localized mode (ELM) suppression is predicted for H-mode burning plasmas at 15 MA current and 5.3 T magnetic field in ITER. Perturbations to the core plasma can be reduced by a factor of 2 for equivalent edge stability proxies, while the perturbed plasma boundary geometry remains mostly resilient. The striated domain of perturbed field lines connecting from the main plasma (normalized poloidal flux < 1 ) to the divertor targets is found to be significantly larger than the expected heat load width in the absence of RMPs. This facilitates heat load spreading with peak values at an acceptable level below 10 MW m − 2 on the outer target already at moderate gas fueling and low Ne seeding for additional radiative dissipation of the 100 MW of power into the scrape-off layer (SOL). On the inner target, however, re-attachment is predicted away from the equilibrium strike point due to increased upstream heat flux, higher downstream temperature and less efficient impurity radiation.

3D plasma boundary modeling↗
DOE OSTI2026

Modelling belowground plant acclimation to low soil nitrogen – a heuristic optimality-based approach

Increased root growth to access greater soil mineral nitrogen resources and increased root exudation to stimulate microbial mineralization of soil organic nitrogen are widely observed plant acclimations to nitrogen limitation. However, their quantitative contribution to plant growth and ecosystem productivity remains largely elusive. Here, we present a novel optimality-based eco-evolutionary model in which plants dynamically regulate carbon partitioning between root growth and exudation to maximize their aboveground growth. Our simulations indicated that the availability of soil mineral and organic nitrogen as well as plant nitrogen demand and nitrogen uptake capacity shape optimal carbon partitioning between root growth and exudation. The simulated carbon allocation patterns aligned with empirical studies on belowground plant responses to varying soil nitrogen resources. Our eco-evolutionary approach represents a paradigmatic change in modelling plant nitrogen foraging, which is essential to generate hypotheses on optimal plant acclimation in future soil environments characterized by more erratic nitrogen availability.

Chakrawal, Arjun (ORCID:0000000345724347)↗