Control of Complex Dynamic Systems by Neural Networks

This paper considers the use of neural networks (NN's) in controlling a nonlinear, stochastic system with unknown process equations. The NN is used to model the resulting unknown control law. The approach here is based on using the output error of the system to train the NN controller without the need to construct a separate model (NN or other type) for the unknown process dynamics. To implement such a direct adaptive control approach, it is required that connection weights in the NN be estimated while the system is being controlled. As a result of the feedback of the unknown process dynamics, however, it is not possible to determine the gradient of the loss function for use in standard (back-propagation-type) weight estimation algorithms. Therefore, this paper considers the use of a new stochastic approximation algorithm for this weight estimation, which is based on a 'simultaneous perturbation' gradient approximation that only requires the system output error. It is shown that this algorithm can greatly enhance the efficiency over more standard stochastic approximation algorithms based on finite-difference gradient approximations

A Real-time Nonlinear Model Predictive Controller for Yaw Motion Optimization of Distributed Drive Electric Vehicles

This paper proposes a real-time nonlinear model predictive control (NMPC) strategy for direct yaw moment control (DYC) of distributed drive electric vehicles (DDEVs). The NMPC strategy is based on a control-oriented model built by integrating a single track vehicle model with the Magic Formula (MF) tire model. To mitigate the NMPC computational cost, the continuation/generalized minimal residual (C/GMRES) algorithm is employed and modified for real-time optimization. Since the traditional C/GMRES algorithm cannot directly solve the inequality constraint problem, the external penalty method is introduced to transform inequality constraints into an equivalently unconstrained optimization problem. Based on the Pontryagin’s minimum principle (PMP), the existence and uniqueness for solution of the proposed C/GMRES algorithm are proven. Additionally, to achieve fast initialization in C/GMRES algorithm, the varying predictive duration is adopted so that the analytic expressions of optimally initial solutions in C/GMRES algorithm can be derived and gained. A Karush-Kuhn-Tucker (KKT) condition based control allocation method distributes the desired traction and yaw moment among four independent motors. Numerical simulations are carried out by combining CarSim and Matlab/Simulink to evaluate the effectiveness of the proposed strategy. Results demonstrate that the real-time NMPC strategy can achieve superior vehicle stability performance, guarantee the given safety constraints, and significantly reduce the computational efforts

NARX-based nonlinear system identification using orthogonal least squares basis hunting

An orthogonal least squares technique for basis hunting (OLS-BH) is proposed to construct sparse radial basis function (RBF) models for NARX-type nonlinear systems. Unlike most of the existing RBF or kernel modelling methods, whichplaces the RBF or kernel centers at the training input data points and use a fixed common variance for all the regressors, the proposed OLS-BH technique tunes the RBF center and diagonal covariance matrix of individual regressor by minimizing the training mean square error. An efficient optimization method isadopted for this basis hunting to select regressors in an orthogonal forward selection procedure. Experimental results obtained using this OLS-BH technique demonstrate that it offers a state-of-the-art method for constructing parsimonious RBF models with excellent generalization performance

Distributed Reconstruction of Nonlinear Networks: An ADMM Approach

In this paper, we present a distributed algorithm for the reconstruction of large-scale nonlinear networks. In particular, we focus on the identification from time-series data of the nonlinear functional forms and associated parameters of large-scale nonlinear networks. Recently, a nonlinear network reconstruction problem was formulated as a nonconvex optimisation problem based on the combination of a marginal likelihood maximisation procedure with sparsity inducing priors. Using a convex-concave procedure (CCCP), an iterative reweighted lasso algorithm was derived to solve the initial nonconvex optimisation problem. By exploiting the structure of the objective function of this reweighted lasso algorithm, a distributed algorithm can be designed. To this end, we apply the alternating direction method of multipliers (ADMM) to decompose the original problem into several subproblems. To illustrate the effectiveness of the proposed methods, we use our approach to identify a network of interconnected Kuramoto oscillators with different network sizes (500~100,000 nodes).Comment: To appear in the Preprints of 19th IFAC World Congress 201