Finding a feasible control for real process under uncertainty

  • M. Brdyś
Optimal Control Stochastic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 41)


In the paper the problem of finding a feasible control for real process is discussed. It is assumed that the available mathematical model of the process differs from its real mathematical description but there is some consistence between them. Under such assumption the feasible control for real process is found by using the process mathematical model only. To show that this approach makes sense the existence theorems are given.

From the point of view of the control the problem is considered in two aspects. First, we want only to find the feasible control for the process; a numerical algorithm with convergence analysis is given. Second, we want to generate on-line a feasible control for the real process when its constraints are violated. In this case numerical algorithms with convergence analysis are also given. Finally, numerical example is presented.


  1. 1.
    A. Auslender,—Problémes de Minimax via l'Analiyse Convexe et les Inégalités Variationnelles: Théorie et Algori thmes, Springer-Verlag, Berlin, Heidelberg, New-York, 1972.Google Scholar
  2. 2.
    D.P. Bertsekas, S.K. Mitter, A. Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals, SIAM Journal on Control, 11 (1973), pp.637–652.Google Scholar
  3. 3.
    M. Brdyś — Methods for Finding a Point from Feasible set of the System Controlled On-Line on the Base of its Mathematical Model with Shifted Parameters, Doctoral Dissertation, Institute of Automatic Control Techn. University of Warsaw, 1974 /in Polish/.Google Scholar
  4. 4.
    J. Céa — Optimization Théorie et algorithmes, Dunod,Paris, 1971.Google Scholar
  5. 5.
    N. Dunford, J.T. Schwartz, — Linear operators, Part I: General Theory, Interscience Publishers, Inc., New York, 1966.Google Scholar
  6. 6.
    K. Fan — Minimax Theorems.Proc.Nat.Acad.Sci., 39/1953/,pp.42–47.Google Scholar
  7. 7.
    A.D. Ioffe, W.M. Tichomirow — A Duality of convex functions and exstremal problems, UMN 23,6 (1968), pp.51–116.Google Scholar
  8. 8.
    J.J. Moreau — Functionelles sous-differentiables, C.R.Acad. Sci. Paris, 257 (1963), pp.4117–4119.Google Scholar
  9. 9.
    B.N. Pshenichnyi — Necessary Conditions for Optimality, Nauka Moskwa, 1969.Google Scholar
  10. 10.
    B.T. Polyak — A Certain General Method for Solving Exstremal Problems, Dokl.Akad.Nauk SSSR, 174 (1967), no. 1,pp. 33–36.Google Scholar
  11. 11.
    H.Radwan — An Investigation of Efficiency of the Algorithms of Feasible Control Generation for Real Process on the Base of Process Mathematical Model with Unknown Parameters, M. Sci., Thesis, Institute of Automatic Control, Technical University of Warsaw, 1974.Google Scholar
  12. 12.
    M. Sion — On General Minimax Theorems, Pacific J. of Math., 8/ 1958/, pp.171–176.Google Scholar
  13. 13.
    M. Valadier — Sous-Différentiels d'une Borne Supérieure at d'Une Somme Continue de Functions Convexes, C.R. Acad.Sci. Paris 268, pp.39–42, 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • M. Brdyś
    • 1
  1. 1.Institute of Automatic ControlTechnical University of WarsawWarsawPoland

Personalised recommendations