Search

Efficient and reliable integrators are indispensable for the design of sequential solvers for optimal control problems involving continuous dynamics, especially for real-time applications. In this paper, optimal control problems for systems represented by index-1 differential-algebraic equations are investigated. On the basis of a time-scaling transformation, the control is parameterized as a piecewise constant function with variable heights and switching time instants. Compared with control parameterization with fixed time grids, the flexibility of adjusting switching time instants increases the chance of finding the optimal solution. Furthermore, error constraints are introduced in the optimization procedure such that the optimal control obtained has a guarantee of integration accuracy. For the derived approximate nonlinear programming problem, a function evaluation and forward sensitivity propagation algorithm is proposed with an embedded implicit Runge–Kutta integrator, which executes one Newton iteration in the limit by employing a predictor-corrector strategy. This algorithm is combined with a nonlinear programming solver Ipopt to construct the optimal control solver. Numerical experiments for the solution of the optimal control problem for a Delta robot demonstrate that the computational speed of this solver is increased by a factor of 0.5–2 when compared with the same solver without the predictor-corrector strategy, and increased by a factor of 20–40 when compared with solver embedding IDAS , the Implicit Differential-Algebraic solver with Sensitivity capabilities developed by Lawrence Livermore National Laboratory. Meanwhile, the accuracy loss compared with the one using IDAS is small and admissible. [ABSTRACT FROM AUTHOR]

We consider distributionally robust two-stage stochastic convex programming problems, in which the recourse problem is linear. Other than analyzing these new models case by case for different ambiguity sets, we adopt a unified form of ambiguity sets proposed by Wiesemann, Kuhn and Sim, and extend their analysis from a single stochastic constraint to the two-stage stochastic programming setting. It is shown that under a standard set of regularity conditions, this class of problems can be converted to a conic optimization problem. Numerical results are presented to show the efficiency of the distributionally robust approach. [ABSTRACT FROM AUTHOR]