Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random search”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a ppro~imate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

Kaplan, Sezgin↗
DOE OSTI2025

Predicted Ferromagnetism in Discovered Co–Bi Binary Phases

Binary solid-state materials offer unique insight into how the interplay of factors such as stoichiometry and bonding interactions affects magnetism and electronic properties. In this work, we considered systems where a transition metal provides the spin moment and a heavy main group element bolsters strong spin–orbit coupling. Within this context, cobalt, a known component of permanent magnets, and bismuth, functionally the heaviest element stable to radioactive decay, form a compelling combination. The Co–Bi system has been previously shown to exhibit superconductivity in a phase recovered from high pressure. We expected the Co−Bi system could also be ferromagnetic, resulting in two sets of compounds within one chemical system, one superconducting and one ferromagnetic. Subsequently, we investigated the Co–Bi system through both experimental and theoretical approaches to discover new candidates for permanent magnets. Ab initio random structure searching calculations identified five new compounds with diverse structural motifs that may form at higher pressures than previously reported. Experimental high-pressure synthesis yielded four compounds: α-CoBi, α-CoBi 2 , β-CoBi, and β-CoBi 2 . Three of these phases, α-CoBi 2 , β-CoBi, and β-CoBi 2 , were consistent with the calculated structures, corresponding to a 60% success rate for our structure search and underscoring the strength of combining computation with experiment. Theory predicts β-CoBi and β-CoBi2 are ferromagnetic, with β-CoBi possessing larger magnetocrystalline anisotropy energy than familiar permanent magnets such as CoPt and Nd–Fe–B. These results suggest the Co–Bi system could be a platform for understanding the factors that underpin magnetism and, to an extent, superconductivity in a chemically simple binary system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1976

Optical techniques for the detection of extrasolar planets - A critical review

Proposed optical techniques of extrasolar planet detection are discussed and compared. These include terrestrial, orbital, and moon-based systems. Terrestrial systems include ground-level searches for random eclipses of primaries and 'light' echoes of stellar flares from companion planets as well as balloon-mounted telescopes operating in the stratosphere used in conjunction with orbital occulters. Space telescopes considered are multimirror systems simulating huge mirror diameters and single-mirror telescopes, such as the 3-meter Large Space Telescope, used in conjunction with occulters. Although very modest systems are capable of detecting extrasolar planets, the amount of information we can gather regarding these worlds is a function of system complexity and program duration.

Matloff, G. L.↗
NASA NTRS1992

Stratospheric ozone depletion over Antarctica - Role of aerosols based on SAGE II satellite observations

The physical characteristics of the Antarctic stratospheric aerosol are investigated via a comprehensive analysis of the SAGE II data during the most severe ozone depletion episode of October 1987. The aerosol size distribution is found to be bimodal in several instances using the randomized minimization search technique, which suggests that the distribution of a single mode may be used to fit the data in the retrieved size range only at the expense of resolution for the larger particles. On average, in the region below 18 km, a wavelike perturbation with the upstream tilting for the parameters of mass loading, total number, and surface area concentration is found to be located just above the region of the most severe ozone depletion.

Lin, N.-H.↗
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
NASA NTRS2010

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Sen, Syamal K.↗
NASA NTRS1975

Application of multivariable search techniques to the optimization of airfoils in a low speed nonlinear inviscid flow field

Multivariable search techniques are applied to a particular class of airfoil optimization problems. These are the maximization of lift and the minimization of disturbance pressure magnitude in an inviscid nonlinear flow field. A variety of multivariable search techniques contained in an existing nonlinear optimization code, AESOP, are applied to this design problem. These techniques include elementary single parameter perturbation methods, organized search such as steepest-descent, quadratic, and Davidon methods, randomized procedures, and a generalized search acceleration technique. Airfoil design variables are seven in number and define perturbations to the profile of an existing NACA airfoil. The relative efficiency of the techniques are compared. It is shown that elementary one parameter at a time and random techniques compare favorably with organized searches in the class of problems considered. It is also shown that significant reductions in disturbance pressure magnitude can be made while retaining reasonable lift coefficient values at low free stream Mach numbers.

