• DocumentCode
    391320
  • Title

    Reachability under uncertainty

  • Author

    Kurzhanski, A.B. ; Varaiya, P.

  • Author_Institution
    Fac. of Computational Math. & Cybern., Lomonosov (M.V.) State Univ., Moscow, Russia
  • Volume
    2
  • fYear
    2002
  • fDate
    10-13 Dec. 2002
  • Firstpage
    1982
  • Abstract
    The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input disturbances, which may also be interpreted as the action of an adversary in a game-theoretic setting. It defines possible notions of reachability under uncertainty emphasizing the differences between open-loop and closed-loop control. Solution schemes for calculating reachability sets are indicated. The situation when observations arrive at given isolated instances of time leads to problems of anticipative (maxmin) and nonanticipative (minmax) piecewise open-loop control with corrections and to corresponding notions of reachability. As the number of corrections tends to infinity, one comes in both cases to reachability under nonanticipative feedback control. It is shown that the closed-loop reach sets under uncertainty may be found through a solution of the forward Hamilton-Jacobi-Bellman-Isaacs (HJBI) equation. The basic relations are derived through the investigation of superpositions of value functions for appropriate sequential maxmin or minmax problems of control.
  • Keywords
    closed loop systems; game theory; linear systems; uncertain systems; closed-loop control; forward Hamilton-Jacobi-Bellman-Isaacs equation; game theory; linear systems; open-loop control; reachability; sequential maxmin problems; sequential minmax problems; uncertainty; Automatic control; Control systems; Equations; Feedback control; Forward contracts; Level set; Mathematics; Minimax techniques; Open loop systems; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2002, Proceedings of the 41st IEEE Conference on
  • ISSN
    0191-2216
  • Print_ISBN
    0-7803-7516-5
  • Type

    conf

  • DOI
    10.1109/CDC.2002.1184818
  • Filename
    1184818