Search NASA⌕ Search

SEARCH · Search NASA

Results for “quadratic 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 199 records · Page 11

Estimability and Regulability of Linear Systems

A linear state-space system will be said to be estimable if in estimating its state from its output the posterior error covariance matrix is strictly smaller than the prior covariance matrix. It will be said to be regulable if the quadratic cost of state feedback control is strictly smaller than the cost when no feedback is used. Estimability and regulability are shown to be dual properties, equivalent to the nonreducibility of the Kalman filter and of the optimal linear quadratic regulator, respectively.

Baram, Yoram↗

Modal insensitivity with optimality

This paper deals with the design of a constant gain, feedback controller which results in selected modal insensitivity, and at the same time optimizes a quadratic performance index representative of desired system performance for nominal plant parameter values. Both full state and output feedback control are considered. A constraint is established for the feedback gain matrix that results in modal insensitivity, and necessary conditions for optimality subject to this constraint are given. This forms the basis for a numerical algorithm to compute the optimal feedback gain. To illustrate the procedure, a design is carried out using the lateral dynamics of an L-1011 aircraft.

Calise, A. J.↗

Experimental Validation of an Integrated Controls-Structures Design Methodology

The first experimental validation of an integrated controls-structures design methodology for a class of large order, flexible space structures is described. Integrated redesign of the controls-structures-interaction evolutionary model, a laboratory testbed at NASA Langley, was described earlier. The redesigned structure was fabricated, assembled in the laboratory, and experimentally tested against the original structure. Experimental results indicate that the structure redesigned using the integrated design methodology requires significantly less average control power than the nominal structure with control-optimized designs, while maintaining the required line-of-sight pointing performance. Thus, the superiority of the integrated design methodology over the conventional design approach is experimentally demonstrated. Furthermore, amenability of the integrated design structure to other control strategies is evaluated, both analytically and experimentally. Using Linear-Quadratic-Guassian optimal dissipative controllers, it is observed that the redesigned structure leads to significantly improved performance with alternate controllers as well.

Maghami, Peiman G.↗

Optimal Output Trajectory Redesign for Invertible Systems

