Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point Optimization”

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 1,783 records · Page 99

Efficient Kriging via Fast Matrix-Vector Products

Interpolating scattered data points is a problem of wide ranging interest. Ordinary kriging is an optimal scattered data estimator, widely used in geosciences and remote sensing. A generalized version of this technique, called cokriging, can be used for image fusion of remotely sensed data. However, it is computationally very expensive for large data sets. We demonstrate the time efficiency and accuracy of approximating ordinary kriging through the use of fast matrixvector products combined with iterative methods. We used methods based on the fast Multipole methods and nearest neighbor searching techniques for implementations of the fast matrix-vector products.

Memarsadeghi, Nargess↗

Feedback-Driven Dynamic Invariant Discovery

Program invariants can help software developers identify program properties that must be preserved as the software evolves, however, formulating correct invariants can be challenging. In this work, we introduce iDiscovery, a technique which leverages symbolic execution to improve the quality of dynamically discovered invariants computed by Daikon. Candidate invariants generated by Daikon are synthesized into assertions and instrumented onto the program. The instrumented code is executed symbolically to generate new test cases that are fed back to Daikon to help further re ne the set of candidate invariants. This feedback loop is executed until a x-point is reached. To mitigate the cost of symbolic execution, we present optimizations to prune the symbolic state space and to reduce the complexity of the generated path conditions. We also leverage recent advances in constraint solution reuse techniques to avoid computing results for the same constraints across iterations. Experimental results show that iDiscovery converges to a set of higher quality invariants compared to the initial set of candidate invariants in a small number of iterations.

Daikon↗

Design and Analysis of an X-Ray Mirror Assembly Using the Meta-Shell Approach

Lightweight and high resolution optics are needed for future space-based x-ray telescopes to achieve advances in high-energy astrophysics. Past missions such as Chandra and XMM-Newton have achieved excellent angular resolution using a full shell mirror approach. Other missions such as Suzaku and NuSTAR have achieved lightweight mirrors using a segmented approach. This paper describes a new approach, called meta-shells, which combines the fabrication advantages of segmented optics with the alignment advantages of full shell optics. Meta-shells are built by layering overlapping mirror segments onto a central structural shell. The resulting optic has the stiffness and rotational symmetry of a full shell, but with an order of magnitude greater collecting area. Several meta-shells so constructed can be integrated into a large x-ray mirror assembly by proven methods used for Chandra and XMM-Newton. The mirror segments are mounted to the meta-shell using a novel four point semi-kinematic mount. The four point mount deterministically locates the segment in its most performance sensitive degrees of freedom. Extensive analysis has been performed to demonstrate the feasibility of the four point mount and meta-shell approach. A mathematical model of a meta-shell constructed with mirror segments bonded at four points and subject to launch loads has been developed to determine the optimal design parameters, namely bond size, mirror segment span, and number of layers per meta-shell. The parameters of an example 1.3 m diameter mirror assembly are given including the predicted effective area. To verify the mathematical model and support opto-mechanical analysis, a detailed finite element model of a meta-shell was created. Finite element analysis predicts low gravity distortion and low sensitivity to thermal gradients.

module↗

Meta-shell Approach for Constructing Lightweight and High Resolution X-Ray Optics

Lightweight and high resolution optics are needed for future space-based x-ray telescopes to achieve advances in high-energy astrophysics. Past missions such as Chandra and XMM-Newton have achieved excellent angular resolution using a full shell mirror approach. Other missions such as Suzaku and NuSTAR have achieved lightweight mirrors using a segmented approach. This paper describes a new approach, called meta-shells, which combines the fabrication advantages of segmented optics with the alignment advantages of full shell optics. Meta-shells are built by layering overlapping mirror segments onto a central structural shell. The resulting optic has the stiffness and rotational symmetry of a full shell, but with an order of magnitude greater collecting area. Several meta-shells so constructed can be integrated into a large x-ray mirror assembly by proven methods used for Chandra and XMM-Newton. The mirror segments are mounted to the meta-shell using a novel four point semi-kinematic mount. The four point mount deterministically locates the segment in its most performance sensitive degrees of freedom. Extensive analysis has been performed to demonstrate the feasibility of the four point mount and meta-shell approach. A mathematical model of a meta-shell constructed with mirror segments bonded at four points and subject to launch loads has been developed to determine the optimal design parameters, namely bond size, mirror segment span, and number of layers per meta-shell. The parameters of an example 1.3 m diameter mirror assembly are given including the predicted effective area. To verify the mathematical model and support opto-mechanical analysis, a detailed finite element model of a meta-shell was created. Finite element analysis predicts low gravity distortion and low thermal distortion. Recent results are discussed including Structural Thermal Optical Performance (STOP) analysis as well as vibration and shock testing of prototype meta-shells.

Lightweight and high resolution optics↗

Integrated Framework to Enable Design Space Exploration of In-Space Transportation Architectures

Even with the recent shift in focus of NASA’s human spaceflight program towards the Moon, the long-term goal continues to be crewed missions to Mars. Regardless of the accepted architecture, in-space transportation systems are a critical portion to achieving this goal. An emphasis is placed on presenting decision makers with many options early on to make an informed down-selection. Although current processes are able to address any aspects of the challenging underlying multi-disciplinary analysis and optimization problem of these advanced concepts, they are unable to comprehensively perform design space exploration inexpensively,potentially leaving attractive alternatives on the table. A design framework is proposed that is capable of enabling the integrated mission analysis, vehicle sizing and synthesis problem for in-space transportation architectures. This framework is enabled through the use of the vehicle synthesis tool, Dynamic Rocket Equation Tool, various subsystem sizing models, and low-thrust trajectory optimization codes. As a case study to demonstrate the framework, two design points of a hybrid propulsion stage concept, studied by Georgia Tech’s 2018 Revolutionary Aerospace Systems Concepts-Academic Linkage team, is explored.

Akshay Prasad↗

Integrated Framework to Enable Design Space Exploration of In-Space Transportation Architectures

Even with the recent shift in focus of NASA’s human spaceflight program towards the Moon, the long-term goal continues to be crewed missions to Mars. Regardless of the accepted architecture, in-space transportation systems are a critical portion to achieving this goal. An emphasis is placed on presenting decision makers with many options early on to make an informed down-selection. Although current processes are able to address any aspects of the challenging underlying multi-disciplinary analysis and optimization problem of these advanced concepts, they are unable to comprehensively perform design space exploration inexpensively, potentially leaving attractive alternatives on the table. A design framework is proposed that is capable of enabling the integrated mission analysis, vehicle sizing and synthesis problem for in-space transportation architectures. This framework is enabled through the use of the vehicle synthesis tool, Dynamic Rocket Equation Tool, various subsystem sizing models, and low-thrust trajectory optimization codes. As a case study to demonstrate the framework, two design points of a hybrid propulsion stage concept, studied by Georgia Tech’s 2018 Revolutionary Aerospace Systems Concepts-Academic Linkage team, is explored.

Akshay Prasad↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Gravitational form factors of glueballs in Yang-Mills theory

This work presents preliminary results of the first determination of the energy-momentum tensor form factors of the scalar glueball, referred to as gravitational form factors (GFFs). The calculation has been carried out in lattice Yang-Mills theory at a single lattice spacing. Using variationally optimized operators, the matrix elements are extracted from ratios of three-point functions to two-point functions. The glueball GFFs and their kinematic dependence are compared to those of other hadrons from previous calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Advanced Variance Reduction Strategies for Optimizing Mesh Tallies in MAVRIC

More often than in the past, Monte Carlo methods are being used to compute fluxes or doses over large areas using mesh tallies (a set of region tallies defined on a mesh that overlays the geometry). For problems that demand that the uncertainty in each mesh cell be less than some set maximum, computation time is controlled by the cell with the largest uncertainty. This issue becomes quite troublesome in deep-penetration problems, and advanced variance reduction techniques are required to obtain reasonable uncertainties over large areas. The CADIS (Consistent Adjoint Driven Importance Sampling) methodology has been shown to very efficiently optimize the calculation of a response (flux or dose) for a single point or a small region using weight windows and a biased source based on the adjoint of that response. This has been incorporated into codes such as ADVANTG (based on MCNP) and the new sequence MAVRIC, which will be available in the next release of SCALE. In an effort to compute lower uncertainties everywhere in the problem, Larsen's group has also developed several methods to help distribute particles more evenly, based on forward estimates of flux. This paper focuses on the use of a forward estimate to weight the placement of the source in the adjoint calculation used by CADIS, which we refer to as a forward-weighted CADIS (FW-CADIS).

