File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

postgraduate thesis: Estimation and synthesis of reachable set for discrete systems with switching characteristics

TitleEstimation and synthesis of reachable set for discrete systems with switching characteristics
Authors
Issue Date2016
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
Citation
Chen, Y. [陈勇]. (2016). Estimation and synthesis of reachable set for discrete systems with switching characteristics. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR.
AbstractThis thesis is concerned with the problems of reachable set estimation and synthesis for a class of dynamic systems with switching characteristics. In terms of estimation of the reachable set, some ellipsoids and hyperpyramids are utilized to bounded the reachable set of systems with switching characteristics. Specifically, the following four types of systems are exploited: (1) For generally switched systems under arbitrarily switching signal, the reachable set bounding conditions which determine the bounding ellipsoids are derived by using a Lypunov-based inequality and the quadratic S-procedure. Usually, the bounding ellipsoids are expected to be as small as possible, three optimization approaches are developed to minimize the bounded ellipsoids. In addition, Genetic Algorithm (GA) is used to search for the optimal value of the decision variables in the obtained reachable set estimation conditions. (2) For general switched systems under periodically switching signal (also termed as periodic systems in the thesis), the lifting approach and the pseudo-periodic Lyapunov function approach are utilized to determine the bounding ellipsoids for the reachable set. GA is adopted in the pseudo-periodic Lyapunov function approach to search for the optimal value of the decision variables. (3) For switched positive systems under arbitrarily switching signal, the reachable set bounding conditions which determine the bounding hyper-pyramids are derived by utilizing two Lyapunov-based inequalities and the S-procedure technique. The bounding hyper-pyramids are minimized through two optimization methods. (4) For switched positive systems under periodically switching signal (also termed as periodic positive systems in the thesis), the lifting approach and the pseudo-periodic co-positive Lyapunov function approach are used to determine the bounding hyper-pyramids for the reachable set. In terms of synthesis of the reachable set, the control objective is to manipulate the reachable set of closed-loop system to lie within a given region or to make the reachable set as small as possible. Based on the reachable set estimation results, sufficient conditions are established for the existence of the desired state-feedback controllers. GA is used to search for the optimal state-feedback controller that makes the reachable set of closed-loop system as small as possible.
DegreeDoctor of Philosophy
SubjectControl theory
Dynamic programming
Dept/ProgramMechanical Engineering
Persistent Identifierhttp://hdl.handle.net/10722/227943
HKU Library Item IDb5774081

 

DC FieldValueLanguage
dc.contributor.authorChen, Yong-
dc.contributor.author陈勇-
dc.date.accessioned2016-07-26T23:17:43Z-
dc.date.available2016-07-26T23:17:43Z-
dc.date.issued2016-
dc.identifier.citationChen, Y. [陈勇]. (2016). Estimation and synthesis of reachable set for discrete systems with switching characteristics. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR.-
dc.identifier.urihttp://hdl.handle.net/10722/227943-
dc.description.abstractThis thesis is concerned with the problems of reachable set estimation and synthesis for a class of dynamic systems with switching characteristics. In terms of estimation of the reachable set, some ellipsoids and hyperpyramids are utilized to bounded the reachable set of systems with switching characteristics. Specifically, the following four types of systems are exploited: (1) For generally switched systems under arbitrarily switching signal, the reachable set bounding conditions which determine the bounding ellipsoids are derived by using a Lypunov-based inequality and the quadratic S-procedure. Usually, the bounding ellipsoids are expected to be as small as possible, three optimization approaches are developed to minimize the bounded ellipsoids. In addition, Genetic Algorithm (GA) is used to search for the optimal value of the decision variables in the obtained reachable set estimation conditions. (2) For general switched systems under periodically switching signal (also termed as periodic systems in the thesis), the lifting approach and the pseudo-periodic Lyapunov function approach are utilized to determine the bounding ellipsoids for the reachable set. GA is adopted in the pseudo-periodic Lyapunov function approach to search for the optimal value of the decision variables. (3) For switched positive systems under arbitrarily switching signal, the reachable set bounding conditions which determine the bounding hyper-pyramids are derived by utilizing two Lyapunov-based inequalities and the S-procedure technique. The bounding hyper-pyramids are minimized through two optimization methods. (4) For switched positive systems under periodically switching signal (also termed as periodic positive systems in the thesis), the lifting approach and the pseudo-periodic co-positive Lyapunov function approach are used to determine the bounding hyper-pyramids for the reachable set. In terms of synthesis of the reachable set, the control objective is to manipulate the reachable set of closed-loop system to lie within a given region or to make the reachable set as small as possible. Based on the reachable set estimation results, sufficient conditions are established for the existence of the desired state-feedback controllers. GA is used to search for the optimal state-feedback controller that makes the reachable set of closed-loop system as small as possible.-
dc.languageeng-
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)-
dc.relation.ispartofHKU Theses Online (HKUTO)-
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subject.lcshControl theory-
dc.subject.lcshDynamic programming-
dc.titleEstimation and synthesis of reachable set for discrete systems with switching characteristics-
dc.typePG_Thesis-
dc.identifier.hkulb5774081-
dc.description.thesisnameDoctor of Philosophy-
dc.description.thesislevelDoctoral-
dc.description.thesisdisciplineMechanical Engineering-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.5353/th_b5774081-
dc.identifier.mmsid991020271049703414-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats