1. Differential neural network robust constrained controller using approximate dynamic programming.
- Author
-
Noriega-Marquez, Sebastian, Poznyak, Alexander, Hernandez-Sanchez, Alejandra, and Chairez, Isaac
- Subjects
DYNAMIC programming ,COST functions ,ROBUST control ,PARTIAL differential equations ,NONLINEAR systems ,HAMILTON-Jacobi-Bellman equation - Abstract
This study focuses on developing a continuous differential neural network (DNN) approximating min–max robust control by applying dynamic neural programming. The suggested controller is applied to a class of nonlinear perturbed systems providing satisfactory dynamics for a given cost function depending on both the trajectories of the perturbed system and the designed constrained control actions. The min–max formulation for dynamic programming offers reliable control for restricted modeling uncertainties and perturbations. The suggested design considers control norm restrictions in the optimization problem. DNN's approximation of the worst (with respect to the admissible class of perturbations and uncertainties) value function of the Hamilton–Jacobi–Bellman (HJB) equation enables the estimation of the closed-loop formulation of the controller. The robust version of the HJB partial differential equation is studied to create the learning law class for the time-varying weights in the DNN. The controller employs a time-varying Lyapunov-like differential equation and the solution of the corresponding learning laws. A recurrent algorithm based on the Kiefer–Wolfowitz technique can be used by modifying the weights' initial conditions to fulfill the specified cost function's end requirements. A numerical example tests the robust control proposed in this study, validating the robust optimal solution based on the DNN approximation for Bellman's value function. • A robust optimal control is developed using approximate neural dynamic programming. • Robust optimal control is solved for nonlinear systems with restricted control actions. • A differential neural network is used to approximate Belman's function for Hamilton–Jacobi–Bellman equation. • The learning laws are derived based on the Hamilton–Jacobi–Bellman equation. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF