A distributed accelerated gradient algorithm for distributed model predictive control of a hydro power valley

A distributed model predictive control (DMPC) approach based on distributed optimization is applied to the power reference tracking problem of a hydro power valley (HPV) system. The applied optimization algorithm is based on accelerated gradient methods and achieves a convergence rate of O(1/k^2), where k is the iteration number. Major challenges in the control of the HPV include a nonlinear and large-scale model, nonsmoothness in the power-production functions, and a globally coupled cost function that prevents distributed schemes to be applied directly. We propose a linearization and approximation approach that accommodates the proposed the DMPC framework and provides very similar performance compared to a centralized solution in simulations. The provided numerical studies also suggest that for the sparsely interconnected system at hand, the distributed algorithm we propose is faster than a centralized state-of-the-art solver such as CPLEX

Algebraic solutions of tropical optimization problems

We consider multidimensional optimization problems, which are formulated and solved in terms of tropical mathematics. The problems are to minimize (maximize) a linear or nonlinear function defined on vectors of a finite-dimensional semimodule over an idempotent semifield, and may have constraints in the form of linear equations and inequalities. The aim of the paper is twofold: first to give a broad overview of known tropical optimization problems and solution methods, including recent results; and second, to derive a direct, complete solution to a new constrained optimization problem as an illustration of the algebraic approach recently proposed to solve tropical optimization problems with nonlinear objective function.Comment: 25 pages, presented at Intern. Conf. "Algebra and Mathematical Logic: Theory and Applications", June 2-6, 2014, Kazan, Russi

Stochastic Nonlinear Model Predictive Control with Efficient Sample Approximation of Chance Constraints

This paper presents a stochastic model predictive control approach for nonlinear systems subject to time-invariant probabilistic uncertainties in model parameters and initial conditions. The stochastic optimal control problem entails a cost function in terms of expected values and higher moments of the states, and chance constraints that ensure probabilistic constraint satisfaction. The generalized polynomial chaos framework is used to propagate the time-invariant stochastic uncertainties through the nonlinear system dynamics, and to efficiently sample from the probability densities of the states to approximate the satisfaction probability of the chance constraints. To increase computational efficiency by avoiding excessive sampling, a statistical analysis is proposed to systematically determine a-priori the least conservative constraint tightening required at a given sample size to guarantee a desired feasibility probability of the sample-approximated chance constraint optimization problem. In addition, a method is presented for sample-based approximation of the analytic gradients of the chance constraints, which increases the optimization efficiency significantly. The proposed stochastic nonlinear model predictive control approach is applicable to a broad class of nonlinear systems with the sufficient condition that each term is analytic with respect to the states, and separable with respect to the inputs, states and parameters. The closed-loop performance of the proposed approach is evaluated using the Williams-Otto reactor with seven states, and ten uncertain parameters and initial conditions. The results demonstrate the efficiency of the approach for real-time stochastic model predictive control and its capability to systematically account for probabilistic uncertainties in contrast to a nonlinear model predictive control approaches.Comment: Submitted to Journal of Process Contro

Aggregate constrained inventory systems with independent multi-product demand: control practices and theoretical limitations

In practice, inventory managers are often confronted with a need to consider one or more aggregate constraints. These aggregate constraints result from available workspace, workforce, maximum investment or target service level. We consider independent multi-item inventory problems with aggregate constraints and one of the following characteristics: deterministic leadtime demand, newsvendor, basestock policy, rQ policy and sS policy. We analyze some recent relevant references and investigate the considered versions of the problem, the proposed model formulations and the algorithmic approaches. Finally we highlight the limitations from a practical viewpoint for these models and point out some possible direction for future improvements