Investigation of optimization of attitude control systems Second annual report, 15 Sep. 1965 - 30 Jun. 1966
Linear autonomous system theory and optimal control analysis for launch vehicle stability and antenna pointing direction
LINEAR SYSTEM↗
SEARCH · Engineering Papers
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.
Exploiting Power Flow Manifold to Solve AC Optimal Power Flow
AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.
AC optimal power flow↗
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.
Memarsadeghi, Nargess↗
Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method
Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.
bundle method↗
Fuel-optimal trajectories for aeroassisted coplanar orbital transfer problem
The optimal-control problem arising in coplanar orbital transfer using aeroassist technology is addressed. The maneuver involves the transfer from high earth orbit to low earth orbit with minimum fuel consumption. Simulations are carried out to obtain a corridor of entry conditions which are suitable for flying the spacecraft through the atmosphere. A highlight of the present work is the application of an efficient multiple shooting method for handling the difficult nonlinear two-point boundary value problem resulting from the optimization procedure.
Naidu, D. S.↗
Solution algorithms for non-linear singularly perturbed optimal control problems
The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.
Ardema, M. D.↗
A novel statistical methodology for quantifying the spatial arrangements of axons in peripheral nerves
A thorough understanding of the neuroanatomy of peripheral nerves is required for a better insight into their function and the development of neuromodulation tools and strategies. In biophysical modeling, it is commonly assumed that the complex spatial arrangement of myelinated and unmyelinated axons in peripheral nerves is random, however, in reality the axonal organization is inhomogeneous and anisotropic. Present quantitative neuroanatomy methods analyze peripheral nerves in terms of the number of axons and the morphometric characteristics of the axons, such as area and diameter. In this study, we employed spatial statistics and point process models to describe the spatial arrangement of axons and Sinkhorn distances to compute the similarities between these arrangements (in terms of first- and second-order statistics) in various vagus and pelvic nerve cross-sections. We utilized high-resolution transmission electron microscopy (TEM) images that have been segmented using a custom-built high-throughput deep learning system based on a highly modified U-Net architecture. Our findings show a novel and innovative approach to quantifying similarities between spatial point patterns using metrics derived from the solution to the optimal transport problem. We also present a generalizable pipeline for quantitative analysis of peripheral nerve architecture. Our data demonstrate differences between male- and female-originating samples and similarities between the pelvic and abdominal vagus nerves.
59 BASIC BIOLOGICAL SCIENCES↗
Sensitivity of optimum solutions to problem parameters
In an aircraft configuration optimization, the information of interest is the sensitivity of optimal block fuel consumption and wing aspect ratio and area, to variations of required range and payload. The objectives of this study are: (1) to show how the equations capable of yielding the sensitivity derivatives (the sensitivity equations) can be obtained for a constrained optimum regardless of the type of optimization algorithm that was used to arrive at the optimum point, (2) to review the solvability of the sensitivity equations and (3) to report on applications on structural optimization. Numerical examples, which demonstrate the sensitivity analysis, include a tubular column and a three-bar truss for which closed form solutions are obtained, a ten-bar truss that requires the use of a finite element analysis, and a thin-walled beam characterized by strongly nonlinear constraints for local buckling. It is concluded that a practically significant extrapolation accuracy may be obtained for a reasonably broad range of parameter changes; and that accuracy does not depend strongly on the degree of convergence of the optimum solution from which the sensitivity derivatives are obtained.
Sobieszczanski-Sobieski, J.↗
Scale-up Testing of Advanced Polaris Membrane in CO2 Capture Technology
This final technical report describes work conducted by Membrane Technology and Research, Inc. (MTR) for the U.S. Department of Energy (DOE), National Energy Technology Lab (NETL) on the scale-up and testing of advanced Polaris™ membrane CO2 capture technology at the Technology Centre Mongstad (TCM) under award number DE-FE0031591. The work was performed from August 1, 2018 through January 31, 2023. The overall goal of this project was to design, build and operate an advanced Polaris membrane CO2 capture system at TCM. MTR was assisted in this project by Trimeric Corporation (Trimeric), an engineering design services company, the Carbon Capture Simulation for Industry Impact (CCSI2), a partnership among national laboratories, industry, and academic institutions, and the Technology Centre Mongstad (TCM), who provided the host site for the slipstream field test. This report details the work conducted to scale-up MTR’s second-generation (Gen-2) Polaris membrane and advanced planar membrane modules to a final form factor optimized for commercial use; validate their performance in an engineering-scale field test at TCM; and to show the potential of the MTR process to meet DOE CO2 capture targets from large source point emitters. Work for this project included membrane optimization and scale-up, advanced planar module design and fabrication, design and fabrication of an engineering-scale field test membrane skid, operation of the field test skid processing Residue Fluid Catalytic Cracker (RFCC) industrial flue gas at TCM, and a detailed techno-economic analysis (TEA) of the MTR membrane post-combustion process for CO2 capture. This project validated recent membrane technology advancements at the engineering-scale, moves the MTR advanced post-combustion capture technology to TRL-6, and mitigates risk in future Large Pilot or Demonstration scale-up activities.
20 FOSSIL-FUELED POWER PLANTS↗
Optimizing Rate of Penetration and Tripping Decision-Making using Real-Time Bit Wear Monitoring While Drilling Geothermal Wells
Understanding bit wear while drilling is critical to minimizing non-productive time (NPT) and optimizing rate of penetration (ROP). Lengthening drilling runs with damaged bits does not only lower the ROP, but also elevates the risk of inducing severe bit damage, which could potentially lead to time-consuming fishing operations. When drillers believe the bit has worn off substantially, the bit is tripped out to be replaced. On geothermal wells, tripping can take up to 20% of the overall well construction time, and this is generally acknowledged as an opportunity for improvement. Ideally, a bit run should be terminated before the bit is damaged beyond repair. At the same time, premature bit pulls are to be avoided as well. This study aims to leverage bit and tooth wear metrics that can be obtained in real time to characterize bit condition in order to optimize ROP and determine the optimal time to pull the bit. Two metrics were explored in this study: a bit wear metric that incorporated depth-of-cut, and a tooth wear metric developed by Bourgoyne & Young characterizing the state of bit teeth dull. Both metrics were computed using recorded data from 12¼ inches roller cone insert bit runs in five geothermal wells targeting a granodiorite formation in the western United States. Together with the actual dull grades, determined after the bits were pulled to surface, the metric trends were interpreted to characterize the downhole bit condition and identify the point at which the bit should have optimally been tripped out. The insights from studying the actual dull grades and how they relate to the two metrics were used to establish a reliable bit pull criterion. The bit wear metric trend correctly showed a noticeable departure from baseline for bits experiencing major dulling behavior. Additionally, the tooth wear model predicted the cutter dull within two dull grades for most runs, with better performance in predicting the inner teeth dull. Moreover, the combination of the bit wear and tooth wear metrics was effective in revealing the cause of the bit performance impairment. Proactive tracking of these two metrics in real-time can facilitate geothermal drilling ROP optimization and better-informed tripping decision-making, thereby avoiding wasted time and cost.
Ashari, Rahmat↗
A Nonlinear Programming Perspective on Sensitivity Calculations for Systems Governed by State Equations
This paper discusses the calculation of sensitivities. or derivatives, for optimization problems involving systems governed by differential equations and other state relations. The subject is examined from the point of view of nonlinear programming, beginning with the analytical structure of the first and second derivatives associated with such problems and the relation of these derivatives to implicit differentiation and equality constrained optimization. We also outline an error analysis of the analytical formulae and compare the results with similar results for finite-difference estimates of derivatives. We then attend to an investigation of the nature of the adjoint method and the adjoint equations and their relation to directions of steepest descent. We illustrate the points discussed with an optimization problem in which the variables are the coefficients in a differential operator.
Lewis, Robert Michael↗
Computational Fluid Dynamic Optimization of an Experimental Rotating Detonation Rocket Engine Nozzle
A parametric optimization study is performed on the nozzle of a laboratory rotating detonation rocket engine (RDRE) using a three-dimensional computational fluid dynamic simulation. The primary optimization objective is maximum nozzle thrust. The basic nozzle configuration is a shrouded, truncated plug. The fluid in the RDRE chamber leading to the nozzle is choked at its exit so that its cyclic behavior is unaffected by any changes to the nozzle design. Optimization is performed for a single operating point. Parameters varied are the overall nozzle area expansion ratio and the fraction of the expansion area that is provided by the shroud. These two parameters indirectly affect the angle of the plug nozzle cone, and the bluff body area associated with its truncation. Nozzle thrust is evaluated as the difference between the thrust of the RDRE chamber-plus-nozzle combination and that of the chamber alone. The nozzle produces approximately 20% of the total engine thrust. The baseline nozzle is found to perform well, yielding 58.1% of the thrust calculated for a notional ideal RDRE nozzle which can instantaneously change shape to allow isentropic expansion of every fluid element. Optimization improves the performance, bringing the nozzle thrust to 70.0% of the notional ideal, and total engine thrust (chamber-plus-nozzle) to 94% of the ideal.
detonation↗
Computational Fluid Dynamic Optimization of an Experimental Rotating Detonation Rocket Engine Nozzle
A parametric optimization study is performed on the nozzle of a laboratory rotating detonation rocket engine (RDRE) using a three-dimensional computational fluid dynamic simulation. The primary optimization objective is maximum nozzle thrust. The basic nozzle configuration is a shrouded, truncated plug. The fluid in the RDRE chamber leading to the nozzle is choked at its exit so that its cyclic behavior is unaffected by any changes to the nozzle design. Optimization is performed for a single operating point. Parameters varied are the overall nozzle area expansion ratio and the fraction of the expansion area that is provided by the shroud. These two parameters indirectly affect the angle of the plug nozzle cone, and the bluff body area associated with its truncation. Nozzle thrust is evaluated as the difference between the thrust of the RDRE chamber-plus-nozzle combination and that of the chamber alone. The nozzle produces approximately 20% of the total engine thrust. The baseline nozzle is found to perform well, yielding 58.1% of the thrust calculated for a notional ideal RDRE nozzle which can instantaneously change shape to allow isentropic expansion of every fluid element. Optimization improves the performance, bringing the nozzle thrust to 70.0% of the notional ideal, and total engine thrust (chamber-plus-nozzle) to 94% of the ideal.
detonation↗
A hybrid technique for wire antennas in a cavity
An evaluation is conducted of two numerical techniques developed by Richmond (1961, 1966) for wire antennas and scattering bodies. It is concluded that a more efficient and accurate scheme can be devised by suitably combining the two techniques. This scheme, which is called the 'hybrid method', is well suited for a wire antenna mounted in a cavity. Reaction matching is employed in the case of the antenna, while point matching is used for the support structure. The described approach makes it possible to consider voltage generators without the use of any equivalent magnetic frill current sources. The number of unknown currents to be determined is essentially optimized by this combination of reaction matching and point matching. The resulting current distribution is a quantized distribution on the support structure and is continuous on the main radiator.
Agrawal, P. K.↗
Computationally efficient control allocation
A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.
Durham, Wayne↗
Multiscale design of nonlinear materials using a Eulerian shape optimization scheme
Motivated by recent advances in manufacturing, the design of materials is the focal point of interest in the material research community. One of the critical challenges in this field is finding optimal material microstructure for a desired macroscopic response. This work presents a computational method for the mesoscale-level design of particulate composites for an optimal macroscale-level response. The method relies on a custom shape optimization scheme to find the extrema of a nonlinear cost function subject to a set of constraints. Three key “modules” constitute the method: multiscale modeling, sensitivity analysis, and optimization. Multiscale modeling relies on a classical homogenization method and a nonlinear NURBS-based generalized finite element scheme to efficiently and accurately compute the structural response of particulate composites using a nonconformal discretization. A three-parameter isotropic damage law is used to model microstructure-level failure. An analytical sensitivity method is developed to compute the derivatives of the cost/constraint functions with respect to the design variables that control the microstructure's geometry. The derivation uncovers subtle but essential new terms contributing to the sensitivity of finite element shape functions and their spatial derivatives. Several structural problems are solved to demonstrate the applicability, performance, and accuracy of the method for the design of particulate composites with a desired macroscopic nonlinear stress-strain response.
42 ENGINEERING↗
Computational wing optimization and comparisons with experiment for a semi-span wing model
A computational wing optimization procedure was developed and verified by an experimental investigation of a semi-span variable camber wing model in the NASA Ames Research Center 14 foot transonic wind tunnel. The Bailey-Ballhaus transonic potential flow analysis and Woodward-Carmichael linear theory codes were linked to Vanderplaats constrained minimization routine to optimize model configurations at several subsonic and transonic design points. The 35 deg swept wing is characterized by multi-segmented leading and trailing edge flaps whose hinge lines are swept relative to the leading and trailing edges of the wing. By varying deflection angles of the flap segments, camber and twist distribution can be optimized for different design conditions. Results indicate that numerical optimization can be both an effective and efficient design tool. The optimized configurations had as good or better lift to drag ratios at the design points as the best designs previously tested during an extensive parametric study.
Waggoner, E. G.↗
Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD
The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.
Baysal, Oktay↗