Search NASA⌕ Search

SEARCH · Search NASA

Results for “Search algorithm”

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

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗
NASA NTRS2005

Reconfiguration of Analog Electronics for Extreme Environments: Problem or Solution?

This paper argues in favor of adaptive reconfiguration as a technique to expand the operational envelope of analog electronics for extreme environments (EE). In addition to hardening-by-process and hardening-by-design, "hardening-by-reconfiguration", when applicable, could be used to mitigate drifts, degradation, or damage on electronic devices (chips) in EE, by using re-configurable devices and an adaptive self-reconfiguration of their circuit topology. Conventional circuit design exploits device characteristics within a certain temperature/radiation range; when that is exceeded, the circuit function degrades. On a reconfigurable device, although component parameters change in EE, as long as devices still operate, albeit degraded, a new circuit design, suitable for new parameter values, may be mapped into the reconfigurable structure to recover the initial circuit function. Partly degraded resources are still used, while completely damaged resources are bypassed. Designs suitable for various environmental conditions can be determined prior to operation or can be determined in-situ, by adaptive reconfiguration algorithms running on built-in digital controllers. Laboratory demonstrations of this technique were performed by JPL in several independent experiments in which bulk CMOS reconfigurable devices were exposed to, and degraded by, low temperatures (approx. 196 C), high temperatures (approx.300 C) or radiation (300kRad TID), and then recovered by adaptive reconfiguration using evolutionary search algorithms. Taking this technology from Technology Readiness Level (TRL) 3 to TRL 5 is the target of a current NASA project.

Field Programmable Transistor Array (FPTA)↗
NASA NTRS2021

Small UAV Flight Planning in Urban Environments

This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.

Path planning↗
NASA NTRS2017

Kepler Planet Detection Metrics: Per-Target Flux-Level Transit Injection Tests of TPS for Data Release 25

Quantifying the ability of a transiting planet survey to recover transit signals has commonly been accomplished through Monte-Carlo injection of transit signals into the observed data and subsequent running of the signal search algorithm (Gilliland et al., 2000; Weldrake et al., 2005; Burke et al., 2006). In order to characterize the performance of the Kepler pipeline (Twicken et al., 2016; Jenkins et al., 2017) on a sample of over 200,000 stars, two complementary injection and recovery tests are utilized:1. Injection of a single transit signal per target into the image or pixel-level data, hereafter referred to as pixel-level transit injection (PLTI), with subsequent processing through the Photometric Analysis (PA), Presearch Data Conditioning (PDC), Transiting Planet Search (TPS), and Data Validation (DV) modules of the Kepler pipeline. The PLTI quantification of the Kepler pipeline's completeness has been described previously by Christiansen et al. (2015, 2016); the completeness of the final SOC 9.3 Kepler pipeline acting on the Data Release 25 (DR25) light curves is described by Christiansen (2017).2. Injection of multiple transit signals per target into the normalized flux time series data with a subsequent transit search using a stream-lined version of the Transiting Planet Search (TPS) module. This test, hereafter referred to as flux-level transit injection (FLTI), is the subject of this document. By running a heavily modified version of TPS, FLTI is able to perform many injections on selected targets and determine in some detail which injected signals are recoverable. Significant numerical efficiency gains are enabled by precomputing the data conditioning steps at the onset of TPS and limiting the search parameter space (i.e., orbital period, transit duration, and ephemeris zero-point) to a small region around each injected transit signal.The PLTI test has the advantage that it follows transit signals through all processing steps of the Kepler pipeline, and the recovered signals can be further classified as planet candidates or false positives in the exact same manner as detections from the nominal (i.e., observed) pipeline run (Twicken et al., 2016, Thompson et al., in preparation). To date, the PLTI test has been the standard means of measuring pipeline completeness averaged over large samples of targets (Christiansen et al., 2015, 2016; Christiansen, 2017). However, since the PLTI test uses only one injection per target, it does not elucidate individual-target variations in pipeline completeness due to differences in stellar properties or astrophysical variability. Thus, we developed the FLTI test to provide a numerically efficient way to fully map individual targets and explore the performance of the pipeline in greater detail. The FLTI tests thereby allow a thorough validation of the pipeline completeness models (such as window function (Burke and Catanzarite, 2017a), detection efficiency (Burke Catanzarite, 2017b), etc.) across the spectrum of Kepler targets (i.e., various astrophysical phenomena and differences in instrumental noise). Tests during development of the FLTI capability revealed that there are significant target-to-target variations in the detection efficiency.

DR25↗
NASA NTRS2016

Exploring the Use of Alfven Waves in Magnetometer Calibration at Geosynchronous Orbit

An Alfven wave is a type magnetohydrodynamicwave that travels through a conducting fluid under the influence of a magnetic field. Researchers have successfully calculated offset vectors of magnetometers in interplanetary space by optimizing the offset to maximize certain Alfvenic properties of observed waves (Leinweber, Belcher). If suitable Alfven waves can be found in the magnetosphere at geosynchronous altitude then these techniques could be used to augment the overall calibration plan for magnetometers in this region such as on the GOES spacecraft, possibly increasing the time between regular maneuvers. Calibration maneuvers may be undesirable because they disrupt the activities of other instruments. Various algorithms to calculate an offset using Alfven waves were considered. A new variation of the Davis-Smith method was derived because it can be mathematically shown that the Davis-Smith method tolerates filtered data, which expands potential applications. The variant developed was designed to find only the offset in the plane normal to the main field because the overall direction of Earth's magnetic field rarely changes, and theory suggests the Alfvenic disturbances occur transverse to the main field. Other variations of the Davis-Smith method encounter problems with data containing waves that propagate in mostly the same direction. A searching algorithm was then designed to look for periods of time with potential Alfven waves in GOES 15 data based on parameters requiring that disturbances be normal to the main field and not change field magnitude. Final waves for calculation were hand-selected. These waves produced credible two-dimensional offset vectors when input to the Davis-Smith method. Multiple two-dimensional solutions in different planes can be combined to get a measurement of the complete offset. The resulting three dimensional offset did not show sufficient precision over several years to be used as a primary calibration method, but reflected changes in the offset fairly well, suggesting that the method could be helpful in monitoring trends of the offset vector when maneuvers cannot be used.

calibration↗
NASA NTRS2005

Designing Agent Utilities for Coordinated, Scalable and Robust Multi-Agent Systems

Coordinating the behavior of a large number of agents to achieve a system level goal poses unique design challenges. In particular, problems of scaling (number of agents in the thousands to tens of thousands), observability (agents have limited sensing capabilities), and robustness (the agents are unreliable) make it impossible to simply apply methods developed for small multi-agent systems composed of reliable agents. To address these problems, we present an approach based on deriving agent goals that are aligned with the overall system goal, and can be computed using information readily available to the agents. Then, each agent uses a simple reinforcement learning algorithm to pursue its own goals. Because of the way in which those goals are derived, there is no need to use difficult to scale external mechanisms to force collaboration or coordination among the agents, or to ensure that agents actively attempt to appropriate the tasks of agents that suffered failures. To present these results in a concrete setting, we focus on the problem of finding the sub-set of a set of imperfect devices that results in the best aggregate device. This is a large distributed agent coordination problem where each agent (e.g., device) needs to determine whether to be part of the aggregate device. Our results show that the approach proposed in this work provides improvements of over an order of magnitude over both traditional search methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents failed midway through the simulation) the system's performance degrades gracefully and still outperforms a failure-free and centralized search algorithm. The results also show that the gains increase as the size of the system (e.g., number of agents) increases. This latter result is particularly encouraging and suggests that this method is ideally suited for domains where the number of agents is currently in the thousands and will reach tens or hundreds of thousands in the near future.

Tumer, Kagan↗
NASA NTRS1999

Remote Sensing of Rain

The first problem addressed concerns passive-microwave rain retrievals. Most current approaches start by building off-line a cloud-model-derived database. Given data, the retrieval algorithms search the database for the microwave temperatures "closest" to the observed data, then after some fine-tuning (performed in different ways by different implementations) the rain is estimated to be that which corresponds to the selected (and fine-tuned) set of database temperatures. These approaches have three drawbacks: they cannot properly take into account the ambiguities which arise from the fact that several rain scenarios can produce the same observed temperatures; they are quite inefficient since they require manipulating a large database along with often complex "fine-tuning" procedures; and they cannot refine their estimates if additional data is available. This past year we have derived closed formulae relating observed microwave brightness temperatures, T(sub b), and the underlying rain rates, R: average T(sub b) =f (rain) and average rain = g (T(sub b)), along with the corresponding covariance matrices. These results are sufficient to describe the conditional probabilities p(R/T(sub b)) and p(T(sub b)/R) to second order. Progress has also been made towards deriving a robust description of the rain drop size distribution (DSD). The widespread approach consisting in parameterizing the DSD as a gamma-distribution in terms of the drop diameter D suffers from the facts that, in reality, the DSD is not a smooth function of D and that the largely arbitrary Gamma model imposes unintended behavior, which has implications on any quantities derived from the DSD model. We have therefore developed a non-parametric yet practical description of the DSD, which is particularly well-suited for use in remote-sensing applications. The diagram on the left shows a comparison between an actual DSD sample and the truncated non-parametric representation. One figure shows the relation between radar reflectivity and rain rate derived using this representation. Validation of the Tropical Rainfall Measuring Mission (TRMM) radar-radiometer combined R and DSD algorithm is underway. This algorithm was designed to make optimal use of the instantaneous reflectivity profiles measured by the TRMM radar and the microwave brightness temperatures measured by the TRMM passive radiometer. So far, it appears to be the most reliable TRMM rain algorithm.

Haddad, Ziad S.↗
NASA NTRS1974

Gust alleviation for a STOL transport by using elevator, spoilers, and flaps

Control laws were developed to investigate methods of alleviating the response of a STOL transport to gusty air. The transport considered in the study had triple-slotted, externally blown jet flaps and a large T-tail. The control devices used were the elevator, spoilers, and flaps. A hybrid computing system was used to simulate linearized longitudinal dynamics of the aircraft and to implement a conjugate gradient optimal search algorithm. The aircraft was simulated in the low-speed approach condition only. Feedback control matrices were found which minimized the average of a quadratic functional involving passenger compartment accelerations, pitch angle and rate, flight path angle and speed variations. The optimization was performed for artificially designed gust inputs in the form of predetermined rectangular waveforms. Results were obtained for elevator, spoilers, and flaps acting singly and in combination. Additional results were obtained for unit sinusoidal gust inputs by using the gain matrices computed for the artificial test gusts. Various sensor configurations were also investigated.

Lallman, F. J.↗
NASA NTRS1975

The analysis of the pilot's cognitive and decision processes

Articles are presented on pilot performance in zero-visibility precision approach, failure detection by pilots during automatic landing, experiments in pilot decision-making during simulated low visibility approaches, a multinomial maximum likelihood program, and a random search algorithm for laboratory computers. Other topics discussed include detection of system failures in multi-axis tasks and changes in pilot workload during an instrument landing.

Curry, R. E.↗
NASA NTRS1976

A first look at the application of signal extraction techniques to the analysis of body surface potential maps

Partial body surface potential maps from both normal subjects and subjects with independently diagnosed myocardial infarcts are visually compared from superimposed plots. A correlation test is devised to distinguish the two groups, with the reference waveform determined by means of a gradient-search algorithm. The results are encouraging, and suggest further investigation of these techniques as a future diagnostic tool.

Weinstein, S. B.↗
NASA NTRS1975

Table-aided design of the energy-storage reactor in dc-to-dc converters

A new procedure for the selection of magnetic cores for use in energy-storage dc-to-dc power converters which eliminates the need for an automated computer search algorithm and stored data file is presented. The converter configurations included in the procedure are the three commonly encountered single-winding converters for voltage step-up, for current step-up and for voltage step-up/current step-up, and for the two-winding converter for voltage step-up/current step-up. For each converter configuration, three types of controllers are considered - constant-frequency, constant on-time and constant off-time. Using concepts developed from analyses of these converters by considering the transfer of energy by means of an energy-storage inductor or transformer, a special table of parameters calculated from magnetic core data is constructed and leads to a considerably simplified design procedure.

Owen, H. A., Jr.↗
NASA NTRS1978

Preliminary design of composite wings for buckling, strength and displacement constraints

An unstiffened panel buckling constraint for balanced, symmetric laminated composites is included on the global design level in a mathematical programming structural optimization procedure for designing wing structures. Constraints are introduced by penalty functions, and Newton's method based on approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. Constraint approximations used during the optimization process contribute to the computational efficiency of the procedure. A criterion is developed that identifies the appropriate conservative form of the constraint approximations that are used with the optimization procedure. Minimum-mass design results are obtained for a multispar high-aspect-ratio wing subjected to material strength, minimum-gage, displacement, panel buckling and twist constraints. The material systems considered for the examples are all graphite-epoxy, graphite-epoxy with boron-epoxy spar caps, and all aluminum. The composite material designs are shown to have an advantage over the aluminum designs since they can often satisfy additional constraints with only small mass increases.

Starnes, J. H., Jr.↗
NASA NTRS1980

Preliminary design of composite wing-box structures for global damage tolerance

A procedure is presented that incorporates the influence of potential global damage conditions into the design process for minimum-mass wing-box structures. The procedure is based on mathematical-programming optimization techniques. Material-strength, minimum-gage, and panel-buckling constraints are introduced by penalty functions, and Newton's method with approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. A potential global damage condition is represented by a structural model with the damaged components removed. Example minimum-mass designs are obtained that simultaneously satisfy the constraints of the damaged and undamaged configurations of both graphite-epoxy and aluminum wing-box structural models. These examples are designed with and without the influence of potential damage conditions, and results indicate that for equal mass cases the residual strength of a damaged structure is higher when the influence of potential damage is properly included in the design from the outset. Results of these examples also identify the minimum structural mass increase required to increase residual strength levels.

Starnes, J. H., Jr.↗
NASA NTRS1983

Parameter estimation in truss beams using Timoshenko beam model with damping

Truss beams with members having viscous damping are modeled with a Timoshenko beam. Procedures for deriving the equivalent bending rigidity, transverse shear rigidity, and damping are presented. Explicit expressions for these equivalent beam properties are obtained for a specific truss beam. The beam model thus established is then used to investigate the effect of damping in free vibration. Finally, the beam is employed in the estimation of structural parameters in a simply-supported truss beam using a random search algorithm.

Sun, C. T.↗
NASA NTRS1985

Collection and analysis of NASA clean room air samples

The environment of the HALOE assembly clean room at NASA Langley Research Center is analyzed to determine the background levels of airborne organic compounds. Sampling is accomplished by pumping the clean room air through absorbing cartridges. For volatile organics, cartridges are thermally desorbed and then analyzed by gas chromatography and mass spectrometry, compounds are identified by searching the EPA/NIH data base using an interactive operator INCOS computer search algorithm. For semivolatile organics, cartridges are solvent entracted and concentrated extracts are analyzed by gas chromatography-electron capture detection, compound identification is made by matching gas chromatogram retention times with known standards. The detection limits for the semivolatile organics are; 0.89 ng cu m for dioctylphlhalate (DOP) and 1.6 ng cu m for polychlorinated biphenyls (PCB). The detection limit for volatile organics ranges from 1 to 50 parts per trillion. Only trace quantities of organics are detected, the DOP levels do not exceed 2.5 ng cu m and the PCB levels do not exceed 454 ng cu m.

Sheldon, L. S.↗