Optimal control with Chebyshev minimax performance index.
Optimal control of dynamic systems with minimax type performance index, discussing application of proposed method of solution
OPTIMAL CONTROL↗
SEARCH · Engineering Papers
Results for “Approximate dynamic programming”
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.
Approximating properties of linear models for input output descriptions
Pade approximations for linear and dynamic programming using Markov processes and new algorithms
Holzmann, E. G.↗
Dual adaptive control: Design principles and applications
The design of an actively adaptive dual controller based on an approximation of the stochastic dynamic programming equation for a multi-step horizon is presented. A dual controller that can enhance identification of the system while controlling it at the same time is derived for multi-dimensional problems. This dual controller uses sensitivity functions of the expected future cost with respect to the parameter uncertainties. A passively adaptive cautious controller and the actively adaptive dual controller are examined. In many instances, the cautious controller is seen to turn off while the latter avoids the turn-off of the control and the slow convergence of the parameter estimates, characteristic of the cautious controller. The algorithms have been applied to a multi-variable static model which represents a simplified linear version of the relationship between the vibration output and the higher harmonic control input for a helicopter. Monte Carlo comparisons based on parametric and nonparametric statistical analysis indicate the superiority of the dual controller over the baseline controller.
Mookerjee, Purusottam↗
Optimal active control for Burgers equations
A method for active fluid flow control based on control theory is discussed. Dynamic programming and fixed point successive approximations are used to accommodate the nonlinear control problem. The long-term goal of this project is to establish an effective method applicable to complex flows such as turbulence and jets. However, in this report, the method is applied to stochastic Burgers equation as an intermediate step towards this goal. Numerical results are compared with those obtained by gradient search methods.
Ikeda, Yutaka↗
Free vibration characteristics of multiple load path blades by the transfer matrix method
The determination of free vibrational characteristics is basic to any dynamic design, and these characteristics can form the basis for aeroelastic stability analyses. Conventional helicopter blades are typically idealized as single-load-path blades, and the transfer matrix method is well suited to analyze such blades. Several current helicopter dynamic programs employ transfer matrices to analyze the rotor blades. In this paper, however, the transfer matrix method is extended to treat multiple-load-path blades, without resorting to an equivalent single-load-path approximation. With such an extension, these current rotor dynamic programs which employ the transfer matrix method can be modified with relative ease to account for the multiple load paths. Unlike the conventional blades, the multiple-load-path blades require the introduction of the axial degree-of-freedom into the solution process to account for the differential axial displacements of the different load paths. The transfer matrix formulation is validated through comparison with the finite-element solutions.
Murthy, V. R.↗
A forward method for optimal stochastic nonlinear and adaptive control
A computational approach is taken to solve the optimal nonlinear stochastic control problem. The approach is to systematically solve the stochastic dynamic programming equations forward in time, using a nested stochastic approximation technique. Although computationally intensive, this provides a straightforward numerical solution for this class of problems and provides an alternative to the usual dimensionality problem associated with solving the dynamic programming equations backward in time. It is shown that the cost degrades monotonically as the complexity of the algorithm is reduced. This provides a strategy for suboptimal control with clear performance/computation tradeoffs. A numerical study focusing on a generic optimal stochastic adaptive control example is included to demonstrate the feasibility of the method.
Bayard, David S.↗
Management of Risk and Uncertainty Through Optimized Co-Operation of Transmission Systems and Microgrids with Responsive Loads (Final Report)
The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Management of Risk and Uncertainty Through Optimized Co-Operation of Transmission Systems and Microgrids With Responsive Loads (Final Report)
The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Though individual consumers are interconnected at the low-voltage distribution system, these resources are typically modeled as variables at the transmission network level. Demand-side participation cannot be leveraged effectively without explicitly including the distribution system dynamics in the optimization-based wholesale market operations. This project grew from a vision for co-optimized interaction of distribution systems, or microgrids, with the high-voltage transmission system. In this framework, microgrids encompass consumers, distributed renewables and storage. The energy management system of the lower voltage system (distribution or microgrid) can also sell (buy) excess (necessary) energy from the transmission system. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. An ideal microgrid is defined as an electric entity capable of operating in both interconnected (with the high-voltage grid) and islanded mode. As such, the microgrid should incorporate generating units (traditional units and intermittent) and if needed, exchange power with the high-voltage grid. The interplay between the microgrid and high-voltage grid motivated the development of the co-optimization approach to ensure efficient performance of the interconnected network. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles
The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.
optimization↗
Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets
We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.
97 MATHEMATICS AND COMPUTING↗
New second-order and first-order algorithms for determining optimal control - A differential dynamic programming approach
Differential dynamic programming to develop second order and first order approximation methods for determining optimal control
Jacobson, D. H.↗
Towards a general object-oriented software development methodology
An object is an abstract software model of a problem domain entity. Objects are packages of both data and operations of that data (Goldberg 83, Booch 83). The Ada (tm) package construct is representative of this general notion of an object. Object-oriented design is the technique of using objects as the basic unit of modularity in systems design. The Software Engineering Laboratory at the Goddard Space Flight Center is currently involved in a pilot program to develop a flight dynamics simulator in Ada (approximately 40,000 statements) using object-oriented methods. Several authors have applied object-oriented concepts to Ada (e.g., Booch 83, Cherry 85). It was found that these methodologies are limited. As a result a more general approach was synthesized with allows a designer to apply powerful object-oriented principles to a wide range of applications and at all stages of design. An overview is provided of this approach. Further, how object-oriented design fits into the overall software life-cycle is considered.
Seidewitz, ED↗
Method for compression testing of composite materials at high strain rates
A method is presented for testing composite materials in compression at strain rates up to approximately 500 per s. The method uses a thin ring specimen (4 in. in diameter, 1 in. wide, six-eight plies thick) loaded dynamically by an external pressure pulse applied explosively through a liquid. Strains in the specimen and in a steel calibration ring are recoorded with a digital processing oscilloscope. Results are plotted by an x-y plotter in the form of a dynamic stress-strain curve. Data analysis is based on a numerical solution of the equation of motion. A computer program is used which involves smoothing and approximation of the strain magnitude, strain rate, and strain acceleration. Dynamic stress-strain curves obtained for 0-deg and 90-deg specimens of two graphite/epoxy composites are presented.
Daniel, I. M.↗
Generalized Newton-Raphson trajectory optimization-generator 1
Computer program constructs a sequence of optimal solutions to dynamically-approximate linear equations. Specification of the number and type of subarcs in the optimal solution allows simultaneous satisfaction of all switching criteria.
Cope, D. D.↗
Forward Stochastic Nonlinear Adaptive Control Method
New method of computation for optimal stochastic nonlinear and adaptive control undergoing development. Solves systematically stochastic dynamic programming equations forward in time, using nested-stochastic-approximation technique. Main advantage, simplicity of programming and reduced complexity with clear performance/computation trade-offs.
Bayard, David S.↗
Autonomous vehicle motion control, approximate maps, and fuzzy logic
Progress on research on the control of actions of autonomous mobile agents using fuzzy logic is presented. The innovations described encompass theoretical and applied developments. At the theoretical level, results of research leading to the combined utilization of conventional artificial planning techniques with fuzzy logic approaches for the control of local motion and perception actions are presented. Also formulations of dynamic programming approaches to optimal control in the context of the analysis of approximate models of the real world are examined. Also a new approach to goal conflict resolution that does not require specification of numerical values representing relative goal importance is reviewed. Applied developments include the introduction of the notion of approximate map. A fuzzy relational database structure for the representation of vague and imprecise information about the robot's environment is proposed. Also the central notions of control point and control structure are discussed.
Ruspini, Enrique H.↗
Optimal control with Chebyshev minimax performance index.
Optimal control of dynamic systems with minimax type performance index, discussing application of proposed method of solution
CHEBYSHEV APPROXIMATION↗
Robot path planning with distance-safety criterion
A method for determining an optimal path with a weighted distance-safety criterion is developed. The goal is to strike a compromise between the shortest path and the centerline path, which is safer. The method is composed of three parts: (i) construction of a region map by dividing the workspace, (ii) interregion optimization to determine the entry and departure points of the path in each region, and (iii) intraregion optimization for determining the (optimal) path segment within each region. The region map is generated by using an approximate Voronoi diagram, and region optimization is achieved using variational dynamic programming. Although developed for 2-D problems, the method can be easily extended to a class of 3-D problems. Numerical examples are presented to demonstrate the method.
Suh, Suk-Hwan↗