Engineering Papers⌕ Search

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.

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

At least 235 records · Page 13

Understanding the chemical bonding of ground and excited states of HfO and HfB with correlated wavefunction theory and density functional approximations

Knowledge of the chemical bonding of HfO and HfB ground and low-lying electronic states provides essential insights into a range of catalysts and materials that contain Hf–O or Hf–B moieties. Here, we carry out high-level multi-reference configuration interaction theory and coupled cluster quantum chemical calculations on these systems. We compute full potential energy curves, excitation energies, ionization energies, electronic configurations, and spectroscopic parameters with large quadruple-ζ and quintuple-ζ quality correlation consistent basis sets. We also investigate equilibrium chemical bonding patterns and effects of correlating core electrons on property predictions. Differences in the ground state electron configuration of HfB(X 4 Σ - ) and HfO(X 1 Σ + ) lead to a significantly stronger bond in HfO than HfB, as judged by both dissociation energies and equilibrium bond distances. We extend our analysis to the chemical bonding patterns of the isovalent HfX (X = O, S, Se, Te, and Po) series and observe similar trends. We also note a linear trend between the decreasing value of the dissociation energy (D e ) from HfO to HfPo and the singlet–triplet energy gap (ΔE S–T ) of the molecule. Finally, we compare these benchmark results to those obtained using density functional theory (DFT) with 23 exchange–correlation functionals spanning multiple rungs of “Jacob’s ladder.” When comparing DFT errors to coupled cluster reference values on dissociation energies, excitation energies, and ionization energies of HfB and HfO, we observe semi-local generalized gradient approximations to significantly outperform more complex and high-cost functionals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robust controllers for the Middeck Active Control Experiment using Popov controller synthesis

Recent work in robust control with real parameter uncertainties has focused on absolute stability and its connections to real mu theory. In particular, the research has investigated the Popov stability criterion and its associated Lur'e-Postnikov Liapunov functions. State space representations of this Popov stability analysis tests are included in an H2 design formulation to provide a powerful technique for robust controller synthesis. This synthesis approach uses a state space optimization procedure to design controllers that minimize an overbound of an H2 cost functional and satisfy stability analysis tests based on the Popov multiplier. The controller and stability multiplier coefficients are optimized simultaneously, which avoids the iteration and curve-fitting procedures required by the D-K algorithm of mu synthesis. While previous work has demonstrated this synthesis approach on benchmark control problems, the purpose of this paper is to use Popov controller synthesis to design robust compensators for the Middeck Active Control Experiment (MACE).

How, Jonathan P.↗

Robust Multivariable Optimization and Performance Simulation for ASIC Design

Application-specific-integrated-circuit (ASIC) design for space applications involves multiple challenges of maximizing performance, minimizing power, and ensuring reliable operation in extreme environments. This is a complex multidimensional optimization problem, which must be solved early in the development cycle of a system due to the time required for testing and qualification severely limiting opportunities to modify and iterate. Manual design techniques, which generally involve simulation at one or a small number of corners with a very limited set of simultaneously variable parameters in order to make the problem tractable, are inefficient and not guaranteed to achieve the best possible results within the performance envelope defined by the process and environmental requirements. What is required is a means to automate design parameter variation, allow the designer to specify operational constraints and performance goals, and to analyze the results in a way that facilitates identifying the tradeoffs defining the performance envelope over the full set of process and environmental corner cases. The system developed by the Mixed Signal ASIC Group (MSAG) at the Goddard Space Flight Center is implemented as a framework of software modules, templates, and function libraries. It integrates CAD tools and a mathematical computing environment, and can be customized for new circuit designs with only a modest amount of effort as most common tasks are already encapsulated. Customization is required for simulation test benches to determine performance metrics and for cost function computation.

DuMonthier, Jeffrey↗

Comparison of joint space versus task force load distribution optimization for a multiarm manipulator system

It is often proposed that the redundancy in choosing a force distribution for multiple arms grasping a single object should be handled by minimizing a quadratic performance index. The performance index may be formulated in terms of joint torques or in terms of the Cartesian space force/torque applied to the body by the grippers. The former seeks to minimize power consumption while the latter minimizes body stresses. Because the cost functions are related to each other by a joint angle dependent transformation on the weight matrix, it might be argued that either method tends to reduce power consumption, but clearly the joint space minimization is optimal. A comparison of these two options is presented with consideration given to computational cost and power consumption. Simulation results using a two arm robot system are presented to show the savings realized by employing the joint space optimization. These savings are offset by additional complexity, computation time and in some cases processor power consumption.

Soloway, Donald I.↗

Machine Learning Techniques in Optimal Design

Many important applications can be formalized as constrained optimization tasks. For example, we are studying the engineering domain of two-dimensional (2-D) structural design. In this task, the goal is to design a structure of minimum weight that bears a set of loads. A solution to a design problem in which there is a single load (L) and two stationary support points (S1 and S2) consists of four members, E1, E2, E3, and E4 that connect the load to the support points is discussed. In principle, optimal solutions to problems of this kind can be found by numerical optimization techniques. However, in practice [Vanderplaats, 1984] these methods are slow and they can produce different local solutions whose quality (ratio to the global optimum) varies with the choice of starting points. Hence, their applicability to real-world problems is severely restricted. To overcome these limitations, we propose to augment numerical optimization by first performing a symbolic compilation stage to produce: (a) objective functions that are faster to evaluate and that depend less on the choice of the starting point and (b) selection rules that associate problem instances to a set of recommended solutions. These goals are accomplished by successive specializations of the problem class and of the associated objective functions. In the end, this process reduces the problem to a collection of independent functions that are fast to evaluate, that can be differentiated symbolically, and that represent smaller regions of the overall search space. However, the specialization process can produce a large number of sub-problems. This is overcome by deriving inductively selection rules which associate problems to small sets of specialized independent sub-problems. Each set of candidate solutions is chosen to minimize a cost function which expresses the tradeoff between the quality of the solution that can be obtained from the sub-problem and the time it takes to produce it. The overall solution to the problem, is then obtained by solving in parallel each of the sub-problems in the set and computing the one with the minimum cost. In addition to speeding up the optimization process, our use of learning methods also relieves the expert from the burden of identifying rules that exactly pinpoint optimal candidate sub-problems. In real engineering tasks it is usually too costly to the engineers to derive such rules. Therefore, this paper also contributes to a further step towards the solution of the knowledge acquisition bottleneck [Feigenbaum, 1977] which has somewhat impaired the construction of rulebased expert systems.

Cerbone, Giuseppe↗

A new algorithm for L2 optimal model reduction

In this paper the quadratically optimal model reduction problem for single-input, single-output systems is considered. The reduced order model is determined by minimizing the integral of the magnitude-squared of the transfer function error. It is shown that the numerator coefficients of the optimal approximant satisfy a weighted least squares problem and, on this basis, a two-step iterative algorithm is developed combining a least squares solver with a gradient minimizer. Convergence of the proposed algorithm to stationary values of the quadratic cost function is proved. The formulation is extended to handle the frequency-weighted optimal model reduction problem. Three examples demonstrate the optimization algorithm.

Spanos, J. T.↗

Parameter estimation for the Euler-Bernoulli-beam

An approximation involving cubic spline functions for parameter estimation problems in the Euler-Bernoulli-beam equation (phrased as an optimization problem with respect to the parameters) is described and convergence is proved. The resulting algorithm was implemented and several of the test examples are documented. It is observed that the use of penalty terms in the cost functional can improve the rate of convergence.

Graif, E.↗

System identification and model reduction using modulating function techniques

Weighted least squares (WLS) and adaptive weighted least squares (AWLS) algorithms are initiated for continuous-time system identification using Fourier type modulating function techniques. Two stochastic signal models are examined using the mean square properties of the stochastic calculus: an equation error signal model with white noise residuals, and a more realistic white measurement noise signal model. The covariance matrices in each model are shown to be banded and sparse, and a joint likelihood cost function is developed which links the real and imaginary parts of the modulated quantities. The superior performance of above algorithms is demonstrated by comparing them with the LS/MFT and popular predicting error method (PEM) through 200 Monte Carlo simulations. A model reduction problem is formulated with the AWLS/MFT algorithm, and comparisons are made via six examples with a variety of model reduction techniques, including the well-known balanced realization method. Here the AWLS/MFT algorithm manifests higher accuracy in almost all cases, and exhibits its unique flexibility and versatility. Armed with this model reduction, the AWLS/MFT algorithm is extended into MIMO transfer function system identification problems. The impact due to the discrepancy in bandwidths and gains among subsystem is explored through five examples. Finally, as a comprehensive application, the stability derivatives of the longitudinal and lateral dynamics of an F-18 aircraft are identified using physical flight data provided by NASA. A pole-constrained SIMO and MIMO AWLS/MFT algorithm is devised and analyzed. Monte Carlo simulations illustrate its high-noise rejecting properties. Utilizing the flight data, comparisons among different MFT algorithms are tabulated and the AWLS is found to be strongly favored in almost all facets.

