The Permanent Magnet Synchronous Motor (PMSM) is widely used in many fields. Aiming at nonlinearity, strong coupling and uncertainty of the PMSM, this paper proposes a nonlinear multi-input multi-output (MIMO) decoupling PMSM algorithm based on Active Disturbance Rejection Control (ADRC). A Lower-Upper matrix factorization approach is introduced to solve a general inverse of the measured time-varying matrix in real-time decoupling ADRC. This PMSM is based on the vector control. First, the PMSM model and vector control are simulated. Then, a first-order ADRC is introduced and used to replace the PID controller in the d and q axis of PMSM respectively. The simulation shows that the replaced system has a smaller fluctuation, faster response and better stability. Finally, the nonlinear MIMO decoupling ADRC and its inverse matrix method are deduced. Then, the decoupling PMSM control based on ADRC is verified. The simulation shows that this system has a better static and dynamic performance, and it conforms to the PMSM characteristics better. All this shows that the nonlinear MIMO decoupling ADRC is a better strategy for the PMSM. The presented algorithm also has advantage in method compared with some recent results of decoupling PMSM control.
7 December 2017 in Optimal Control Applications and Methods
Summary: The approximate dynamic programming needs 2 prerequisites to be an effective optimal control method. Firstly, it must be assured to be stable and convergent before application. Secondly, the control system should mainly be a nonlinear multi‐input multi‐output form. Thus, this paper introduces a nonlinear multi‐input multi‐output approximate dynamic programming and proves that it is stable in Lyapunov sense, therefore it is convergent. Besides, the Lyapunov function design is also analyzed. These proofs are based on the Lyapunov stability theory in the form of the utility function of quadratic, square‐weighted sum, and absolute value. Thereafter, 3 typical control examples of nonlinear multi‐input multi‐output approximate dynamic programming are offered to show their applications and verify the proofs. The proof overcomes the complex derivation, and the results contain 3 practical and systematic bounded proofs. It is for the first time that the proof focuses on nonlinear multi‐input multi‐output approximate dynamic programming from the view of utility function. What is more, the results can also serve as an effective analysis and guide for the utility function design and the stability criterion of nonlinear multi‐input multi‐output approximate dynamic programming as well.
1 January 2013 in Applied Mathematics and Computation