This paper studies the problem of the optimal control design of permanent magnet synchronous motor (PMSM) drives taking into account the noise due to sensors and measurement devices. The problem is analyzed by means of an experimental approach which considers noisy data returned by the real plant (on-line). In other words, each fitness evaluation does not come from a computer but from a real laboratory experiment. In order to perform the optimization notwithstanding presence of the noise, this paper proposes an Adaptive Prudent- Daring Evolutionary Algorithm (APDEA). The APDEA is an evolutionary algorithm with a dynamic parameter setting. Furthermore, the APDEA employs a dynamic penalty term and two cooperative-competitive survivor selection schemes. The numerical results show that the APDEA robustly executes optimization in the noisy environment. In addition, comparison with other meta-heuristics shows that behavior of the APDEA is very satisfactory in terms of convergence velocity. A statistical test confirms the effectiveness of the APDEA.
An Adaptive Prudent-Daring Evolutionary Algorithm for Noise Handling in On-line PMSM Drive Design / Neri, F.; Cascella, G. L.; Salvatore, N.; Stasi, Silvio. - In: IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION. - ISSN 1089-778X. - (2007), pp. 584-591. (Intervento presentato al convegno IEEE Congress on Evolutionary Computation, CEC 2007 tenutosi a Singapore nel September 25-28, 2007) [10.1109/CEC.2007.4424523].
An Adaptive Prudent-Daring Evolutionary Algorithm for Noise Handling in On-line PMSM Drive Design
Cascella, G. L.;STASI, Silvio
2007-01-01
Abstract
This paper studies the problem of the optimal control design of permanent magnet synchronous motor (PMSM) drives taking into account the noise due to sensors and measurement devices. The problem is analyzed by means of an experimental approach which considers noisy data returned by the real plant (on-line). In other words, each fitness evaluation does not come from a computer but from a real laboratory experiment. In order to perform the optimization notwithstanding presence of the noise, this paper proposes an Adaptive Prudent- Daring Evolutionary Algorithm (APDEA). The APDEA is an evolutionary algorithm with a dynamic parameter setting. Furthermore, the APDEA employs a dynamic penalty term and two cooperative-competitive survivor selection schemes. The numerical results show that the APDEA robustly executes optimization in the noisy environment. In addition, comparison with other meta-heuristics shows that behavior of the APDEA is very satisfactory in terms of convergence velocity. A statistical test confirms the effectiveness of the APDEA.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.