97 MATHEMATICS AND COMPUTING↗

Systems Modeling For The Laser Fusion-Fission Energy (LIFE) Power Plant

A systems model has been developed for the Laser Inertial Fusion-Fission Energy (LIFE) power plant. It combines cost-performance scaling models for the major subsystems of the plant including the laser, inertial fusion target factory, engine (i.e., the chamber including the fission and tritium breeding blankets), energy conversion systems and balance of plant. The LIFE plant model is being used to evaluate design trade-offs and to identify high-leverage R&D. At this point, we are focused more on doing self consistent design trades and optimization as opposed to trying to predict a cost of electricity with a high degree of certainty. Key results show the advantage of large scale (>1000 MWe) plants and the importance of minimizing the cost of diodes and balance of plant cost.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Path optimization by a variational reaction coordinate method. I. Development of formalism and algorithms

The development of algorithms to optimize reaction pathways between reactants and products is an active area of study. Existing algorithms typically describe the path as a discrete series of images (chain of states) which are moved downhill toward the path, using various reparameterization schemes, constraints, or fictitious forces to maintain a uniform description of the reaction path. The Variational Reaction Coordinate (VRC) method is a novel approach that finds the reaction path by minimizing the variational reaction energy (VRE) of Quapp and Bofill. The VRE is the line integral of the gradient norm along a path between reactants and products and minimization of VRE has been shown to yield the steepest descent reaction path. In the VRC method, we represent the reaction path by a linear expansion in a set of continuous basis functions and find the optimized path by minimizing the VRE with respect to the linear expansion coefficients. Improved convergence is obtained by applying constraints to the spacing of the basis functions and coupling the minimization of the VRE to the minimization of one or more points along the path that correspond to intermediates and transition states. The VRC method is demonstrated by optimizing the reaction path for the Müller-Brown surface and by finding a reaction path passing through 5 transition states and 4 intermediates for a 10 atom Lennard-Jones cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF) model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improved Sensitivity Relations in State Constrained Optimal Control

Sensitivity relations in optimal control provide an interpretation of the costate trajectory and the Hamiltonian, evaluated along an optimal trajectory, in terms of gradients of the value function. While sensitivity relations are a straightforward consequence of standard transversality conditions for state constraint free optimal control problems formulated in terms of control-dependent differential equations with smooth data, their verification for problems with either pathwise state constraints, nonsmooth data, or for problems where the dynamic constraint takes the form of a differential inclusion, requires careful analysis. In this paper we establish validity of both ‘full’ and ‘partial’ sensitivity relations for an adjoint state of the maximum principle, for optimal control problems with pathwise state constraints, where the underlying control system is described by a differential inclusion. The partial sensitivity relation interprets the costate in terms of partial Clarke subgradients of the value function with respect to the state variable, while the full sensitivity relation interprets the couple, comprising the costate and Hamiltonian, as the Clarke subgradient of the value function with respect to both time and state variables. These relations are distinct because, for nonsmooth data, the partial Clarke subdifferential does not coincide with the projection of the (full) Clarke subdifferential on the relevant coordinate space. We show for the first time (even for problems without state constraints) that a costate trajectory can be chosen to satisfy the partial and full sensitivity relations simultaneously. The partial sensitivity relation in this paper is new for state constraint problems, while the full sensitivity relation improves on earlier results in the literature (for optimal control problems formulated in terms of Lipschitz continuous multifunctions), because a less restrictive inward pointing hypothesis is invoked in the proof, and because it is validated for a stronger set of necessary conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extremal trajectories in a nilpotent sub-Riemannian problem on the Engel group

On the Engel group a nilpotent sub-Riemannian problem is considered, a 4-dimensional optimal control problem with a 2-dimensional linear control and an integral cost functional. It arises as a nilpotent approximation to nonholonomic systems with 2-dimensional control in a 4-dimensional space (for example, a system describing the navigation of a mobile robot with trailer). A parametrization of extremal trajectories by Jacobi functions is obtained. A discrete symmetry group and its fixed points, which are Maxwell points, are described. An estimate for the cut time (the time of the loss of optimality) on extremal trajectories is derived on this basis. Bibliography: 25 titles.

97 MATHEMATICS AND COMPUTING↗

AEPF: Attention-Enabled Point Fusion for 3D Object Detection

