SEARCH · Engineering Papers

Results for “cost function”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1992

A reliable algorithm for optimal control synthesis

In recent years, powerful design tools for linear time-invariant multivariable control systems have been developed based on direct parameter optimization. In this report, an algorithm for reliable optimal control synthesis using parameter optimization is presented. Specifically, a robust numerical algorithm is developed for the evaluation of the H(sup 2)-like cost functional and its gradients with respect to the controller design parameters. The method is specifically designed to handle defective degenerate systems and is based on the well-known Pade series approximation of the matrix exponential. Numerical test problems in control synthesis for simple mechanical systems and for a flexible structure with densely packed modes illustrate positively the reliability of this method when compared to a method based on diagonalization. Several types of cost functions have been considered: a cost function for robust control consisting of a linear combination of quadratic objectives for deterministic and random disturbances, and one representing an upper bound on the quadratic objective for worst case initial conditions. Finally, a framework for multivariable control synthesis has been developed combining the concept of closed-loop transfer recovery with numerical parameter optimization. The procedure enables designers to synthesize not only observer-based controllers but also controllers of arbitrary order and structure. Numerical design solutions rely heavily on the robust algorithm due to the high order of the synthesis model and the presence of near-overlapping modes. The design approach is successfully applied to the design of a high-bandwidth control system for a rotorcraft.

Vansteenwyk, Brett↗

NASA NTRS1987

Digital robust active control law synthesis for large order systems using constrained optimization

This paper presents a direct digital control law synthesis procedure for a large order, sampled data, linear feedback system using constrained optimization techniques to meet multiple design requirements. A linear quadratic Gaussian type cost function is minimized while satisfying a set of constraints on the design loads and responses. General expressions for gradients of the cost function and constraints, with respect to the digital control law design variables are derived analytically and computed by solving a set of discrete Liapunov equations. The designer can choose the structure of the control law and the design variables, hence a stable classical control law as well as an estimator-based full or reduced order control law can be used as an initial starting point. Selected design responses can be treated as constraints instead of lumping them into the cost function. This feature can be used to modify a control law, to meet individual root mean square response limitations as well as minimum single value restrictions. Low order, robust digital control laws were synthesized for gust load alleviation of a flexible remotely piloted drone aircraft.

Mukhopadhyay, Vivek↗

NASA NTRS1992

A stochastic optimal feedforward and feedback control methodology for superagility

A new control design methodology is developed: Stochastic Optimal Feedforward and Feedback Technology (SOFFT). Traditional design techniques optimize a single cost function (which expresses the design objectives) to obtain both the feedforward and feedback control laws. This approach places conflicting demands on the control law such as fast tracking versus noise atttenuation/disturbance rejection. In the SOFFT approach, two cost functions are defined. The feedforward control law is designed to optimize one cost function, the feedback optimizes the other. By separating the design objectives and decoupling the feedforward and feedback design processes, both objectives can be achieved fully. A new measure of command tracking performance, Z-plots, is also developed. By analyzing these plots at off-nominal conditions, the sensitivity or robustness of the system in tracking commands can be predicted. Z-plots provide an important tool for designing robust control systems. The Variable-Gain SOFFT methodology was used to design a flight control system for the F/A-18 aircraft. It is shown that SOFFT can be used to expand the operating regime and provide greater performance (flying/handling qualities) throughout the extended flight regime. This work was performed under the NASA SBIR program. ICS plans to market the software developed as a new module in its commercial CACSD software package: ACET.

Halyo, Nesim↗

DOE OSTI2023

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1998

A Preconditioning Method for Shape Optimization Governed by the Euler Equations

We consider a classical aerodynamic shape optimization problem subject to the compressible Euler flow equations. The gradient of the cost functional with respect to the shape variables is derived with the adjoint method at the continuous level. The Hessian (second order derivative of the cost functional with respect to the shape variables) is approximated also at the continuous level, as first introduced by Arian and Ta'asan (1996). The approximation of the Hessian is used to approximate the Newton step which is essential to accelerate the numerical solution of the optimization problem. The design space is discretized in the maximum dimension, i.e., the location of each point on the intersection of the computational mesh with the airfoil is taken to be an independent design variable. We give numerical examples for 86 design variables in two different flow speeds and achieve an order of magnitude reduction in the cost functional at a computational effort of a full solution of the analysis partial differential equation (PDE).

Arian, Eyal↗

DOE OSTI2025

Investigating parameter trainability in the SNAP-displacement protocol of a qudit system

Here, in this study, we explore the universality of Selective Number-dependent Arbitrary Phase (SNAP) and Displacement gates for quantum control in qudit-based systems. However, optimizing the parameters of these gates poses a challenging task. Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of blocks, where each block is composed of hardware operations, namely SNAP and Displacement gates [Fösel et al 2020 Efficient cavity control with snap gates arXiv:2004.14256]. Applying Variational Quantum algorithm (VQA) with observable and gate cost functions, we utilize techniques similar to those in [McClean et al 2018 Barren plateaus in quantum neural network training landscapes Nat. Commun.9 1–6] and [Cerezo et al 2021 Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun.12 1–12] along with the concept of t − design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) By leveraging the first and second moments properties of Haar measures, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗

DOE OSTI2021

Efficient Trainability of Linear Optical Modules in Quantum Optical Neural Networks

The existence of “barren plateau landscapes” for generic discrete-variable quantum neural networks, which obstructs efficient gradient-based optimization of cost functions defined by global measurements, would be surprising in the case of generic linear optical modules in quantum optical neural networks due to the tunability of the intensity of continuous variable states and the relevant unitary group having exponentially smaller dimension. We demonstrate that coherent light in m modes can be generically compiled efficiently if the total intensity scales sublinearly with m, and extend this result to cost functions based on homodyne, heterodyne, or photon detection measurement statistics, and to noisy cost functions in the presence of attenuation. Here, we further demonstrate efficient trainability of m mode linear optical quantum circuits for variational mean field energy estimation of positive quadratic Hamiltonians for input states that do not have energy exponentially vanishing with m.

47 OTHER INSTRUMENTATION↗

NASA NTRS1992

A parameter optimization approach to controller partitioning for integrated flight/propulsion control application

A parameter optimization framework is presented to solve the problem of partitioning a centralized controller into a decentralized hierarchical structure suitable for integrated flight/propulsion control implementation. The controller partitioning problem is briefly discussed and a cost function to be minimized is formulated, such that the resulting 'optimal' partitioned subsystem controllers will closely match the performance (including robustness) properties of the closed-loop system with the centralized controller while maintaining the desired controller partitioning structure. The cost function is written in terms of parameters in a state-space representation of the partitioned sub-controllers. Analytical expressions are obtained for the gradient of this cost function with respect to parameters, and an optimization algorithm is developed using modern computer-aided control design and analysis software. The capabilities of the algorithm are demonstrated by application to partitioned integrated flight/propulsion control design for a modern fighter aircraft in the short approach to landing task. The partitioning optimization is shown to lead to reduced-order subcontrollers that match the closed-loop command tracking and decoupling performance achieved by a high-order centralized controller.

Schmidt, Phillip↗

NASA NTRS1993

A parameter optimization approach to controller partitioning for integrated flight/propulsion control application

Schmidt, Phillip H.↗

DOE OSTI2022

On the energy landscape of symmetric quantum signal processing

Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given polynomial f , the parameters (called phase factors) can be obtained by solving an optimization problem. However, the cost function is non-convex, and has a very complex energy landscape with numerous global and local minima. It is therefore surprising that the solution can be robustly obtained in practice, starting from a fixed initial guess Φ 0 that contains no information of the input polynomial. To investigate this phenomenon, we first explicitly characterize all the global minima of the cost function. We then prove that one particular global minimum (called the maximal solution) belongs to a neighborhood of Φ 0 , on which the cost function is strongly convex under the condition ‖ f ‖ ∞ = O ( d − 1 ) with d = d e g ( f ) . Our result provides a partial explanation of the aforementioned success of optimization algorithms.

Wang, Jiasu↗

NASA NTRS1988

Digital active control law synthesis for aeroservoelastic systems

This paper presents a formulation for synthesis of digital active control laws for aeroservoelastic systems, which are typically modeled by large order equations in order to accurately represent the rigid and flexible body modes, unsteady aerodynamic forces, actuator dynamics, and gust spectra. The control law is expected to satisfy multiple design requirements on the dynamic loads, responses, actuator deflection and rate limitations, as well as maintain certain stability margins, yet should be simple enough to be implemented by an onboard digital microprocessor. The synthesis procedure minimizes a linear quadratic Gaussian type cost function, by updating selected free parameters of the control law, while satisfying a set of inequality constraints on the design loads, responses and stability margins. A stable classical control law or an estimator based full or reduced order control law can be used as an initial design starting point. The gradients of the cost function and the constraints, with respect to the digital control law design variables are derived analytically, to facilitate rapid convergence. Selected design responses can be treated as constraints instead of lumping them into the cost function, in order to satisfy individual root-mean-square load and response limitations. Constraints are also imposed on the minimum singular value requirements for stability robustness improvement.

Mukhopadhyay, Vivekananda↗

DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2024

Reinforcement learning applied to dilute combustion control for increased fuel efficiency

To reduce the modeling burden for control of spark-ignition engines, reinforcement learning (RL) has been applied to solve the dilute combustion limit problem. Q-learning was used to identify an optimal control policy to adjust the fuel injection quantity in each combustion cycle. A physics-based model was used to determine the relevant states of the system used for training the control policy in a data-efficient manner. The cost function was chosen such that high cycle-to-cycle variability (CCV) at the dilute limit was minimized while maintaining stoichiometric combustion as much as possible. Experimental results demonstrated a reduction of CCV after the training period with slightly lean combustion, contributing to a net increase in fuel conversion efficiency of 1.33%. To ensure stoichiometric combustion for three-way catalyst compatibility, a second feedback loop based on an exhaust oxygen sensor was incorporated into the fuel quantity controller using a slow proportional-integral (PI) controller. The closed-loop experiments showed that both feedback loops can cooperate effectively, maintaining stoichiometric combustion while reducing combustion CCV and increasing fuel conversion efficiency by 1.09%. Finally, a modified cost function was proposed to ensure stoichiometric combustion with a single controller. In addition, the learning period was shortened by half to evaluate the RL algorithm performance on limited training time. Experimental results showed that the modified cost function could achieve the desired CCV targets, however, the learning time was reduced by half and the fuel conversion efficiency increased only by 0.30%.

33 ADVANCED PROPULSION SYSTEMS↗

NASA NTRS2007

Quaternion Averaging

Many applications require an algorithm that averages quaternions in an optimal manner. For example, when combining the quaternion outputs of multiple star trackers having this output capability, it is desirable to properly average the quaternions without recomputing the attitude from the the raw star tracker data. Other applications requiring some sort of optimal quaternion averaging include particle filtering and multiple-model adaptive estimation, where weighted quaternions are used to determine the quaternion estimate. For spacecraft attitude estimation applications, derives an optimal averaging scheme to compute the average of a set of weighted attitude matrices using the singular value decomposition method. Focusing on a 4-dimensional quaternion Gaussian distribution on the unit hypersphere, provides an approach to computing the average quaternion by minimizing a quaternion cost function that is equivalent to the attitude matrix cost function Motivated by and extending its results, this Note derives an algorithm that deterniines an optimal average quaternion from a set of scalar- or matrix-weighted quaternions. Rirthermore, a sufficient condition for the uniqueness of the average quaternion, and the equivalence of the mininiization problem, stated herein, to maximum likelihood estimation, are shown.

Markley, F. Landis↗

NASA NTRS1989

Algorithm For Optimal Control Of Large Structures

Cost of computation appears competitive with other methods. Problem to compute optimal control of forced response of structure with n degrees of freedom identified in terms of smaller number, r, of vibrational modes. Article begins with Hamilton-Jacobi formulation of mechanics and use of quadratic cost functional. Complexity reduced by alternative approach in which quadratic cost functional expressed in terms of control variables only. Leads to iterative solution of second-order time-integral matrix Volterra equation of second kind containing optimal control vector. Cost of algorithm, measured in terms of number of computations required, is of order of, or less than, cost of prior algoritms applied to similar problems.

Salama, Moktar A.↗

NASA NTRS1987

Information prioritization for control and automation of space operations

The applicability of a real-time information prioritization technique to the development of a decision support system for control and automation of Space Station operations is considered. The steps involved in the technique are described, including the definition of abnormal scenarios and of attributes, measures of individual attributes, formulation and optimization of a cost function, simulation of test cases on the basis of the cost function, and examination of the simulation scenerios. A list is given comparing the intrinsic importances of various Space Station information data.

Ray, Asock↗

DOE OSTI2023

A divergence-free constrained magnetic field interpolation method for scattered data

An interpolation method to evaluate magnetic fields, given its unstructured and scattered magnetic data, is presented. The method is based on the reconstruction of the global magnetic field using a superposition of orthogonal functions. The coefficients of the expansion are obtained by minimizing a cost function defined as the L2 norm of the difference between the ground truth and the reconstructed magnetic field evaluated on the training data. The divergence-free condition is incorporated as a constraint in the cost function, allowing the method to achieve arbitrarily small errors in the magnetic field divergence. An exponential decay of the approximation error is observed and compared with the less favorable algebraic decay of local splines. Compared to local methods involving computationally expensive search algorithms, the proposed method exhibits a significant reduction of the computational complexity of the field evaluation, while maintaining a small error in the divergence even in the presence of magnetic islands and stochasticity. Finally, applications to the computation of Poincaré sections using data obtained from numerical solutions of the magnetohydrodynamic equations in toroidal geometry are presented and compared with local methods currently in use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