LEADER 03401nam  2200445   450 
001 9910795212803321
005 20230802001534.0
010   $a3-8325-9700-X
035   $a(CKB)4340000000242411
035   $a(MiAaPQ)EBC5216740
035   $a(Au-PeEL)EBL5216740
035   $a(CaPaEBR)ebr11539389
035   $a(OCoLC)1021804480
035   $a58a1c68a-9c48-4d86-8022-3edeb0dd2d03
035   $a(EXLCZ)994340000000242411
100   $a20180522d2012      uy             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aOptimal control of switched systems with application to networked embedded control systems /$fDaniel Go?rges
210  1$aBerlin :$cLogos Verlag,$d[2012]
210  4$d©2012
215   $a1 online resource (206 pages)
225 0 $aForschungsberichte aus dem Lehrstuhl für Regelungssysteme
300   $aPublicationDate: 20120310
311   $a3-8325-3096-7 
330   $aLong description: This thesis addresses optimal control of discrete-time switched linear systems with application to networked embedded control systems (NECSs).  Part I focuses on optimal control and scheduling of discrete-time switched linear systems. The objective is to simultaneously design a control law and a switching (scheduling) law such that a cost function is minimized. This optimization problem exhibits exponential complexity. Taming the complexity is a major challenge. Two novel methods are presented to approach this optimization problem:  Receding-horizon control and scheduling relies on the receding horizon principle. The optimization problem is solved based on relaxed dynamic programming, allowing to reduce complexity by relaxing optimality within predefined bounds. The solution can be expressed as a piecewise linear (PWL) state feedback control law. Stability is addressed via an a priori stability condition based on a terminal weighting matrix and several a posteriori stability criteria based on constructing piecewise quadratic Lyapunov functions and on utilizing the cost function as a candidate Lyapunov function. Moreover, a region-reachability criterion is derived.  Periodic control and scheduling relies on periodic control theory. Both offline and online scheduling are studied. The optimization problem is solved based on periodic control and exhaustive search. The online scheduling solution can again be expressed as a PWL state feedback control law. Stability is guaranteed inherently. Several methods are proposed to reduce the online complexity based on relaxation and heuristics.  Part II focuses on optimal control and scheduling of NECSs. The NECS is modeled as a block-diagonal discrete-time switched linear system. Various control and scheduling codesign strategies are derived based on the methods from Part I regarding the structural properties of NECSs. The methods presented in Part I and II are finally evaluated in a case study.
606   $aNetworks on a chip$xReliability
615  0$aNetworks on a chip$xReliability.
676   $a621.381531
700   $aGo?rges$b Daniel$01551343
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910795212803321
996   $aOptimal control of switched systems with application to networked embedded control systems$93810768
997   $aUNINA