東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph Control Lypaunov Function for ...

Lee, Donghwan.

FindBook

Google Book

Amazon

博客來

Graph Control Lypaunov Function for Switched Linear Systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph Control Lypaunov Function for Switched Linear Systems./
作者:	Lee, Donghwan.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	127 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.
Contained By:	Dissertation Abstracts International79-02B(E).
標題:	Electrical engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10607880
ISBN:	9780355258196

Graph Control Lypaunov Function for Switched Linear Systems.
Lee, Donghwan.

Graph Control Lypaunov Function for Switched Linear Systems. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 127 p.

Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.

Thesis (Ph.D.)--Purdue University, 2017.

The goal of this thesis is to study stabilization of discrete-time switched linear systems (SLSs) and controlled switched linear systems (CSLSs). To analyze stabilizability of SLSs and CSLSs, we introduce the notion of graph control Lyapunov functions (GCLFs), which is a graph theoretic approach to standard Lyapunov theorems. The GCLF is a set of Lyapunov functions which satisfy Lyapunov inequalities associated with a weighted directed graph (digraph). Each Lyapunov function represents each node in the digraph, and each Lyapunov inequality represents a subgraph consisting of edges connecting a node and its out-neighbors (directed rooted tree). The weight of each directed edge indicates the decay or growth rate of the Lyapunov functions from the tail to the head of the edge. It is proved that a SLS is switching stabilizable if and only if there exists a GCLF. The GCLF is an extension of recently developed graph Lyapunov functions for stability of SLSs under arbitrary switchings to stabilization of SLS under controlled switchings. We prove that GCLFs unify several existing control Lyapunov functions and related stabilization theorems. As a special class of GCLFs, we also study periodic control Lyapunov functions (PCLFs) whose value decreases periodically instead of at each time step as in the classical control Lyapunov functions. The PCLF is a GCLF with a single node and a self-loop. Using PCLFs, we develop stabilizability and control design conditions for SLSs and CSLSs. The PCLF approach is less conservative than existing results in that they apply to a larger class of SLSs and CSLSs. Computational algorithms are developed to find GCLFs/PCLFs and check stabilizability of SLSs (CSLSs).

ISBN: 9780355258196Subjects--Topical Terms:

649834
Electrical engineering.

Graph Control Lypaunov Function for Switched Linear Systems.
LDR:02656nmm a2200313 4500 001 2156161
005 20180517123956.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9780355258196
035 $a (MiAaPQ)AAI10607880
035 $a (MiAaPQ)purdue:21767
035 $a AAI10607880
040 $a MiAaPQ $c MiAaPQ
100 1 $a Lee, Donghwan. $3 3343928
245 1 0 $a Graph Control Lypaunov Function for Switched Linear Systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 127 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.
500 $a Adviser: Jianghai Hu.
502 $a Thesis (Ph.D.)--Purdue University, 2017.
520 $a The goal of this thesis is to study stabilization of discrete-time switched linear systems (SLSs) and controlled switched linear systems (CSLSs). To analyze stabilizability of SLSs and CSLSs, we introduce the notion of graph control Lyapunov functions (GCLFs), which is a graph theoretic approach to standard Lyapunov theorems. The GCLF is a set of Lyapunov functions which satisfy Lyapunov inequalities associated with a weighted directed graph (digraph). Each Lyapunov function represents each node in the digraph, and each Lyapunov inequality represents a subgraph consisting of edges connecting a node and its out-neighbors (directed rooted tree). The weight of each directed edge indicates the decay or growth rate of the Lyapunov functions from the tail to the head of the edge. It is proved that a SLS is switching stabilizable if and only if there exists a GCLF. The GCLF is an extension of recently developed graph Lyapunov functions for stability of SLSs under arbitrary switchings to stabilization of SLS under controlled switchings. We prove that GCLFs unify several existing control Lyapunov functions and related stabilization theorems. As a special class of GCLFs, we also study periodic control Lyapunov functions (PCLFs) whose value decreases periodically instead of at each time step as in the classical control Lyapunov functions. The PCLF is a GCLF with a single node and a self-loop. Using PCLFs, we develop stabilizability and control design conditions for SLSs and CSLSs. The PCLF approach is less conservative than existing results in that they apply to a larger class of SLSs and CSLSs. Computational algorithms are developed to find GCLFs/PCLFs and check stabilizability of SLSs (CSLSs).
590 $a School code: 0183.
650 4 $a Electrical engineering. $3 649834
650 4 $a Industrial engineering. $3 526216
650 4 $a Systems science. $3 3168411
690 $a 0544
690 $a 0546
690 $a 0790
710 2 $a Purdue University. $b Electrical and Computer Engineering. $3 1018497
773 0 $t Dissertation Abstracts International $g 79-02B(E).
790 $a 0183
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10607880