اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Design of Structured Stabilizers for LTI Systems
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Designing a static state-feedback controller subject to structural constraint achieving asymptotic stability is a relevant problem with many applications, including network decentralized control, coordinated control, and sparse feedback design. Leveraging on the Projection Lemma, this work presents a new solution to a class of state-feedback control problems, in which the controller is constrained to belong to a given linear space. We show through extensive discussion and numerical examples that our approach leads to several advantages with respect to existing methods: first, it is computationally efficient; second, it is less conservative than previous methods, since it relaxes the requirement of restricting the Lyapunov matrix to a block-diagonal form.
قيم البحث
اقرأ أيضاً
The identification of structured state-space model has been intensively studied for a long time but still has not been adequately addressed. The main challenge is that the involved estimation problem is a non-convex (or bilinear) optimization problem
. This paper is devoted to developing an identification method which aims to find the global optimal solution under mild computational burden. Key to the developed identification algorithm is to transform a bilinear estimation to a rank constrained optimization problem and further a difference of convex programming (DCP) problem. The initial condition for the DCP problem is obtained by solving its convex part of the optimization problem which happens to be a nuclear norm regularized optimization problem. Since the nuclear norm regularized optimization is the closest convex form of the low-rank constrained estimation problem, the obtained initial condition is always of high quality which provides the DCP problem a good starting point. The DCP problem is then solved by the sequential convex programming method. Finally, numerical examples are included to show the effectiveness of the developed identification algorithm.
This paper deals with the fault detection and isolation (FDI) problem for linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. In this paper, we follow a geometric approach to verify solvability
of the FDI problem for such systems. To do so, we first develop a necessary and sufficient condition under which the FDI problem for a given particular linear time-invariant system is solvable. Next, we establish a necessary condition for solvability of the FDI problem for linear structured systems. In addition, we develop a sufficient algebraic condition for solvability of the FDI problem in terms of a rank test on an associated pattern matrix. To illustrate that this condition is not necessary, we provide a counterexample in which the FDI problem is solvable while the condition is not satisfied. Finally, we develop a graph-theoretic condition for the full rank property of a given pattern matrix, which leads to a graph-theoretic condition for solvability of the FDI problem.
This paper investigates the H2 and H-infinity suboptimal distributed filtering problems for continuous time linear systems. Consider a linear system monitored by a number of filters, where each of the filters receives only part of the measured output
of the system. Each filter can communicate with the other filters according to an a priori given strongly connected weighted directed graph. The aim is to design filter gains that guarantee the H2 or H-infinity norm of the transfer matrix from the disturbance input to the output estimation error to be smaller than an a priori given upper bound, while all local filters reconstruct the full system state asymptotically. We provide a centralized design method for obtaining such H2 and H-infinity suboptimal distributed filters. The proposed design method is illustrated by a simulation example.
Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of matrix va
riables and the number of constraints increases. To improve scalability, SDPs can be approximated with lower and upper bounds through the use of structured subsets (e.g., diagonally-dominant and scaled-diagonally dominant matrices). Meanwhile, any underlying sparsity or symmetry structure may be leveraged to form an equivalent SDP with smaller positive semidefinite constraints. In this paper, we present a notion of decomposed structured subsets}to approximate an SDP with structured subsets after an equivalent conversion. The lower/upper bounds found by approximation after conversion become tighter than the bounds obtained by approximating the original SDP directly. We apply decomposed structured subsets to semidefinite and sum-of-squares optimization problems with examples of H-infinity norm estimation and constrained polynomial optimization. An existing basis pursuit method is adapted into this framework to iteratively refine bounds.
Atangana and Baleanu proposed a new fractional derivative with non-local and no-singular Mittag-Leffler kernel to solve some problems proposed by researchers in the field of fractional calculus. This new derivative is better to describe essential asp
ects of non-local dynamical systems. We present some results regarding Lyapunov stability theory, particularly the Lyapunov Direct Method for fractional-order systems modeled with Atangana-Baleanu derivatives and some significant inequalities that help to develop the theoretical analysis. As applications in control theory, some algorithms of state estimation are proposed for linear and nonlinear fractional-order systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
