Search NASA⌕ Search

SEARCH · Search NASA

Results for “minimization”

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 55 records · Page 3

Propulsive trajectory optimization to minimize surface contamination

MOTIVATION: We present an optimization technique for propulsive vehicles that autonomously minimizes contamination during surface approach and landing. In addition to short-range hoppers, the optimization technique is also fully applicable to traditional orbit-to-surface landers. This study addresses scenarios where surface alterations from propulsion events are counterproductive or hazardous to the mission objectives. This is of immediate interest for landers (whether human or robotic), that may rely on pristine soils collected in the immediate vicinity of landing sites to accomplish science investigations, mining, or ISRU surface operations. Such missions are averse to various surface-plume interactions such as thermal scoring, physical agitation, and contamination. The capability can be applied with minimal impact to the baseline mission concept. METHODS: Optimization algorithms have been developed to calculate descent trajectories and maneuvers, thrust magnitude, and attitude for various mission cases. These parameters are determined as an optimal solution when minimizing either fuel consumption, contamination deposited at the landing site, or some weighted combination of both. Among constraints imposed on the solution, we examined pitch rate, vertical takeoff and vertical landing (VTVL) requirements, size of the contamination zone, and minimum ground clearance during flight. This tool provides unique, non-intuitive solutions and can be a valuable resource for mission planners. RESULTS: A variety of agile trajectory solutions were obtained, each yielding different reductions in landing site contamination and corresponding to only modest increases in fuel consumption. Several optimal trajectories were obtained by varying the contamination weight in the fitness function. As expected, when the contamination weight is zero, the trajectory appears close to parabolic since the optimization scheme only attempts to minimize for fuel utilization, yielding essentially, the expected ballistic trajectory. Notably for contamination weights greater than zero, trajectory inflections are observed in the descent phase, which manifests as hovering or additional, mini “pseudo hops” before the final touchdown. A trajectory inflection is characterized by arresting the majority of the spacecraft vertical velocity component at a coordinate outside of the landing target, and without violating ground clearance constraints. FUTURE WORK: Our optimization technique is ready for laboratory or field demonstrations to validate the sophisticated maneuvering solutions obtained for fuel optimization and surface preservation. An appropriate testbed would validate the optimal guidance algorithms, the navigation system, and sensor suite by emulating vehicle flight in closed loop robotic tests. Critically, these algorithms could then be ported to flight software for implementation.

surface contamination↗

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

system identification↗

Comparison of Multisine Peak Factor Minimization Algorithms for Aircraft System Identification(Presentation)

Two phase-optimized multisine peak factor minimization algorithms are presented and evaluated. The first algorithm minimizes peak factor by iteratively clipping the peaks of generated multisine signals. The second algorithm optimizes peak factor indirectly through minimization of an approximation of the infinity norm of the multisine. Algorithm performance was evaluated as a function of different signal properties, including the number of harmonics, harmonic spacing, and number of snow harmonics (extra harmonics included for further reduction of the peak factor). The two algorithms are compared against results obtained by minimizing peak factor directly using a simplex algorithm, which has been a common approach when designing phase-optimized multisines for system identification flight tests. Sample results show that the clipping and infinity norm algorithms produced multisine signals with comparable peak factors that were lower than that of the simplex algorithm. However, the clipping algorithm runs an order of magnitude faster than the other two algorithms, which also makes it practical to repeat the algorithm multiple times to achieve even lower peak factors.

flight test↗

Increasingly minimal bias routing

A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

97 MATHEMATICS AND COMPUTING↗

A novel technique for minimizing energy functional using neural networks

An energy functional describes the equilibrium state of a system. In this work, we present a novel technique, Functional Optimization using Neural Networks (FONN), for minimizing the system’s energy. FONN utilizes neural networks to process information at discrete grid points, considering their interactions with neighboring grid points, to update the state of the system. The training process involves formulating a loss function based on the system’s energy, and with the help of multiple fine-tuning steps, the method employs a progressive energy reduction technique that decreases the energy in multiple steps. FONN’s effectiveness is demonstrated across various problems, including the minimization of the heat and Lyapunov energy. Furthermore, the paper explores the minimization of the elastic bending energy with an area constraint.

97 MATHEMATICS AND COMPUTING↗

Minimal Coordinate Formulation of Contact Dynamics in Operational Space

In recent years, complementarity techniques have been developed for modeling non-smooth contact and collision dynamics problems for multi-link robotic systems. Normally, in this approach, a linear complementarity problem (LCP) is set up using 6n non-minimal coordinates for a system with n links together with all the unilateral constraints and inter-link bilateral constraints on the system. In this paper, we use operational space dynamics to develop a complementarity formulation for contact and collision dynamics that uses minimal coordinates. The use of such non-redundant coordinates results in much smaller size LCP problems and the automatic enforcement of the inter-link bilateral constraints. Furthermore, we exploit operational space low-order computational algorithms to overcome some of the bottlenecks in using minimal coordinates.

contact dynamics↗

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

HUB LOADS↗

Real-Time Adaptive Least-Squares Drag Minimization for Performance Adaptive Aeroelastic Wing

This paper contains a simulation study of a real-time adaptive least-squares drag minimization algorithm for an aeroelastic model of a flexible wing aircraft. The aircraft model is based on the NASA Generic Transport Model (GTM). The wing structures incorporate a novel aerodynamic control surface known as the Variable Camber Continuous Trailing Edge Flap (VCCTEF). The drag minimization algorithm uses the Newton-Raphson method to find the optimal VCCTEF deflections for minimum drag in the context of an altitude-hold flight control mode at cruise conditions. The aerodynamic coefficient parameters used in this optimization method are identified in real-time using Recursive Least Squares (RLS). The results demonstrate the potential of the VCCTEF to improve aerodynamic efficiency for drag minimization for transport aircraft.

Aeroservoelasticity↗

Model-dependence of minimal-twist OPEs in d > 2 holographic CFTs

Following recent work on heavy-light correlators in higher-dimensional conformal field theories (CFTs) with a large central charge C T , we clarify the properties of stress tensor composite primary operators of minimal twist, [ T m ], using arguments in both CFT and gravity. We provide an efficient proof that the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^m\right]\right\rangle$, where ${\mathcal{O}}_L$ is any light primary operator, is independent of the purely gravitational action. Next, we consider corrections to this coupling due to additional interactions in AdS effective field theory and the corresponding dual CFT. When the CFT contains a non-zero three-point coupling $\left\langle TT{\mathcal{O}}_L\right\rangle$, the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^2\right]\right\rangle$ is modified at large C T if $\left\langle TT{\mathcal{O}}_L\right\rangle \sim \sqrt{C_T}$. This scaling is obeyed by the dilaton, by Kaluza-Klein modes of prototypical supergravity compactifications, and by scalars in stress tensor multiplets of supersymmetric CFTs. Quartic derivative interactions involving the graviton and the light probe field dual to ${\mathcal{O}}_L $ can also modify the minimal-twist couplings; these local interactions may be generated by integrating out a spin- ℓ ≥ 2 bulk field at tree level, or any spin ℓ at loop level. These results show how the minimal-twist OPE coefficients can depend on the higher-spin gap scale, even perturbatively.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Convex Programs for Minimal-Area Problems

The minimal-area problem that defines string diagrams in closed string field theory asks for the metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. Here, we consider the analogous minimal-area problem for homology classes of curves and, with the aid of calibrations and the max flow-min cut theorem, formulate it as a local convex program. We derive an equivalent dual program involving maximization of a concave functional. These two programs give new insights into the form of the minimal-area metric and are amenable to numerical solution. We explain how the homology problem can be modified to provide the solution to the original homotopy problem.

97 MATHEMATICS AND COMPUTING↗

Minimal-Area Metrics on the Swiss Cross and Punctured Torus