Current state-of-the-art (SOTA) LiDAR-only detectors perform well for 3D object detection tasks, but point cloud data are typically sparse and lacks semantic information. Detailed semantic information obtained from camera images can be added with existing LiDAR-based detectors to create a robust 3D detection pipeline. With two different data types, a major challenge in developing multi-modal sensor fusion networks is to achieve effective data fusion while managing computational resources. With separate 2D and 3D feature extraction backbones, feature fusion can become more challenging as these modes generate different gradients, leading to gradient conflicts and suboptimal convergence during network optimization. To this end, we propose a 3D object detection method, Attention-Enabled Point Fusion (AEPF). AEPF uses images and voxelized point cloud data as inputs and estimates the 3D bounding boxes of object locations as outputs. An attention mechanism is introduced to an existing feature fusion strategy to improve 3D detection accuracy and two variants are proposed. These two variants, AEPF-Small and AEPF-Large, address different needs. AEPF-Small, with a lightweight attention module and fewer parameters, offers fast inference. AEPF-Large, with a more complex attention module and increased parameters, provides higher accuracy than baseline models. Experimental results on the KITTI validation set show that AEPF-Small maintains SOTA 3D detection accuracy while inferencing at higher speeds. AEPF-Large achieves mean average precision scores of 91.13, 79.06, and 76.15 for the car class’s easy, medium, and hard targets, respectively, in the KITTI validation set. Results from ablation experiments are also presented to support the choice of model architecture.

Chemistry↗

Adapting Optimal Velocity Tracking Control to Account for WEC Constraints and Power-Take-Off Efficiencies: Preprint

Wave energy converters (WECs) come in many different forms, from point absorbers, oscillating water columns, to bulge wave devices. This paper focuses on the control of point absorber WECs, which typically have a narrow-banded frequency response and, therefore, control is well placed to improve the energy capture of such WECs. The acausal nature of the control problem means that theoretically optimal control is almost impossible to achieve inpractice; however optimal velocity tracking (OVT) offers a simple and robust approximation to optimal control that can achieve better power capture than passive linear damping methods, albeit with necessarily higher force demands. OVT is a form of impedance matching and the magnitude of the power-take off (PTO) force demand is often not linearly proportional to the WEC velocity, which can lead to PTO force and speed combinations far from the optimalPTO efficiency. The highly non-linear PTO force and speed to efficiency mapping can, without remedial measures, severely diminish the effectiveness of OVT techniques. In this paper, limits to the movement and force of the PTO are demonstrated, allowing OVT to be more easily applied in practice. The effect of PTO efficiency is explored, and a potential solution to the problem of adapting control to account for efficiency is presented. Both aspects of the work presented highlight the requirement for co-design of the WEC, PTO, and controller.

conversion efficiency↗

Blackcomb: Hardware-Software Co-design for Non-Volatile Memory in Exascale Systems

Summary of technical results of Blackcomb Memory Devices We explored various different memory technologies (STTRAM, PCRAM, FeRAM, and ReRAM). The progress can be classified into three categories, below. Modeling and Tool Releases Various modeling tools have been developed over the last decade to help in the design of SRAM or DRAM-based memory hierarchies. To explore new design opportunities that NVM technologies can bring to the designers, we have developed similar high-level models for NVM, including PCRAMsim [Dong 2009], NVSim [Dong 2012], and NVMain [Poremba 2012]. NVSim is a circuit-level model for NVM performance, energy, and area estimation, which supports various NVM technologies, including STT-RAM, PCRAM, ReRAM, and legacy NAND Flash. NVSim is successfully validated against industrial NVM prototypes, and it is expected to help boost architecture-level NVM-related studies. On the other side, NVMain is a cycle accurate main memory simulator designed to simulate emerging nonvolatile memories at the architectural level. We have released these models as open source tools and provided contiguous support to them. We also proposed PS3-RAM, which is a fast, portable and scalable statistical STT-RAM reliability analysis model [Wen 2012]. Design Space Exploration and Optimization With the support of these models, we explore different device/circuit optimization techniques. For example, in [Niu 2012a] we studied the power reduction technique for the application of ECC scheme in ReRAM designs and proposed to use ECC code to relax the BER (Bit Error Rate) requirement of a single memory to improve the write energy consumption and latency for both 1T1R and cross-point ReRAM designs. In [Xu 2011], we proposed a methodology to design STT-RAM for different optimization goals such as read performance, write performance and write energy by leveraging the trade-off between write current and write time of MTJ. We also studied the tradeoffs in building a reliable crosspoint ReRAM array [Niu 2012b]. We have conducted an in depth analysis of the circuit and system level design implications of multi-layer cross-point Resistive RAM (MLCReRAM) from performance, power and reliability perspectives [Xu 2013]. The objective of this study is to understand the design trade-offs of this technology with respect to the MLC Phase Change Memory (MLCPCM).Our MLC ReRAM design at the circuit and system levels indicates that different resistance allocation schemes, programming strategies, peripheral designs, and material selections profoundly affect the area, latency, power, and reliability of MLC ReRAM. Based on this analysis, we conduct two case studies: first we compare MLC ReRAM design against MLC phase-change memory (PCM) and multi-layer cross-point ReRAM design, and point out why multi-level ReRAM is appealing; second we further explore the design space for MLC ReRAM. Architecture and Application We explored hybrid checkpointing using phase-change memory for future exascale systems [Dong 2011] and showed that the use of nonvolatile memory for local checkpointing significantly increases the number of faults covered by local checkpoints and reduces the probability of a global failure in the middle of a global checkpoint to less than 1%. We also proposed a technique called i2WAP to mitigate the write variations in NVM-based last-level cache for the improvement of the NVM lifetime [Wang 2013]. Our wear leveling technique attempts to work around the limitations of write endurance by arranging data access so that write operations can be distributed evenly across all the storage cells. During our intensive research on fault-tolerant NVM design, we found that ECC cannot effectively tolerate hard errors from limited write endurance and process imperfection. Therefore, we devised a novel Point and Discard (PAD) architecture in in [ 2012] as a hard-error-tolerant architecture for ReRAM-based Last Level Caches. PAD improves the lifetime of ReRAM caches by 1.6X-440X under different process variations without performance overhead in the system's early life. We have investigated the applicability of NVM for persistent memory design [Zhao 2013]. New byte addressable NVM enables fast persistent memory that allows in-memory persistent data objects to be updated with much higher throughput. Despite the significant improvement, the performance of these designs is only 50% of the native system with no persistence support, due to the logging or copy-on-write mechanisms used to update the persistent memory. A challenge in this approach is therefore how to efficiently enable atomic, consistent, and durable updates to ensure data persistence that survives application and/or system failures. We have designed a persistent memory system, called Klin, that can provide performance as close as that of the native system. The Klin design adopts a non-volatile cache and a non-volatile main memory for constructing a multi-versioned durable memory system, enabling atomic updates without logging or copy-on-write. Our evaluation shows that the proposed Kiln mechanism can achieve up to 2X of performance improvement to NVRAM-based persistent memory employing write-ahead logging. In addition, our design has numerous practical advantages: a simple and intuitive abstract interface, microarchitecture-level optimizations, fast recovery from failures, and no redundant writes to slow non-volatile storage media. The work was published in MICRO 2013 and received Best Paper Honorable Mentioned Award.

97 MATHEMATICS AND COMPUTING↗

Optimal Low Thrust Orbit Transfers for Space Telescope Refueling at SEL2

The James Webb Space Telescope (JWST), a ten billion-dollar infrared telescope with a 6.5m primary mirror to be launched in 2021, is designed to operate in a Halo orbit around the second Sun-Earth Lagrange point (SEL2) for five to ten years. At that point fuel for station keeping and attitude maneuvers will run out. Refueling missions to JWST, as well as to similar space telescope missions proposed for SEL2, could greatly enhance the “science-per-dollar” value and promote a more sustainable use of space assets. In this paper, we present a novel approach to designing fuel optimal trajectories that will allow the refueling spacecraft to arrive at the SEL2 Halo orbit with maximum final mass (i.e. fuel payload). The low thrust optimal control problem is formulated using an indirect optimization method, leading to a two-point boundary value problem with a bang-bang control structure. We make use of a hyperbolic tangent smoothing technique for performing continuation on the thrust magnitude to reduce the sharpness of the control switches in early iterations and, thus, promote convergence. The problem is posed and solved in the circular restricted three-body problem. In this dynamical system, invariant manifolds exist that can be utilized to reduce fuel consumption. The here presented methodology to this challenging and important problem in astrodynamics demonstrates a significant potential for low-cost refueling mission design.

Woollands, Robyn↗