Hague, D. S.↗
NASA NTRS1981

Search strategy effects on PN acquisition performance

The present paper focusses on 'random' and 'expanding window' PN acquisition search strategies and analytically develops the PN acquisition time statistics as functions of salient system parameters such as prediction SNR, detection and false alarm probabilities and a priori information on epoch location. The significance of this analysis is its general applicability to arbitrary postdetection processing schemes. Computed performance results account for the above salient parameters, wherein sequential detection is employed in conjunction with random and selected expanding window search strategies.

Weinberg, A.↗
NASA NTRS2004

Improving Search Algorithms by Using Intelligent Coordinates

We consider algorithms that maximize a global function G in a distributed manner, using a different adaptive computational agent to set each variable of the underlying space. Each agent eta is self-interested; it sets its variable to maximize its own function g (sub eta). Three factors govern such a distributed algorithm's performance, related to exploration/exploitation, game theory, and machine learning. We demonstrate how to exploit alI three factors by modifying a search algorithm's exploration stage: rather than random exploration, each coordinate of the search space is now controlled by a separate machine-learning-based player engaged in a noncooperative game. Experiments demonstrate that this modification improves simulated annealing (SA) by up to an order of magnitude for bin packing and for a model of an economic process run over an underlying network. These experiments also reveal interesting small-world phenomena.

Wolpert, David H.↗
NASA NTRS2004

Robust local search for spacecraft operations using adaptive noise

Randomization is a standard technique for improving the performance of local search algorithms for constraint satisfaction. However, it is well-known that local search algorithms are constraints satisfaction. However, it is well-known that local search algorithms are to the noise values selected. We investigate the use of an adaptive noise mechanism in an iterative repair-based planner/scheduler for spacecraft operations. Preliminary results indicate that adaptive noise makes the use of randomized repair moves safe and robust; that is, using adaptive noise makes it possible to consistently achieve, performance comparable with the best tuned noise setting without the need for manually tuning the noise parameter.

planning↗
NASA NTRS2012

A Search Model for Imperfectly Detected Targets

Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

Ahumada, Albert↗
DOE OSTI2025

Capacitated p -hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches

By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.

Capacitated p-hub approach↗
NASA NTRS2013

Wind-Driven Wireless Networked System of Mobile Sensors for Mars Exploration

A revolutionary way is proposed of studying the surface of Mars using a wind-driven network of mobile sensors: GOWON. GOWON would be a scalable, self-powered and autonomous distributed system that could allow in situ mapping of a wide range of environmental phenomena in a much larger portion of the surface of Mars compared to earlier missions. It could improve the possibility of finding rare phenomena such as "blueberries' or bio-signatures and mapping their occurrence, through random wind-driven search. It would explore difficult terrains that were beyond the reach of previous missions, such as regions with very steep slopes and cluttered surfaces. GOWON has a potentially long life span, as individual elements can be added to the array periodically. It could potentially provide a cost-effective solution for mapping wide areas of Martian terrain, enabling leaving a long-lasting sensing and searching infrastructure on the surface of Mars. The system proposed here addresses this opportunity using technology advances in a distributed system of wind-driven sensors, referred to as Moballs.

Davoodi, Faranak↗
NASA NTRS1975

The Nimbus F Random Access Measurement System /RAMS/

In 1974, the Random Access Measurement System (RAMS) will be launched aboard the Nimbus F satellite as part of the Tropical Wind, Energy Conversion, and Reference Level Experiment (TWERLE). This paper describes operation and performance of the RAMS instrument, which will provide a means of tracking and collecting data from a large number of instrumented platforms. In operation, the RAMS will perform satellite onboard processing of up to eight simultaneous platform transmissions, following search and detection of the randomly received platform transmissions in a compressed-time expanded-frequency domain. The processed data is stored aboard the satellite for readout every 108 minutes (orbital period), and platform locational coordinates and/or velocity components are determined in a central ground data processing facility.

Coates, J. L.↗
NASA NTRS1994

