Tractable higher-order under-approximating AE extensions for non-linear systems
نویسندگان
چکیده
We consider the problem of under and over-approximating image general vector-valued functions over bounded sets, apply proposed solution to estimation reachable sets uncertain non-linear discrete-time dynamical systems. Such a combination over-approximations is very valuable for verification properties controlled Over-approximations prove correct, while under-approximations can be used falsification. Coupled, they provide measure conservatism analysis. This work introduces framework relying on approximations robust ranges functions, formulated as AE extensions, that interpreted quantified propositions where universal quantifiers (A) precede existential (E). allows us extend under-approximation many precision refinements are classically over-approximations, such affine approximations, Taylor models, quadrature formulae preconditioning methods. end by evaluating efficiency our approach, focusing application analysis
منابع مشابه
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولApproximating the Number of Linear Extensions
We approximate the number of linear extensions of an ordered set by counting “critical” suborders.
متن کاملTractable model checking for fragments of higher-order coalition logic
A number of popular logical formalisms for representing and reasoning about the abilities of teams or coalitions of agents have been proposed beginning with the Coalition Logic (CL) of Pauly. Ågotnes et al introduced a means of succinctly expressing quantification over coalitions without compromising the computational complexity of model checking in CL by introducing Quantified Coalition Logic ...
متن کاملApproximating Higher-Order Distances Using Random Projections
We provide a simple method and relevant theoretical analysis for efficiently estimating higherorder lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6, 8, 10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, storing, computing, and retrieving the distances can be both space and time pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2021
ISSN: ['2405-8963', '2405-8971']
DOI: https://doi.org/10.1016/j.ifacol.2021.08.504