No label defined (Q3756879)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4007093
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4007093

      Statements

      0 references
      1986
      0 references
      suboptimal control
      0 references
      extended admissible control
      0 references
      relaxation algorithm
      0 references
      The following optimal control problem is considered: \[ (1)\quad I(u,x_ 0)=c'x(t)\to \max,\quad \dot x=Ax+bu,\quad u=u(.)=(u(t),t\in T)\in P,\quad x(0)=x_ 0,\quad d_*\leq x_ 0\leq d^*, \] with state-space constraints \(| d'x(t)| \leq 1\), \(t\in [0,t_*]=T\), where \(x: T\to R^ n\), \(u: T\to R^ 1\), A is an \(n\times n\) matrix, \(b,c,d,d_*,d^*\) are vectors of suitable dimensions. P is a class of controls such that \(u(t)=u(t| v)=h'w(t)\), \(\dot w=Dw\), \(w(0)=v\), \(f_*\leq v\leq f^*\), \(w: T\to R^ m\), where h, \(f_*\), \(f^*\), D are vectors resp. a matrix of suitable dimensions. The extended control \((u(.),x_ 0)\) and the trajectory x(t), \(t\in T\) are called admissible if \(| d'x(t)| \leq 1\), \(t\in T\). Each extended admissible control \((u^ 0(.),x^ 0_ 0)\) is called optimal if \(I(u^ 0,x^ 0_ 0)=\max I(u,x)\), \(u\in P\). Each admissible extended control \((u^{\epsilon}(.),x_ 0^{\epsilon})\) is called \(\epsilon\)-optimal, \(\epsilon\geq 0\), if \(I(u^ 0,x^ 0_ 0)- I(u^{\epsilon},x_ 0^{\epsilon})\leq \epsilon.\) The paper deals with a relaxation algorithm for the solution of (1) which for any \(\epsilon\geq 0\) and each initial admissible control defines an \(\epsilon\)-optimal control after performing a finite number of iterations. The structure of the algorithms is rather standard.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references