Skip to main content

Cartesian Genetic Programming for Synthesis of Optimal Control System

  • Conference paper
  • First Online:
Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2 (FTC 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1289))

Included in the following conference series:

Abstract

The problem of general synthesis of optimal control system of mobile robot is considered. In the problem it is necessary to find a feedback control function such that a mobile robot can achieve the set terminal position from any point of area of initial conditions. The solution of this problem is a mathematical expression of control function. For solution of this problem Cartesian genetic programming (CGP) is used. CGP is one of symbolic regression methods. The methods of symbolic regression allow numerical with the help of computer to find analytical form of mathematical expression. CGP codes multi-dimension function in a form of integer matrix on the base of the sets of arguments and elementary functions. Every string of this matrix is a code of one call of a function. For search of optimal solution, a variation genetic algorithm is used that realizes the principle of small variation of basic solution. The algorithm searches for a mathematical expression of the feedback control function in the form of code and at the same time value of parametric vector that is one of arguments of this function. An example of numerical solution of the control system synthesis problem for mobile robot is presented. It is introduced a conception a space of machine made functions. In this space functions can’t have value is infinity, and all function can be presented in the form of Taylor’s series only with a finite number of members.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA (1992)

    MATH  Google Scholar 

  2. Ryan C., Collins J., Neill M.O.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf W., Poli R., Schoenauer M., Fogarty T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. pp. 83–96, Springer, Berlin, Heidelberg (1998) https://doi.org/10.1007/BFb0055930

  3. Zelinka, I., Oplatkova, Z., Nolle, L.: Analytic programming symbolic regression by means of arbitrary evolutionary algorithm. Int. J. Simul. Syst. Sci. Technol. 6(9), 44–56 (2005)

    Google Scholar 

  4. Julian M.J., Thomson, P.: Cartesian genetic programming. In: Proceedings of the European Conference on Genetic Programming (EuroGP2000), vol. 1802, pp. 121–132. Milan, Italy (2000) https://doi.org/10.1007/978-3-540-46239-2_9

  5. Nikolay Nikolaev, N., Iba, I.: Adaptive Learning of Polynomial Networks. In: Goldberg, D., Koza, J., (Eds) Inductive Genetic Programming. Genetic and Evolutionary Computation. pp. 25–80. (2006). https://doi.org/10.1007/0-387-31240-4_2

  6. Diveev, A.I., Sofronova, E.A.: The network operator method for search of the most suitable mathematical equation. Chapter in the book Bio-Inspired Comput. Algorithm Appl. 47(3), 7061–7066 (2012). https://doi.org/10.5772/36071

    Article  Google Scholar 

  7. Luo, Ch., Zhang, S.-L.: Parse-matrix evolution for symbolic regression. Eng. Appl. Artif. Intell. 25(6), 1182–1193 (2012). https://doi.org/10.1016/j.engappai.2012.05.015

    Article  Google Scholar 

  8. Diveev, A., Sofronova, E.: Automation of synthesized optimal control problem solution for mobile robot by genetic programming. Adv. Intell. Syst. Comput. 1038, 1054–1072 (2019). https://doi.org/10.1007/978-3-030-29513-4_77

    Article  Google Scholar 

  9. Diveev, A.: Small variations of basic solution method for non-numerical optimization. IFAC-Papers-Online 38, 28–33 (2015). https://doi.org/10.1016/j.ifacol.2015.11.054

    Article  Google Scholar 

  10. Diveev, A., Ibadulla, S., Konyrbaev, N., Shmalko, E.: Variational genetic programming for optimal control system synthesis of mobile robots. IFAC-Papers-Online 48, 106–111 (2015). https://doi.org/10.1016/j.ifacol.2015.12.018

    Article  Google Scholar 

  11. Diveev, A., Ibadulla, S., Konyrbaev, N., Shmalko, E.: Variational analytic programming for synthesis of optimal control for flying robot. IFAC-Papers-Online 48, 75–80 (2015). https://doi.org/10.1016/j.ifacol.2015.12.013

    Article  Google Scholar 

  12. Mizhidon, A.D.: On a problem of analytic design of an optimal controller. Autom. Remote Control 72(11), 2315–2327 (2011). https://doi.org/10.1134/S0005117911110063

    Article  MathSciNet  MATH  Google Scholar 

  13. Podvalny, S.L., Vasiljev, E.M.: Analytical synthesis of aggregated regulators for unmanned aerial vehicles. J. Math. Sci. 239(2), 135–145 (2019). https://doi.org/10.1007/s10958-019-04295-w

    Article  MathSciNet  MATH  Google Scholar 

  14. Prajna, S., Parrilo, P.A., Rantzer, A.: Nonlinear control synthesis by convex optimization. IEEE Trans. Autom. Control 49(2), 304–314 (2004). https://doi.org/10.1109/TAC.2003.823000

    Article  MathSciNet  MATH  Google Scholar 

  15. Diveev, A.I.: A numerical method for network operator for synthesis of a control system with uncertain initial values. J. Comput. Syst. Sci. Int. 51(2), 228–243 (2012). https://doi.org/10.1134/S1064230712010066

    Article  MathSciNet  MATH  Google Scholar 

  16. Šuster, P., Jadlovská, A.: Racking trajectory of the mobile robot khepera ii using approaches of artificial intelligence. Acta Electrotechnica et Informatica 11(1), 38–43 (2011). https://doi.org/10.2478/v10198-011-0006-y

    Article  Google Scholar 

Download references

Acknowledgments

This work was performed with partial support from the Russian Science Foundation (project No 19-11-00258).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Askhat Diveev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Diveev, A. (2021). Cartesian Genetic Programming for Synthesis of Optimal Control System. In: Arai, K., Kapoor, S., Bhatia, R. (eds) Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2 . FTC 2020. Advances in Intelligent Systems and Computing, vol 1289. Springer, Cham. https://doi.org/10.1007/978-3-030-63089-8_13

Download citation

Publish with us

Policies and ethics