IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2020i1p21-d467363.html
   My bibliography  Save this article

Fundamentals of Synthesized Optimal Control

Author

Listed:
  • Askhat Diveev

    (Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 119333 Moscow, Russia)

  • Elizaveta Shmalko

    (Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 119333 Moscow, Russia)

  • Vladimir Serebrenny

    (Department of Robotic Systems and Mechatronics, Bauman Moscow State Technical University, 105005 Moscow, Russia)

  • Peter Zentay

    (Faculty of Mechanical Engineering, Budapest University of Technology and Economics, 1111 Budapest, Hungary)

Abstract

This paper presents a new formulation of the optimal control problem with uncertainty, in which an additive bounded function is considered as uncertainty. The purpose of the control is to ensure the achievement of terminal conditions with the optimal value of the quality functional, while the uncertainty has a limited impact on the change in the value of the functional. The article introduces the concept of feasibility of the mathematical model of the object, which is associated with the contraction property of mappings if we consider the model of the object as a one-parameter mapping. It is shown that this property is sufficient for the development of stable practical systems. To find a solution to the stated problem, which would ensure the feasibility of the system, the synthesized optimal control method is proposed. This article formulates the theoretical foundations of the synthesized optimal control. The method consists in making the control object stable relative to some point in the state space and to control the object by changing the position of the equilibrium points. The article provides evidence that this approach is insensitive to the uncertainties of the mathematical model of the object. An example of the application of the method for optimal control of a group of robots is given. A comparison of the synthesized optimal control method with the direct method on the model without disturbances and with them is presented.

Suggested Citation

  • Askhat Diveev & Elizaveta Shmalko & Vladimir Serebrenny & Peter Zentay, 2020. "Fundamentals of Synthesized Optimal Control," Mathematics, MDPI, vol. 9(1), pages 1-18, December.
  • Handle: RePEc:gam:jmathe:v:9:y:2020:i:1:p:21-:d:467363
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/1/21/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/1/21/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Aram Arutyunov & Dmitry Karamzin, 2020. "A Survey on Regularity Conditions for State-Constrained Optimal Control Problems and the Non-degenerate Maximum Principle," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 697-723, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Askhat Diveev & Elizaveta Shmalko, 2023. "Adaptive Synthesized Control for Solving the Optimal Control Problem," Mathematics, MDPI, vol. 11(19), pages 1-18, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jorge Becerril & Cristopher Hermosilla, 2022. "Optimality Conditions for Linear-Convex Optimal Control Problems with Mixed Constraints," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 795-820, September.
    2. Fernando Lobo Pereira & Nathalie T. Khalil, 2022. "A Maximum Principle for a Time-Optimal Bilevel Sweeping Control Problem," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 1022-1051, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2020:i:1:p:21-:d:467363. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.