To enhance dynamic tracking performance and anti-disturbance capacity of finite impulse response(FIR) filters, variable discount factors are introduced to the recursive least squares(RLS) algorithm. By employing impro...To enhance dynamic tracking performance and anti-disturbance capacity of finite impulse response(FIR) filters, variable discount factors are introduced to the recursive least squares(RLS) algorithm. By employing improved FIR filters to conduct modelling of industrial robot drive systems, dynamic characteristics of the target systems are identified. Then the fault detection for a target system can be utilized by analyzing the coefficients of the FIR filter. Finally, an application of the fault detection scheme to a kind of brushless DC motor drive system is described. Compared with reference methods, the proposed scheme achieves effective fault detection and performs better in dynamic tracking and robustness according to the final simulation results.展开更多
This paper focuses on the constrained optimality problem （COP） of first passage discrete-time Markov decision processes （DTMDPs） in denumerable state and compact Borel action spaces with multi-constraints, state-d...This paper focuses on the constrained optimality problem （COP） of first passage discrete-time Markov decision processes （DTMDPs） in denumerable state and compact Borel action spaces with multi-constraints, state-dependent discount factors, and possibly unbounded costs. By means of the properties of a so-called occupation measure of a policy, we show that the constrained optimality problem is equivalent to an （infinite-dimensional） linear programming on the set of occupation measures with some constraints, and thus prove the existence of an optimal policy under suitable conditions. Furthermore, using the equivalence between the constrained optimality problem and the linear programming, we obtain an exact form of an optimal policy for the case of finite states and actions. Finally, as an example, a controlled queueing system is given to illustrate our results.展开更多
This paper is concerned with the convergence of a sequence of discrete-time Markov decision processes(DTMDPs)with constraints,state-action dependent discount factors,and possibly unbounded costs.Using the convex analy...This paper is concerned with the convergence of a sequence of discrete-time Markov decision processes(DTMDPs)with constraints,state-action dependent discount factors,and possibly unbounded costs.Using the convex analytic approach under mild conditions,we prove that the optimal values and optimal policies of the original DTMDPs converge to those of the"limit"one.Furthermore,we show that any countablestate DTMDP can be approximated by a sequence of finite-state DTMDPs,which are constructed using the truncation technique.Finally,we illustrate the approximation by solving a controlled queueing system numerically,and give the corresponding error bound of the approximation.展开更多
基金Supported by the Provincial Training Program of Innovation and Entrepreneurship for Undergraduates (202013571002Z)。
文摘To enhance dynamic tracking performance and anti-disturbance capacity of finite impulse response(FIR) filters, variable discount factors are introduced to the recursive least squares(RLS) algorithm. By employing improved FIR filters to conduct modelling of industrial robot drive systems, dynamic characteristics of the target systems are identified. Then the fault detection for a target system can be utilized by analyzing the coefficients of the FIR filter. Finally, an application of the fault detection scheme to a kind of brushless DC motor drive system is described. Compared with reference methods, the proposed scheme achieves effective fault detection and performs better in dynamic tracking and robustness according to the final simulation results.
基金This work was supported in part by the National Natural Science Foundation of China （Grant Nos. 61374067, 41271076）.
文摘This paper focuses on the constrained optimality problem （COP） of first passage discrete-time Markov decision processes （DTMDPs） in denumerable state and compact Borel action spaces with multi-constraints, state-dependent discount factors, and possibly unbounded costs. By means of the properties of a so-called occupation measure of a policy, we show that the constrained optimality problem is equivalent to an （infinite-dimensional） linear programming on the set of occupation measures with some constraints, and thus prove the existence of an optimal policy under suitable conditions. Furthermore, using the equivalence between the constrained optimality problem and the linear programming, we obtain an exact form of an optimal policy for the case of finite states and actions. Finally, as an example, a controlled queueing system is given to illustrate our results.
基金supported by National Natural Science Foundation of China (Grant Nos. 61374067 and 41271076)
文摘This paper is concerned with the convergence of a sequence of discrete-time Markov decision processes(DTMDPs)with constraints,state-action dependent discount factors,and possibly unbounded costs.Using the convex analytic approach under mild conditions,we prove that the optimal values and optimal policies of the original DTMDPs converge to those of the"limit"one.Furthermore,we show that any countablestate DTMDP can be approximated by a sequence of finite-state DTMDPs,which are constructed using the truncation technique.Finally,we illustrate the approximation by solving a controlled queueing system numerically,and give the corresponding error bound of the approximation.
