Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimizer”

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 433 records · Page 24

Optimization on Manifolds via Graph Gaussian Processes

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Bayesian optimization↗

Investigating a Renewable-Resource-Targeting Mobile Aquaculture System Using Route Optimization Based on Optimal Foraging Theory

Aquaculture systems require careful consideration of location, which determines water conditions, pollution impacts, and hazardous conditions. Mobility may be able to address these factors while also supporting the targeting of renewable energy sources such as wind, wave, and solar power throughout the year. In this paper, a purpose-built mobile aquaculture ship is identified and modeled with a combination of renewable energy harvesting capabilities as a case study with the objective of assessing the potential benefits of targeting high renewable energy potentials to power aquaculture operations. A route optimization algorithm is created and tuned to simulate the mobility of the aquaculture platform and cost-basis comparisons are made to a stationary system. The small spatial variability in renewable energy potential when combining multiple resources significantly limits the benefits of a mobile, renewable-targeting aquaculture system. On the other hand, the consistent energy harvest from a blend of renewable energy types (13 kW installed wind capacity, 661 m 2 installed solar, and 1 m characteristic width wave-energy converter) suggests that the potential benefits of a mobile platform for offshore aquaculture (mitigation of environmental and social concerns, any potential positive impact on yields, hazard avoidance, etc.) can likely be pursued without significant increases in energy harvester costs.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Optimizing the self-assembly of conjugated polymers and small molecules through structurally programmed non-covalent control

Organic conjugated polymers and oligomers are key electronic materials for applications such as transistors, photovoltaics, and light emitting devices due to their potential for solution processability, mechanical flexibility, and precise structure-based tuning compared to inorganic materials. In dilute environments, the optoelectronic properties of conjugated polymers are largely governed by their constitutional structure and, to a lesser degree, their solution-state intramolecular configuration. In the solid state, intramolecular conformation and intermolecular electronic coupling impact these properties substantially, especially in relation to device performance. Therefore, an increasingly important area of research concerning conjugated materials is developing design strategies aimed at optimizing the solid-state packing for electronic applications. Programming solid-state packing arrangements through discrete non-covalent interactions is an emerging strategy within the context of conjugated polymers. This review focuses on the use of the two most prevalent discrete and directional interactions used to dictate the self-assembly of conjugated polymers and oligomers—hydrogen bonds and chalcogen bonds. Further, we also discuss how these design motifs can imbue conjugated materials with appealing physical properties while simultaneously retaining or improving electronic capabilities.

36 MATERIALS SCIENCE↗

Conservative numerical schemes with optimal dispersive wave relations: Part I. Derivation and analysis

An energy-conserving and an energy-and-enstrophy conserving numerical schemes are derived by approximating the Hamiltonian formulation of the inviscid shallow water flows based on the vorticity-divergence variables. These schemes also conserve the first-order moments such as mass and vorticity, as usual. The conservative properties of the schemes stem from the skew-symmetry and singularities of the Poisson brackets, which are carefully retained in the discrete approximations. Here, the schemes operate on unstructured orthogonal dual meshes, over bounded or unbounded domains, and they are also shown to possess the same optimal dispersive wave relations as those of the Z-grid scheme, which is a consequence of the use of the vorticity and divergence variables.

54 ENVIRONMENTAL SCIENCES↗

Increasing Biomass Production on Limited Land Area Through an Optimal Planting Arrangement

Planting density is a primary consideration in silviculture; however, planting arrangement is often ignored. Most, if not all, forest plantations are arranged in rectangular or square lattices (i.e., grids). Using a simple mathematical model, we investigate the potential influence of planting arrangement on planting density, biomass yield, and rotation period by assuming that efficiently arranging trees is similar to packing congruent circles on a plane. The hexagonal lattice achieves the densest circle packing on a plane; therefore, a hexagonal or triangular lattice arrangement of stems provides the highest planting density for a given spacing. Using packing density to quantify arrangement efficiency, tree crowns in a hexagonal lattice fill approximately 90.7% of available area at initial canopy contact, while tree crowns in a square lattice fill approximately 78.5% of available area at initial canopy contact. The hexagonal lattice permits about a 15% higher density than the square lattice, which allows canopy closure to occur earlier without any change in individual tree growth. Short rotation woody crop (SRWC) systems are excellent candidates under the model's assumptions of level stand with even-age monoculture. If belowground resources are non-limiting, a hexagonal lattice arrangement shortens rotation period and thus optimizes the biomass yield per land area over time. Lastly, higher productivity over time is central to sustainable and efficient use of limited area for bioenergy and biomass products.

09 BIOMASS FUELS↗

A GPU-based Approach for Path Planning Optimization via Travel Length Reduction

Typically, before constructing an object with an additive manufacturing system, the 3D object must be sent through a process called slicing. Slicing converts a 3D object commonly in the form of an STL file into a set of layers by horizontally intersecting a plane with the object at various heights. At each height, called a layer, multiple 2D polygons can be generated. Each polygon represents a boundary for solid geometry and is called an island. Each island is then comprised of multiple path types in an attempt to optimally fill the polygon. To move between each island and each islands’ paths, travels are inserted. Travels are simply motion by the system to move from one area of construction to another. Travels do not contribute to the construction of the object, and so, are considered wasted motion. In large-scale additive manufacturing, objects can be quite large and the distance between islands can be large as well. As a result, these travels can waste a significant amount of time. Ideally, travels would be as short as possible, however, computing global minimal travel paths is computationally expensive. To combat this problem, researchers at Oak Ridge National Lab developed a GPU-based approach to travel insertion based on a unique factoradic representation. This representation was then utilized by the GPU to solve the Traveling Salesman Problem (TSP). This algorithm was able to compute global minimal travel paths quickly resulting in faster object construction. A general investigation was also carried out to determine when a GPU vs CPU implementation would be beneficial.

Borish, Michael↗