Shen, Yan↗

An Overview of Latest Model Reduction and Control Methods of Large Flexible Space Structures

The latest trends and theoretical developments involved with the modeling and control of Large Flexible Space Structures (LFSS) are described. The paper addresses first the basic problems, characteristics, and difficulties inherent in modeling and control of LFSS. Major sources of difficulties and errors are the stiffness and damping operators of the dynamic model. Extensions of Linear Quadratic Gaussian (LQG) theory as applied to LFSS are presented, including frequency-shaped cost functionals and perturbation methods. The minimum data/maximum entropy approach which uses a stochastic design model to overcome difficulties found in the LQG-based methods is described. Latest trends in system theory including balanced realization and singular-value analysis are used to determine reduced order controllers and models. Ad hoc methods such as component cost analysis and modal cost analysis are discussed in context with the closed-loop reduction problem of controller order versus performance. The minimum data/maximum entropy approach also addresses controller order versus performance. Those areas of control science and large scale systems that appear to have an important role in understanding and solving LFSS modeling and control are also identified.

Santiago, J. M.↗

Interactive method for planning constrained, fuel-optimal orbital proximity operations

An interactive graphical method for planning fuel-efficient rendezvous trajectories in the multi-spacecraft environment of the space station is presented. The method allows the operator to compose a multi-burn transfer trajectory between arbitrary initial chaser and target trajectories. The available task time of the mission is limited and the maneuver is subject to various operational constraints, such as departure, arrival, plume impingement and spatial constraints. The maneuvers are described in terms of the relataive motion experienced in a Space-Station centered coordinate system. The optimization method is based on the primer vector and its extension to non-optimal trajectories. The visual feedback of trajectory shapes, operational constraints, and optimization functions, provided by user-transparaent and continuously active background computations, allows the operator to make fast, iterative design changes which rapidly converge to fuel-efficient solutions. The optimization functions are presented. A variety of simple design examples has been presented to demonstrate the usefulness of the method. In many cases the addition of a properly positioned intermediate waypoint resulted in fuel savings of up to 30%. Furthermore, due to the counter-intuitive character of the optimization functions, most fuel-optimal solutions could not have been found without the aid of the optimization tools. Operating the system was found to be very easy, and did not require any previous in-depth knowledge of orbital dynamics or trajectory. The planning tool is an example of operator assisted optimization of nonlinear cost-functions.

Abramovitz, Adrian↗

Hardware Specification and Reference Design for the Low-Cost, Interoperable, User-Centric, Supervisory Controller Kit for Small and Medium Size Commercial Buildings

Commercial buildings are responsible for approximately 20 percent of the total United States energy consumption and greenhouse gas emissions. Over 85 percent of these buildings lack building automation systems to manage the various building systems they have. Many of these buildings are small (< 50,000 square feet), underserved, and use rooftop units (RTUs) for heating, ventilation, and air-conditioning needs. Because these buildings lack proper control systems, they have several operational deficiencies that lead to excess energy consumption. Studies have shown that managing the RTU’s heating and cooling setpoints, schedules, setbacks, and optimal start times can result in 20 to 25 percent reduction in electricity consumption in small and medium commercial buildings (SMBs). In addition, improving the demand flexibility of these buildings will result in additional cost savings for the building owner. To address the needs of the SMBs, the Department of Energy’s Building Technologies Office jointly funded Pacific Northwest National Laboratory (PNNL) and Oak Ridge National Laboratory (ORNL) to design, develop, test, and validate a low-cost, interoperable, user-centric, retrofit supervisory controller kit (SC-SMB) that can be used to continuously optimize energy consumption and deliver demand flexibility of SMBs, including all-electric buildings, and provide a means for maximizing decarbonization benefits. The team also includes industry partners Edo and Intellimation. Previously, the team drafted an SC-SMB system specification document (Goodman et al. 2023). This document describes a reference design of a low-cost supervisory control system for SMBs, including the various hardware components, software system, and an example implementation of the reference design. The final release of the reference design is planned for December 2025. Section 2.0 of the report documents the relevant building types that the SC-SMB system is suitable for. Section 3.0 documents the various hardware components, their function, cost, whether they are off-the-shelve, support standard communication, etc., and the software system. An example deployment in a 10,000-sf building with six rooftop units, a hot water heater, solar, and storage is described in Section 4.0. The planned next steps are described in Section 5.0, and references are listed in Section 6.0.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimal model reduction and frequency-weighted extension

In this paper the quadratically optimal model reduction problem for single-input, single-output systems is considered. The reduced order model is determined by minimizing the integral of the magnitude-squared of the transfer function error. It is shown that the numerator coefficients of the optimal approximant satisfy a weighted least squares problem and, on this basis, a two-step iterative algorithm is developed combining a least squares solver with a gradient minimizer. The existence of globally optimal stable solutions to the optimization problem is established, and convergence of the algorithm to stationary values of the cost function is proved. The formulation is extended to handle the frequency-weighted optimal model reduction problem. Three examples demonstrate the optimization algorithm.

Spanos, J. T.↗

Learning control for minimizing a quadratic cost during repetitions of a task

In many applications, control systems are asked to perform the same task repeatedly. Learning control laws have been developed over the last few years that allow the controller to improve its performance each repetition, and to converge to zero error in tracking a desired trajectory. This paper generates a new type of learning control law that learns to minimize a quadratic cost function for tracking. Besides being of interest in its own right, this objective alleviates the need to specify a desired trajectory that can actually be performed by the system. The approach used here is to adapt appropriate methods from numerical optimization theory in order to produce learning control algorithms that adjust the system command from repetition to repetition in order to converge to the quadratic cost optimal trajectory.

Longman, Richard W.↗

Four-Switch Buck-Boost Converter Based on Model Predictive Control with Smooth Mode Transition Capability

Four-switch buck-boost converter supports both voltage step-up and step-down functionalities, but it suffers from mode transfer challenge that would need reliable mode detection when designed to operate in multi different modes. In this paper, a novel control method based on model predictive current control is proposed for such converter with inherent smooth mode transfer capability without extra design on mode detection and transfer scheme. Modulator and mode detection are replaced by an optimization process through cost function. This largely simplifies the design and makes it easily implemented. Therefore, seamless transfer between buck and boost modes is achieved with many other system level benefits. Simulation and experimental results are provided to verify the effectiveness of proposed method for the four-switch buck-boost converter.

42 ENGINEERING↗

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗

A Direct Approach for Minimum Fuel Maneuvers of Distributed Spacecraft in Multiple Flight Regimes

In this work we present a method to solve the impulsive minimum fuel maneuver problem for a distributed set of spacecraft. We develop the method assuming a fully non-linear dynamics model and parameterize the problem to allow the method to be applicable to any flight regime. Furthermore, the approach is not limited by the inter-spacecraft separation distances and is applicable to both small formations as well as constellations. We assume that the desired relative motion is driven by mission requirements and has been determined a-priori. The goal of this work is to develop a technique to achieve the desired relative motion in a minimum fuel manner. To permit applicability to multiple flight regimes, we have chosen to parameterize the cost function in terms of the maneuver times expressed in a useful time system and the maneuver locations expressed in their Cartesian vector representations. We also include as an independent variable the initial reference orbit to solve for the optimal injection orbit to minimize and equalize the fuel expenditure of distributed sets of spacecraft with large inter-spacecraft separations. In this work we derive the derivatives of the cost and constraints with respect to all of the independent variables.

Hughes, Steven P↗

Near-Optimal Re-Entry Trajectories for Reusable Launch Vehicles

A near-optimal guidance law for the descent trajectory for earth orbit re-entry of a fully reusable single-stage-to-orbit pure rocket launch vehicle is derived. A methodology is developed to investigate using both bank angle and altitude as control variables and selecting parameters that maximize various performance functions. The method is based on the energy-state model of the aircraft equations of motion. The major task of this paper is to obtain optimal re-entry trajectories under a variety of performance goals: minimum time, minimum surface temperature, minimum heating, and maximum heading change; four classes of trajectories were investigated: no banking, optimal left turn banking, optimal right turn banking, and optimal bank chattering. The cost function is in general a weighted sum of all performance goals. In particular, the trade-off between minimizing heat load into the vehicle and maximizing cross range distance is investigated. The results show that the optimization methodology can be used to derive a wide variety of near-optimal trajectories.

Chou, H.-C.↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