Variable time optimal control
Computational algorithms and techniques for solving variable time optimal control problems
NUMERICAL ANALYSIS↗
SEARCH · Engineering Papers
Results for “solve time”
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.
A dual method for optimal control problems with initial and final boundary constraints.
This paper presents two new algorithms belonging to the family of dual methods of centers. The first can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states. The second one can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states and with affine instantaneous inequality constraints on the control. Convergence is established for both algorithms. Qualitative reasoning indicates that the rate of convergence is linear.
Pironneau, O.↗
On the impact of initially stressed composite laminates
The impact response behavior of initially stressed composite laminates is investigated using the finite element method. An experimentally established contact law is incorporated into the finite element program. The Newmark time integration algorithm is used for solving the time dependent equations of the plate and the impactor. Numerical results, including the contact force history, deflection, and strain in the plate, are presented. Effects of impact velocity, initial stress, and the mass and size of the impactor are discussed.
Sun, C. T.↗
Numerical simulation of homogeneous, isotropic, compressible turbulence
A new numerical algorithm is developed and applied to the direct simulation of compressible, homogeneous turbulent flows at low Mach numbers. A split method in time first solves a subset of the equations explicitly, followed by an implicit treatment of the pressure terms. The definition of an average sound speed over the entire field allows the implicit equations to be solved analytically, while relaxing the severe time limit imposed by the large sound speeds. Results from direct simulations on 96(3) grids provide a data base against which a new subgrid-scale model for compressible homogeneous turbulence is tested. This model reduces to the linear combination model in the absence of compressibility.
Erlebacher, G.↗
A Fourier collocation time domain method for numerically solving Maxwell's equations
A new method for solving Maxwell's equations in the time domain for arbitrary values of permittivity, conductivity, and permeability is presented. Spatial derivatives are found by a Fourier transform method and time integration is performed using a second order, semi-implicit procedure. Electric and magnetic fields are collocated on the same grid points, rather than on interleaved points, as in the Finite Difference Time Domain (FDTD) method. Numerical results are presented for the propagation of a 2-D Transverse Electromagnetic (TEM) mode out of a parallel plate waveguide and into a dielectric and conducting medium.
Shebalin, John V.↗
Alternative Attitude Commanding and Control for Precise Spacecraft Landing
A report proposes an alternative method of control for precision landing on a remote planet. In the traditional method, the attitude of a spacecraft is required to track a commanded translational acceleration vector, which is generated at each time step by solving a two-point boundary value problem. No requirement of continuity is imposed on the acceleration. The translational acceleration does not necessarily vary smoothly. Tracking of a non-smooth acceleration causes the vehicle attitude to exhibit undesirable transients and poor pointing stability behavior. In the alternative method, the two-point boundary value problem is not solved at each time step. A smooth reference position profile is computed. The profile is recomputed only when the control errors get sufficiently large. The nominal attitude is still required to track the smooth reference acceleration command. A steering logic is proposed that controls the position and velocity errors about the reference profile by perturbing the attitude slightly about the nominal attitude. The overall pointing behavior is therefore smooth, greatly reducing the degree of pointing instability.
Singh, Gurkirpal↗
Unsteady vortex-dominated flow around wings with oscillating leading-edge flaps
Unsteady vortex-dominated flow around delta wings with oscillating leading-edge flaps represents an important classs of problems for supermaneuverability and flow control of advanced aircraft. The problem is solved using time accurate integration of the unsteady, compressible, thin-layer Navier-Stokes equations in conjunction with the unsteady, linearized, Navier-displacement equations. Starting with an initial configuration of the wing and its flaps, the Navier-Stokes equations are solved on an initial structured grid for the steady flow. The forced oscillation of the flaps is then applied, and the problem is solved accurately in time. The Navier-displacement equations are solved for the grid deformation and the Navier-Stokes equations are solved for the flowfield. Symmetric and anti-symmetric flaps oscillations are presented to study the effect of the flaps oscillation on the leading-edge vortical flow.
Kandil, Osama A.↗
DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing
Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.
36 MATERIALS SCIENCE↗
Local-in-Time Adjoint-Based Method for Optimal Control/Design Optimization of Unsteady Compressible Flows
.We study local-in-time adjoint-based methods for minimization of ow matching functionals subject to the 2-D unsteady compressible Euler equations. The key idea of the local-in-time method is to construct a very accurate approximation of the global-in-time adjoint equations and the corresponding sensitivity derivative by using only local information available on each time subinterval. In contrast to conventional time-dependent adjoint-based optimization methods which require backward-in-time integration of the adjoint equations over the entire time interval, the local-in-time method solves local adjoint equations sequentially over each time subinterval. Since each subinterval contains relatively few time steps, the storage cost of the local-in-time method is much lower than that of the global adjoint formulation, thus making the time-dependent optimization feasible for practical applications. The paper presents a detailed comparison of the local- and global-in-time adjoint-based methods for minimization of a tracking functional governed by the Euler equations describing the ow around a circular bump. Our numerical results show that the local-in-time method converges to the same optimal solution obtained with the global counterpart, while drastically reducing the memory cost as compared to the global-in-time adjoint formulation.
Yamaleev, N. K.↗
Effect of Apex Flap Deflection on Vertical Tail Buffeting
A computational study of the effect of vortex breakdown location on vertical tail buffeting is conducted. The position of the breakdown is modified by employing an apex flap deflected by an experimentally determined optimal angle. The delayed breakdown flow and buffeting response is then compared to the nominal undeflected case. This multidisciplinary problem is solved sequentially for the fluid flow, the elastic tail deformations and the grid displacements. The fluid flow is simulated by time accurately solving the unsteady, compressible, Reynolds-averaged Navier-Stokes equations using an implicit, upwind, flux-difference splitting finite volume scheme. The elastic vibrations of the tails are modeled by uncoupled bending and torsion beam equations. These equations are solved accurately in time using the Galerkin method and a five-stage Runge-Kutta-Verner scheme. The grid for the fluid dynamics calculations is continuously deformed using interpolation functions to disperse the displacements smoothly throughout the computational domain. An angle-of-attack of 35 deg.is chosen such that the wing primary-vortex cores experience vortex breakdown and the resulting turbulent wake flow impinges on tile vertical tails. The dimensions and material properties of the vertical tails are chosen such that the deflections are large enough to insure interaction with the flow, and the natural frequencies are high enough to facilitate a practical computational solution. Results are presented for a baseline uncontrolled buffeting case and a delayed breakdown case in which the apex flap has been deflected 15 deg. The flap was found to be very effective in delaying the breakdown, increasing the location from 50%c to 94%c, which resulted in a 6% increase in lift coefficient and pitching moment. However, the integrated buffet loads and tip responses were roughly equivalent for the two cases.
Massey, Steven J.↗
Central difference TVD and TVB schemes for time dependent and steady state problems
We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.
Jorgenson, P.↗
Central difference TVD and TVB schemes for time dependent and steady state problems
We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.
Jorgenson, P.↗
An unconditionally stable, time-implicit algorithm for solving the one-dimensional Vlasov–Poisson system
The development of an implicit, unconditionally stable, numerical method for solving the Vlasov–Poisson system in one dimension using a phase-space grid is presented. The algorithm uses the Crank–Nicolson discretization scheme and operator splitting allowing for direct solution of the finite difference equations. This method exactly conserves particle number, enstrophy and momentum. A variant of the algorithm which does not use splitting also exactly conserves energy but requires the use of iterative solvers. This algorithm has no dissipation and thus fine-scale variations can lead to oscillations and the production of negative values of the distribution function. We find that overall, the effects of negative values of the distribution function are relatively benign. We consider a variety of test cases that have been used extensively in the literature where numerical results can be compared with analytical solutions or growth rates. We examine higher-order differencing and construct higher-order temporal updates using standard composition methods.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
A Current-Mode Discrete-Time Analog Computer for Solving Maxwell's Equations in 2D
Explore the source record for details and available documents.
47 OTHER INSTRUMENTATION↗
Numerical approach for solving rigid spacecraft minimum time attitude maneuvers
Explore the source record for details and available documents.
Li, Feiyue↗
Unifying Temporal and Structural Credit Assignment Problems
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.
Agogino, Adrian K.↗
3D Navier-Stokes Time Accurate Solutions Using Multipartitioning Parallel Computation Methodology
A parallel CFD code solving 3D time accurate Navier-Stokes equations with multipartitioning parallel Methodology is being developed in collaboration with Ohio State University within the Air Vehicle Directorate, at Wright Patterson Air Force Base. The advantage of the multipartitioning parallel method is that the domain decomposition will not introduce domain boundaries for the implicit operators. A ring structure data communication is employed so that the implicit time accurate method can be implemented for multi-processors with the same accuracy as for the single processor. No sub-iteration is needed at the domain boundaries. The code has been validated for some typical unsteady flows, which include Coutte Flow, flow passing a cylinder. The code now is being employed for a large scale time accurate wall jet transient flow computation. 'ne preliminary results are promising. The mesh has been refined to capture more details of the flow field. The mesh refinement computation is in progress and would be difficult to successfully implement without the parallel computation techniques used. A modified version of the code with more efficient inversion of the diagonalized block matrix is currently being tested.
Zha, Ge-Cheng↗
Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