Computing Probabilistic Controlled Invariant Sets

نویسندگان

چکیده

This article investigates stochastic invariance for control systems through probabilistic controlled invariant sets (PCISs). As a natural complement to robust (RCISs), we propose finite-, and infinite-horizon PCISs, explore their relation RICSs. We design iterative algorithms compute the PCIS within given set. For with discrete spaces, computations of PCISs at each iteration are based on linear programming, mixed integer respectively. The computationally tractable, terminate in finite number steps. continuous show how discretize prove convergence approximation when computing finite-horizon PCISs. In addition, it is shown that an can be computed by backward reachable set from RCIS contained it. These applicable practical systems. Simulations illustrate effectiveness theoretical results motion planning.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Invariant Sets

Robin de Vilder would like to dedicate this paper to the loving memory of his wife Annemiek. Abstract We describe algorithms for computing hyperbolic invariant sets of diieomorphisms and their stable and unstable manifolds. This includes the calculation of Smale horseshoes and the stable and unstable manifolds of periodic points in any nite dimension.

متن کامل

On invariant sets topology

In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...

متن کامل

Computing control invariant sets is easy

In this paper we consider the problem of computing control invariant sets for linear controlled systems with constraints on the input and on the states. We focus in particular on the complexity of the computation of the N-step operator, given by the Minkowski addition of sets, that is the basis of many of the iterative procedures for obtaining control invariant sets. Set inclusions conditions f...

متن کامل

Almost-invariant sets and invariant manifolds – connecting probabilistic and geometric descriptions of coherent structures in flows

We study the transport and mixing properties of flows in a variety of settings, connecting the classical geometrical approach via invariant manifolds with a probabilistic approach via transfer operators. For non-divergent fluid-like flows, we demonstrate that eigenvectors of numerical transfer operators efficiently decompose the domain into invariant regions. For dissipative chaotic flows such ...

متن کامل

Controlled Invariant Polyhedral Sets for Constrained Discrete-Time Descriptor Systems

This paper addresses the problem of constructing controlled invariant polyhedral sets for linear discrete-time descriptor systems subject to state and control constraints and persistent disturbances. Regardless the large number of contributions on set invariance for linear systems in the standard form, there are few works dealing with set invariance properties in the case of descriptor systems....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2020.3018438