ترغب بنشر مسار تعليمي؟ اضغط هنا

Controlled invariant sets: implicit closed-form representations and applications

79   0   0.0 ( 0 )
 نشر من قبل Tzanis Anevlavis
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this paper we revisit the problem of computing robust controlled invariant sets for discrete-time linear systems. The key idea is that by considering controllers that exhibit eventually periodic behavior, we obtain a closed-form expression for an implicit representation of a robust controlled invariant set in the space of states and finite input sequences. Due to the derived closed-form expression, our method is suitable for high dimensional systems. Optionally, one obtains an explicit robust controlled invariant set by projecting the implicit representation to the original state space. The proposed method is complete in the absence of disturbances, with a weak completeness result established when disturbances are present. Moreover, we show that a specific controller choice yields a hierarchy of robust controlled invariant sets. To validate the proposed method, we present thorough case studies illustrating that in safety-critical scenarios the implicit representation suffices in place of the explicit invariant set.



قيم البحث

اقرأ أيضاً

This paper proposes a tractable family of remainder-form mixed-monotone decomposition functions that are useful for over-approximating the image set of nonlinear mappings in reachability and estimation problems. In particular, our approach applies to a new class of nonsmooth nonlinear systems that we call either-sided locally Lipschitz (ELLC) systems, which we show to be a superset of locally Lipschitz continuous systems, thus expanding the set of systems that are formally known to be mixed-monotone. In addition, we derive lower and upper bounds for the over-approximation error and show that the lower bound is achievable with our proposed approach. Moreover, we develop a set inversion algorithm that along with the proposed decomposition functions, can be used for constrained reachability analysis and interval observer design for continuous and discrete-time systems with bounded noise.
This work addresses the problem of estimating the region of attraction (RA) of equilibrium points of nonlinear dynamical systems. The estimates we provide are given by positively invariant sets which are not necessarily defined by level sets of a Lya punov function. Moreover, we present conditions for the existence of Lyapunov functions linked to the positively invariant set formulation we propose. Connections to fundamental results on estimates of the RA are presented and support the search of Lyapunov functions of a rational nature. We then restrict our attention to systems governed by polynomial vector fields and provide an algorithm that is guaranteed to enlarge the estimate of the RA at each iteration.
64 - Weiwei Hu , Jun Liu , Zhu Wang 2021
This paper is concerned with a bilinear control problem for enhancing convection-cooling via an incompressible velocity field. Both optimal open-loop control and closed-loop feedback control designs are addressed. First and second order optimality co nditions for characterizing the optimal solution are discussed. In particular, the method of instantaneous control is applied to establish the feedback laws. Moreover, the construction of feedback laws is also investigated by directly utilizing the optimality system with appropriate numerical discretization schemes. Computationally, it is much easier to implement the closed-loop feedback control than the optimal open-loop control, as the latter requires to solve the state equations forward in time, coupled with the adjoint equations backward in time together with a nonlinear optimality condition. Rigorous analysis and numerical experiments are presented to demonstrate our ideas and validate the efficacy of the control designs.
We develop a data-driven approach to the computation of a-posteriori feasibility certificates to the solution sets of variational inequalities affected by uncertainty. Specifically, we focus on instances of variational inequalities with a determinist ic mapping and an uncertain feasibility set, and represent uncertainty by means of scenarios. Building upon recent advances in the scenario approach literature, we quantify the robustness properties of the entire set of solutions of a variational inequality, with feasibility set constructed using the scenario approach, against a new unseen realization of the uncertainty. Our results extend existing results that typically impose an assumption that the solution set is a singleton and require certain non-degeneracy properties, and thereby offer probabilistic feasibility guarantees to any feasible solution. We show that assessing the violation probability of an entire set of solutions, rather than of a singleton, requires enumeration of the support constraints that shape this set. Additionally, we propose a general procedure to enumerate the support constraints that does not require a closed form description of the solution set, which is unlikely to be available. We show that robust game theory problems can be modelling via uncertain variational inequalities, and illustrate our theoretical results through extensive numerical simulations on a case study involving an electric vehicle charging coordination problem.
Semidefinite and sum-of-squares (SOS) optimization are fundamental computational tools in many areas, including linear and nonlinear systems theory. However, the scale of problems that can be addressed reliably and efficiently is still limited. In th is paper, we introduce a new notion of emph{block factor-width-two matrices} and build a new hierarchy of inner and outer approximations of the cone of positive semidefinite (PSD) matrices. This notion is a block extension of the standard factor-width-two matrices, and allows for an improved inner-approximation of the PSD cone. In the context of SOS optimization, this leads to a block extension of the emph{scaled diagonally dominant sum-of-squares (SDSOS)} polynomials. By varying a matrix partition, the notion of block factor-width-two matrices can balance a trade-off between the computation scalability and solution quality for solving semidefinite and SOS optimization. Numerical experiments on large-scale instances confirm our theoretical findings.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا