Prudent-Daring vs Tolerant Survivor Selection Schemes in Control Design of Electric Drives | SpringerLink
Skip to main content
Springer Nature Link
Log in

Prudent-Daring vs Tolerant Survivor Selection Schemes in Control Design of Electric Drives

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3907))

Included in the following conference series:

Abstract

This paper proposes and compares two approaches to defeat the noise due the measurement errors in control system design of electric drives. The former is based on a penalized fitness and two cooperative-competitive survivor selection schemes, the latter is based on a survivor selection scheme which makes use of the tolerance interval related to the noise distribution. These approaches use adaptive rules in parameter setting to execute both the explicit and the implicit averaging in order to obtain the noise defeating in the optimization process with a relatively low number of fitness evaluations. The results show that the two approaches differently bias the population diversity and that the first can outperform the second but requires a more accurate parameter setting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Branke, J.: Evolutionary Optimization in Dynamic Enviroments. Kluwer, Dordrecht (2001)

    Google Scholar 

  2. Jin, Y., Branke, J.: Evultionary optimization in uncertain enviroments-a survey. IEEE Trans. on Evolutionary Computation 9, 303–317 (2005)

    Article  Google Scholar 

  3. Krishnan, R.: Electronic Motor Drives: Modeling, Analysis and Control. Prentice-Hall, Upper Saddle River (2001)

    Google Scholar 

  4. Leonhard, W.: Control of Electrical Drives, 2nd edn. Springer, Heidelberg (1996)

    Google Scholar 

  5. Caponio, A., Cascella, G.L., Neri, F., Salvatore, N., Sumner, M.: A fast adaptive memetic algorithm for on-line and off-line control design of pmsm drives. To app. IEEE Trans. on System Man and Cybernetics-B, spec. issue Memetic Alg.s (2006)

    Google Scholar 

  6. Whitley, D.: The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proc. 3rd Int. Conf. on GAs, pp. 116–121 (1989)

    Google Scholar 

  7. Eshelman, L.J., Shaffer, J.D.: Real-coded genetic algorithms and interval-schemata. In: Foundations of Genetic Algorithms, vol. 2, pp. 187–202. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  8. Ong, Y.S., Keane, A.J.: Meta-lamarkian learning in memetic algorithms. IEEE Trans. on Evolutionary Computation 8, 99–110 (2004)

    Article  Google Scholar 

  9. NIST: e-handbook of statistical methods, http://www.itl.nist.gov/div898/handbook/

Download references

Author information

Authors and Affiliations

  1. Dipatimento di Elettrotecnica ed Elettronica, Politecnico di Bari, Via E. Orabona 4, Bari, 70125, Italy

    Ferrante Neri, Giuseppe L. Cascella, Nadia Salvatore & Giuseppe Acciani

  2. Laboratory of Theoretical Probabilistic Methods, Yaroslavl’ State University, 150000, Sovetskaya st. 14, Yaroslavl’, Russia

    Anna V. Kononova

Authors
  1. Ferrante Neri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe L. Cascella
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nadia Salvatore
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anna V. Kononova
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Giuseppe Acciani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  2. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  3. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  4. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Dept. LCC, Universidad de Málaga, Spain

    Carlos Cotta

  6. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  7. INRIA Saclay - Ile-de-France, Parc Orsay Université, 4, rue Jacques Monod, 91893, ORSAY Cedex, France

    Evelyne Lutton

  8. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  9. Dartmouth College, Lebanon, NH, USA

    Jason H. Moore

  10. Universidade de A Coruña, CP 15071, A Coruña, Spain

    Juan Romero

  11. School of Computing Sciences, UEA Norwich, University of East Anglia, NR4 7TJ, Norwich, UK

    George D. Smith

  12. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  13. Kyushu University, Japan

    Hideyuki Takagi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neri, F., Cascella, G.L., Salvatore, N., Kononova, A.V., Acciani, G. (2006). Prudent-Daring vs Tolerant Survivor Selection Schemes in Control Design of Electric Drives. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_78

Download citation

  • DOI: https://doi.org/10.1007/11732242_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33237-4

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics