相关论文: Automatic Generation of Bounds for Polynomial Syst…

In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…

Linear dynamical systems are the foundational statistical model upon which control theory is built. Both the celebrated Kalman filter and the linear quadratic regulator require knowledge of the system dynamics to provide analytic…

A dynamical system may be defined by a simple transition law - such as a map or a vector field. The objective of most learning techniques is to reconstruct this dynamic transition law. This is a major shortcoming, as most dynamic properties…

Estimation of solution norms and stability for time-dependent nonlinear systems is ubiquitous in numerous applied and control problems. Yet, practically valuable results are rare in this area. This paper develops a novel approach, which…

This technical note studies Lyapunov-like conditions to ensure a class of dynamical systems to exhibit predefined-time stability. The origin of a dynamical system is predefined-time stable if it is fixed-time stable and an upper bound of…

We study dynamical systems forced by a combination of random and deterministic noise and provide criteria, in terms of Lyapunov exponents, for the existence of random attractors with continuous structure in the fibres. For this purpose, we…

In the stability theory of dynamical systems, Lyapunov functions play a fundamental role. In this paper, we study the attractor-repeller pair decomposition and Morse decomposition for compact metric space in the random setting. In contrast…

A new method based on the phenomenon of synchronization and the properties of chaos is proposed to reduce interference in the transferred chaotic signals of synchronized systems. In this paper, the interference is considered as a series of…

We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…

While a previously proposed method for estimating inertial manifold dimension, based on explicitly computing angles between pairs of covariant Lyapunov vectors (CLVs), employs efficient algorithms, it remains computationally demanding due…

Automatically generating invariants, key to computer-aided analysis of probabilistic and deterministic programs and compiler optimisation, is a challenging open problem. Whilst the problem is in general undecidable, the goal is settled for…

The collision of a fixed point with a switching manifold (or border) in a piecewise-smooth map can create many different types of invariant sets. This paper explores two techniques that, combined, establish a chaotic attractor is created in…

Many nonlinear dynamical systems can be written as Lure systems, which are described by a linear time-invariant system interconnected with a diagonal static sector-bounded nonlinearity. Sufficient conditions are derived for the global…

Approximating regions of attraction in nonlinear systems require extensive computational and analytical efforts. In this paper, nonlinear vector fields are recasted as sum of vectors where each individual vector is used to construct an…

We present a computational method for finding attractors (ergodic sets of states) of Boolean networks under asynchronous update. The approach is based on a systematic removal of state transitions to render the state transition graph…

We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input…

We introduce the notion of Lyapunov exponents for random dynamical systems, conditioned to trajectories that stay within a bounded domain for asymptotically long times. This is motivated by the desire to characterize local dynamical…

This paper presents a funnel synthesis algorithm for computing controlled invariant sets and feedback control gains around a given nominal trajectory for dynamical systems with locally Lipschitz nonlinearities and bounded disturbances. The…

In this letter we synthesize numerically the L\"{u} attractor starting from the generalized Lorenz and Chen systems, by switching the control parameter inside a chosen finite set of values on every successive adjacent finite time intervals.…

In the sequential decision making setting, an agent aims to achieve systematic generalization over a large, possibly infinite, set of environments. Such environments are modeled as discrete Markov decision processes with both states and…