The closed string theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length greater than or equal to an arbitrary constant that can be set to one. Through every point in such a metric there is a geodesic that saturates the length condition, and the saturating geodesics in a given homotopy class form a band. The extremal metric is unknown when bands of geodesics cross, as it happens for surfaces of non-zero genus. Here, we use recently proposed convex programs to numerically find the minimal-area metric on the square torus with a square boundary, for various sizes of the boundary. For large enough boundary the problem is equivalent to the “Swiss cross” challenge posed by Strebel. We find that the metric is positively curved in the two-band region and flat in the single-band regions. For small boundary the metric develops a third band of geodesics wrapping around it, and has both regions of positive and of negative curvature. This surface can be completed to provide the minimal-area metric on a once-punctured torus, representing a closed-string tadpole diagram.

97 MATHEMATICS AND COMPUTING↗

Standard model Higgs inflation supplemented by minimal dark matter

Renormalization group analysis with the present measurements of the top quark mass m t = 172.69 ± 0.30 GeV [1] indicates that the Standard Model (SM) Higgs potential becomes unstable at energy scales ∼ 10 10 GeV . This may be interpreted as hinting at new particles at high energy. The minimal extension of the SM that can avoid this instability while leaving the SM Higgs as the sole scalar particle of the theory is obtained by adding suitable fermions to the SM. These fermions are good dark matter candidates and the model is known as the minimal dark matter model. We revisit the inflationary scenario based on the minimal dark matter model, taking into account updated parameter constraints and recent understanding of reheating dynamics. We explore the model with different values of the right-handed neutrino mass and find that the cosmological prediction is insensitive to such details. We obtained a spectral index of the cosmic microwave background n s = 0.9672 and a tensor-to-scalar ratio r = 0.0031 as a robust prediction of this scenario. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Minimization of Atomic Displacements as a Guiding Principle of the Martensitic Phase Transformation

I this article, we present a unifying description for the martensitic transformation of steel that accounts for important experimentally observable features of the transformation, namely, the Neumann bands, the interfacial (habit) plane between the transformed and untransformed phases and their orientation relationship. It is obtained through a simple geometric minimization of the total distance traveled by all the atoms from the austenite (fcc or γ) phase to the martensite (bcc or α) phase, without the need for any explicit energy minimization. Our description unites previously proposed mechanisms but it does not rely on assumptions and experimental knowledge regarding the shear planes and directions, or external adjustable parameters. We show how the Kurdjumov-Sach orientation relationship between the two phases and the {225}$_γ$ habit plane, which have both been extensively reported in experiments, naturally emerge from the distance minimization. We also propose an explanation for the occurrence of a different orientation relationship (Pitsch) in thin films.

CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS↗

DC-Link Current Minimization Control for Current Source Converter-Based Solid-State Transformer

This article proposes a fast predictive control method and a small DC-link inductor to minimize the DC-link current in current-source converter (CSC)-based solid-state transformer. The DC-link current minimization can significantly reduce power loss and improve efficiency. The challenge of this problem is on improving both steady-state and dynamic performance. PI control methods and large DC-link inductors are conventionally used in the CSC but have limited dynamic performance. A model predictive control (MPC) method is proposed to achieve switching-cycle-level settling time, and the DC-link inductor is sized for 40% ripple to enable fast current change. Importantly, this article also proposes to minimize the DC-link current by varying the current even within a line cycle under single-phase load to improve the steady-state performance, in contrast with the reduction to a constant value in the literature. The proposed MPC features a constant switching frequency without weighting factors. The MPC does not have a high computational burden and is implemented in a regular digital controller for a prototype of soft-switching solid-state transformer (S4T) with reduced conduction loss. The effectiveness of the proposed method has been experimentally verified on the SiC S4T prototype during steady-state and dynamics under different multiport power flow conditions up to 2 kV peak. Here, the DC-link current in the experiments is close to the minimum current with a short zero-vector duration, which further verifies the performance of the proposed method.

14 SOLAR ENERGY↗

Quark stars with 2.6 $M_\odot $ in a non-minimal geometry-matter coupling theory of gravity

This work analyses the hydrostatic equilibrium configurations of strange stars in a non-minimal geometry-matter coupling (GMC) theory of gravity. Those stars are made of strange quark matter, whose distribution is governed by the MIT equation of state. The non-minimal GMC theory is described by the following gravitational action: f(R,L) = R/2 + L + σRL, where R represents the curvature scalar, L is the matter Lagrangian density, and σ is the coupling parameter. When considering this theory, the strange stars become larger and more massive. In particular, when σ = 50 km 2 , the theory can achieve the 2.6 M ⊙ , which is suitable for describing the pulsars PSR J2215+5135 and PSR J1614-2230, and the mass of the secondary object in the GW190814 event. The 2.6 M ⊙ is a value hardly achievable in General Relativity, even considering fast rotation effects, and is also compatible with the mass of PSR J0952-0607 (M = 2.35 ± 0.17 M ⊙ ), the heaviest and fastest pulsar in the disk of the Milky Way, recently measured, supporting the possible existence of strange quark matter in its composition. The non-minimal GMC theory can also give feasible results to describe the macroscopical features of strange star candidates.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Virasoro minimal string

We introduce a critical string theory in two dimensions and demonstrate that this theory, viewed as two-dimensional quantum gravity on the worldsheet, is equivalent to a double-scaled matrix integral. The worldsheet theory consists of Liouville CFT with central charge c ≥ ≥ 25 coupled to timelike Liouville CFT with central charge 26-c. The double-scaled matrix integral has as its leading density of states the universal Cardy density of primaries in a two-dimensional CFT, thus motivating the name Virasoro minimal string. The duality holds for any value of the continuous parameter c c and reduces to the JT gravity/matrix integral duality in the large central charge limit. It thus provides a precise stringy realization of JT gravity. The main observables of the Virasoro minimal string are quantum analogues of the Weil-Petersson volumes, which are computed as absolutely convergent integrals of worldsheet CFT correlators over the moduli space of Riemann surfaces. By exploiting a relation of the Virasoro minimal string to three-dimensional gravity and intersection theory on the moduli space of Riemann surfaces, we are able to give a direct derivation of the duality. We provide many checks, such as explicit numerical - and in special cases, analytic - integration of string diagrams, the identification of the CFT boundary conditions with asymptotic boundaries of the two-dimensional spacetime, and the matching between the leading non-perturbative corrections of the worldsheet theory and the matrix integral. As a byproduct, we discover natural conformal boundary conditions for timelike Liouville CFT.

Physics↗

CFT and lattice correlators near an RG domain wall between minimal models

Conformal interfaces separating two conformal field theories (CFTs) provide maps between different CFTs, and naturally exist in nature as domain walls between different phases. One particularly interesting construction of a conformal interface is the renormalization group (RG) domain wall between CFTs. For a given Virasoro minimal model \mathcal{M}_{k+3,k+2} ℳ k + 3 , k + 2 , an RG domain wall can be generated by a specific deformation which triggers an RG flow towards its adjacent Virasoro minimal model \mathcal{M}_{k+2,k+1} ℳ k + 2 , k + 1 with the deformation turned on over part of the space. An algebraic construction of this domain wall was proposed by Gaiotto in [J. High Energy Phys. 12, 103 (2012)]. In this paper, we will provide a study of this RG domain wall for the minimal case k=2 k = 2 , which can be thought of as a nonperturbative check of the construction. In this case the wall is separating the Tricritical Ising Model (TIM) CFT and the Ising Model (IM) CFT. We will check the analytical results of correlation functions from the RG brane construction with the numerical density matrix renormalization group (DMRG) calculation using a lattice model proposed in [arXiv.1206.1332, Science 344, 280 (2014)], and find a perfect agreement. We comment on possible experimental realizations of this RG domain wall.

Cogburn, Cameron V.↗

Optimization of system reliability by the sequential unconstrained minimization technique

The reliability of a complex system was optimized by a new approach for implementing the sequential unconstrained minimization technique (SUMT) with the aid of Hooke and Jeeves pattern search and heuristic programming. Two optimization problems were considered. In the first, the system reliability was maximized subject to a nonlinear weight constraint. In the second, the weight of the system was minimized without violating the requirements of the minimal system reliability and the minimum reliability for each component. The sensitivities of the system reliability and that of the system weight to the reliability of each component were determined under optimal conditions.

Hwang, C. L.↗