A comparison of Boolean-based retrieval to the WAIS system for retrieval of aeronautical information

An evaluation of an information retrieval system using a Boolean-based retrieval engine and inverted file architecture and WAIS, which uses a vector-based engine, was conducted. Four research questions in aeronautical engineering were used to retrieve sets of citations from the NASA Aerospace Database which was mounted on a WAIS server and available through Dialog File 108 which served as the Boolean-based system (BBS). High recall and high precision searches were done in the BBS and terse and verbose queries were used in the WAIS condition. Precision values for the WAIS searches were consistently above the precision values for high recall BBS searches and consistently below the precision values for high precision BBS searches. Terse WAIS queries gave somewhat better precision performance than verbose WAIS queries. In every case, a small number of relevant documents retrieved by one system were not retrieved by the other, indicating the incomplete nature of the results from either retrieval system. Relevant documents in the WAIS searches were found to be randomly distributed in the retrieved sets rather than distributed by ranks. Advantages and limitations of both types of systems are discussed.

Marchionini, Gary↗
NASA NTRS1994

Performance of a 2-micrometer coherent Doppler lidar for wind measurements

Measurements of boundary layer winds are presented using a 2-micrometer coherent Doppler lidar and the optimal performance of the maximum likelihood estimator. The systematic error for single-shot estimates was estimated as 3.6 cm/s using measurements from a stationary hard target. The estimation error for measurements of the radial component of the wind field was determined, as well as the fraction of the estimates that are randomly distributed over the velocity search space, when the signal power is low and speckle fading is important. The results from actual data are compared with the results from ideal simulations. The first direct estimation of the spatial structure function of the radial wind field and of the energy dissipation rate is presented for both horizontal and vertical directions of propagation. The rms estimation error of the velocity estimates is found to be within 30% of ideal performance based on simulation.

Frehlich, Rod↗
NASA NTRS1994

Search Space Characterization for a Telescope Scheduling Application

This paper presents a technique for statistically characterizing a search space and demonstrates the use of this technique within a practical telescope scheduling application. The characterization provides the following: (i) an estimate of the search space size, (ii) a scaling technique for multi-attribute objective functions and search heuristics, (iii) a "quality density function" for schedules in a search space, (iv) a measure of a scheduler's performance, and (v) support for constructing and tuning search heuristics. This paper describes the random sampling algorithm used to construct this characterization and explains how it can be used to produce this information. As an example, we include a comparative analysis of an heuristic dispatch scheduler and a look-ahead scheduler that performs greedy search.

Bresina, John↗
NASA NTRS1999

Using a Genetic Algorithm to Model Broadband Regional Waveforms for Crustal Structure in the Western United States

In this study, we analyze regional seismograms to obtain the crustal structure in the eastern Great Basin and western Colorado plateau. Adopting a for- ward-modeling approach, we develop a genetic algorithm (GA) based parameter search technique to constrain the one-dimensional crustal structure in these regions. The data are broadband three-component seismograms recorded at the 1994-95 IRIS PASSCAL Colorado Plateau to Great Basin experiment (CPGB) stations and supplemented by data from U.S. National Seismic Network (USNSN) stations in Utah and Nevada. We use the southwestern Wyoming mine collapse event (M(sub b) = 5.2) that occurred on 3 February 1995 as the seismic source. We model the regional seismograms using a four-layer crustal model with constant layer parameters. Timing of teleseismic receiver functions at CPGB stations are added as an additional constraint in the modeling. GA allows us to efficiently search the model space. A carefully chosen fitness function and a windowing scheme are added to the algorithm to prevent search stagnation. The technique is tested with synthetic data, both with and without random Gaussian noise added to it. Several separate model searches are carried out to estimate the variability of the model parameters. The average Colorado plateau crustal structure is characterized by a 40-km-thick crust with velocity increases at depths of about 10 and 25 km and a fast lower crust while the Great Basin has approximately 35- km-thick crust and a 2.9-km-thick sedimentary layer.

Bhattacharyya, Joydeep↗