Set operations and order reductions for constrained zonotopes

نویسندگان

چکیده

This paper presents methods for using zonotopes and constrained to improve the practicality of a wide variety set-based operations commonly used in control theory. The proposed extend use represent sets resulting from including halfspace intersections, convex hulls, robust positively invariant , Pontryagin differences. Order reduction techniques are also presented that provide lower-complexity inner-approximations zonotopes. Numerical examples demonstrate efficacy computational advantages zonotope-based set representations dynamic system analysis control.

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

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

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

منابع مشابه

Partial order reductions for checking

The paper deals with veriication of untimed branching time properties of Time Petri Nets. The atomic variant of the geometric region method for preserving properties of CTL and ACTL is improved. Then, it is shown, for the rst time, how to apply the partial order reduction method to deal with next-time free branching properties of Time Petri Nets. The above two results are combined ooering an ee...

متن کامل

Flexible constrained de Finetti reductions and applications

De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only a matrix inequality between the symmetric state and one of de Finetti form) is enough, and that it leads to more concise and elegant arguments. Here we show...

متن کامل

Partial Order Reductions

Streszczenie Problem eksplozji stann ow mo_ ze zosta c ograniczony poprzez u_ zycie redukcji cz , e sciowo-porz , adkowych. Metody te polegaj , a na budowaniu tylko frag-mentu pee lnej przestrzeni stann ow programu, ktt ory jest wystarczaj , acy do wery-kacji formuu l logik temporalnych LTL ?X lub CTL ?X (tzn. LTL lub CTL* bez operatora nast , epnego kroku). Jest to zagwarantowane poprzez za-ch...

متن کامل

Contingency constrained operations

This paper develops a new approach to an old and difficult problem: how to make and update plans for correcting a given set of contingencies. The approach is to decompose the problem into a set of loosely coupled, much smaller problems that can be solved by a team of cooperating agents. The team is expandable and its agents are autonomous, work in parallel, and communicate asynchronously. Most ...

متن کامل

Static Partial Order Reductions for Probabilistic Systems

The present Master’s thesis seeks the development and analysis of static partial order reduction techniques for the models of probabilistic systems. The properties of those systems can be verified via model checking technique. Model checking suffers from the problem known as State Space Explosion, which can make the verification process intractable. Partial order reductions are aimed at allevia...

متن کامل

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


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

ژورنال

عنوان ژورنال: Automatica

سال: 2022

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2022.110204