Given a desired output trajectory, inversion-based techniques find input-state trajectories required to exactly track the output. These inversion-based techniques have been successfully applied to the endpoint tracking control of multijoint flexible manipulators and to aircraft control. The specified output trajectory uniquely determines the required input and state trajectories that are found through inversion. These input-state trajectories exactly track the desired output; however, they might not meet acceptable performance requirements. For example, during slewing maneuvers of flexible structures, the structural deformations, which depend on the required state trajectories, may be unacceptably large. Further, the required inputs might cause actuator saturation during an exact tracking maneuver, for example, in the flight control of conventional takeoff and landing aircraft. In such situations, a compromise is desired between the tracking requirement and other goals such as reduction of internal vibrations and prevention of actuator saturation; the desired output trajectory needs to redesigned. Here, we pose the trajectory redesign problem as an optimization of a general quadratic cost function and solve it in the context of linear systems. The solution is obtained as an off-line prefilter of the desired output trajectory. An advantage of our technique is that the prefilter is independent of the particular trajectory. The prefilter can therefore be precomputed, which is a major advantage over other optimization approaches. Previous works have addressed the issue of preshaping inputs to minimize residual and in-maneuver vibrations for flexible structures; Since the command preshaping is computed off-line. Further minimization of optimal quadratic cost functions has also been previously use to preshape command inputs for disturbance rejection. All of these approaches are applicable when the inputs to the system are known a priori. Typically, outputs (not inputs) are specified in tracking problems, and hence the input trajectories have to be computed. The inputs to the system are however, difficult to determine for non-minimum phase systems like flexible structures. One approach to solve this problem is to (1) choose a tracking controller (the desired output trajectory is now an input to the closed-loop system and (2) redesign this input to the closed-loop system. Thus we effectively perform output redesign. These redesigns are however, dependent on the choice of the tracking controllers. Thus the controller optimization and trajectory redesign problems become coupled; this coupled optimization is still an open problem. In contrast, we decouple the trajectory redesign problem from the choice of feedback-based tracking controller. It is noted that our approach remains valid when a particular tracking controller is chosen. In addition, the formulation of our problem not only allows for the minimization of residual vibration as in available techniques but also allows for the optimal reduction fo vibrations during the maneuver, e.g., the altitude control of flexible spacecraft. We begin by formulating the optimal output trajectory redesign problem and then solve it in the context of general linear systems. This theory is then applied to an example flexible structure, and simulation results are provided.

Devasia, S.↗

Design of an optimal output feedback control system with modal insensitivity

This paper deals with the design of an output feedback controller which results in selected modal insensitivity, and at the same time optimizes a quadratic performance index representative of desired system performance for nominal plant parameter values. The approach taken here is to characterize the class of attainable eigenvectors for a given set of eigenvalues (distinct or non-distinct) which lie in a subspace called the 'Modal Insensitivity Subspace'. A constraint is established on the feedback matrix which results in modal insensitivity. Necessary conditions for optimality subject to the constraint on the feedback matrix are given. This forms the basis for a numerical algorithm to compute the optimal feedback gain which analyzed for convergence. To illustrate the procedure, a design is carried out using the lateral dynamics of an L-1011 aircraft.

Raman, K. V.↗

TRANSP-based closed-loop simulations of current profile optimal regulation in NSTX-Upgrade

Active control of the toroidal current density profile is critical for the upgraded National Spherical Torus eXperiment device (NSTX-U) to maintain operation at the desired high-performance, MHD-stable, plasma regime. Initial efforts towards current density profile control have led to the development of a control-oriented, physics-based, plasma-response model, which combines the magnetic diffusion equation with empirical correlations for the kinetic profiles and the non-inductive current sources. The developed control-oriented model has been successfully tailored to the NSTX-U geometry and actuators. Moreover, a series of efforts have been made towards the design of model-based controllers, including a linear-quadratic-integral optimal control strategy that can regulate the current density profile around a prescribed target profile while rejecting disturbances. In this work, the tracking performance of the proposed current-profile optimal controller is tested in numerical simulations based on the physics-oriented code TRANSP. Furthermore, these high-fidelity closed-loop simulations, which are a critical step before experimental implementation and testing, are enabled by a flexible framework recently developed to perform feedback control design and simulation in TRANSP.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

TRANSP-based closed-loop simulations of current profile optimal regulation in NSTX-Upgrade

Active control of the toroidal current density profile is critical for the upgraded National Spherical Torus eXperiment device (NSTX-U) to maintain operation at the desired high-performance, MHD-stable, plasma regime. Initial efforts towards current density profile control have led to the development of a control-oriented, physics-based, plasma-response model, which combines the magnetic diffusion equation with empirical correlations for the kinetic profiles and the non-inductive current sources. The developed control-oriented model has been successfully tailored to the NSTX-U geometry and actuators. Moreover, a series of efforts have been made towards the design of model-based controllers, including a linear-quadratic-integral optimal control strategy that can regulate the current density profile around a prescribed target profile while rejecting disturbances. In this work, the tracking performance of the proposed current-profile optimal controller is tested in numerical simulations based on the physics-oriented code TRANSP. These high-fidelity closed-loop simulations, which are a critical step before experimental implementation and testing, are enabled by a flexible framework recentlydeveloped to perform feedback control design and simulation in TRANSP.

current profile control↗

Inexact convex relaxations for AC optimal power flow: Towards AC feasibility

Convex relaxations of AC optimal power flow (AC-OPF) problems have attracted significant interest as in several instances they provably yield the global optimum to the original non-convex problem. If, however, the relaxation is inexact, the obtained solution is not AC-feasible. The quality of the obtained solution is essential for several practical applications of AC-OPF, but detailed analyses are lacking in existing literature. Here, this paper aims to cover this gap. We provide an in-depth investigation of the solution characteristics when convex relaxations are inexact, we assess the most promising AC feasibility recovery methods for large-scale systems, and we propose two new metrics that lead to a better understanding of the quality of the identified solutions. We perform a comprehensive assessment on 96 different test cases, ranging from 14 to 3120 buses, and we show the following: (i) Despite an optimality gap of less than 1%, several test cases still exhibit substantial distances to both AC feasibility and local optimality and the newly proposed metrics characterize these deviations. (ii) Penalization methods fail to recover an AC-feasible solution in 15 out of 45 test cases. (iii) The computational benefits of warm-starting non-convex solvers have significant variation, but a computational speedup exists in over 75% of cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Preliminary Assessment of Optimal Longitudinal-Mode Control for Drag Reduction through Distributed Aeroelastic Shaping

The emergence of advanced lightweight materials is resulting in a new generation of lighter, flexible, more-efficient airframes that are enabling concepts for active aeroelastic wing-shape control to achieve greater flight efficiency and increased safety margins. These elastically shaped aircraft concepts require non-traditional methods for large-scale multi-objective flight control that simultaneously seek to gain aerodynamic efficiency in terms of drag reduction while performing traditional command-tracking tasks as part of a complete guidance and navigation solution. This paper presents results from a preliminary study of a notional multi-objective control law for an aeroelastic flexible-wing aircraft controlled through distributed continuous leading and trailing edge control surface actuators. This preliminary study develops and analyzes a multi-objective control law derived from optimal linear quadratic methods on a longitudinal vehicle dynamics model with coupled aeroelastic dynamics. The controller tracks commanded attack-angle while minimizing drag and controlling wing twist and bend. This paper presents an overview of the elastic aircraft concept, outlines the coupled vehicle model, presents the preliminary control law formulation and implementation, presents results from simulation, provides analysis, and concludes by identifying possible future areas for research

aeroelastic↗

A preliminary look at an optimal multivariable design for propulsion-only flight control of jet-transport aircraft

Control of a large jet transport aircraft without the use of conventional control surfaces was studied. Engine commands were used to attempt to recreate the forces and moments typically provided by the elevator, ailerons, and rudder. Necessary conditions for aircraft controllability were developed pertaining to aircraft configuration such as the number of engines and engine placement. An optimal linear quadratic regulator controller was developed for the Boeing 707-720, in particular, for regulation of its natural dynamic modes. The design used a method of assigning relative weights to the natural modes, i.e., phugoid and dutch roll, for a more intuitive selection of the cost function. A prototype pilot command interface was then integrated into the loop based on pseudorate command of both pitch and roll. Closed loop dynamics were evaluated first with a batch linear simulation and then with a real time high fidelity piloted simulation. The NASA research pilots assisted in evaluation of closed loop handling qualities for typical cruise and landing tasks. Recommendations for improvement on this preliminary study of optimal propulsion only flight control are provided.

Azzano, Christopher P.↗

Implementation of a First-Order Quadratic Program Solver in C

This paper details a translation of a first order quadratic program (QP) solver from MATLAB to C. NASA could use this QP solver to generate online flight path trajectories for powered descent vehicles during landing. Over 12 weeks, the team designed, implemented, and tested two iterations of the QP solver for accuracy and runtime on 104 benchmark QP tests. The final iteration was 541.07% faster than the first, handling most tests in under one second. Additionally, it solved four more QP tests for N≥1383, and all outputs for cost and D_x matched the MATLAB reference values.

Optimization↗

Extremum seeking for optimal control problems with unknown time-varying systems and unknown objective functions

We consider the problem of optimal feedback control of an unknown, noisy, time-varying, dynamic system that is initialized repeatedly. Examples include a robotic manipulator which must perform the same motion, such as assisting a human, repeatedly and accelerating cavities in particle accelerators which are turned on for a fraction of a second with given initial conditions and vary slowly due to temperature fluctuations. In this paper, we present an approach that applies to systems of practical interest. The method presented here is model independent; does not require knowledge of the objective function; is robust to measurement noise; is applicable for any set of initial conditions; is applicable to simultaneously controlling an arbitrary number of parameters; and may be implemented with a broad range of continuous or discontinuous functions such as sine or square waves. For systems with convex cost functions we prove that our algorithm will produce controllers that approach the minimal cost. For linear systems we reproduce the cost minimizing linear quadratic regulator optimal controller that could have been designed analytically had the system and cost function been known. We demonstrate the effectiveness of the algorithm with simulation studies of noisy and time-varying systems.

42 ENGINEERING↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗

Quantum Annealing with Inequality Constraints: The Set Cover Problem

Abstract Quantum annealing is a promising method for solving hard optimization problems by transforming them into quadratic unconstrained binary optimization (QUBO) problems. However, when constraints are involved, particularly multiple inequality constraints, incorporating them into the objective function poses challenges. In this paper, the authors present two novel approaches for solving problems with multiple inequality constraints on a quantum annealer and apply them to the set cover problem (SCP). The first approach uses the augmented Lagrangian method to represent the constraints, while the second approach employs a higher‐order binary optimization (HUBO) formulation. The experiments show that both approaches outperform the standard approach for solving the SCP on the D‐Wave Advantage quantum annealer. The HUBO formulation performs slightly better than the augmented Lagrangian method in solving the SCP, but its scalability in terms of embeddability in the quantum chip is worse. The results demonstrate that the proposed augmented Lagrangian and HUBO methods can successfully implement a large number of inequality constraints, making them applicable to a broad range of constrained problems beyond the SCP.

Djidjev, Hristo N.↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Approximate Optimization Algorithm on Different Qubit Systems

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