scholarly journals Polytopic Approximations of Reachable Sets Applied to Linear Dynamic Games and a Class of Nonlinear Systems

2006 ◽  
pp. 3-19 ◽  
Author(s):  
Inseok Hwang ◽  
Dušan M. Stipanović ◽  
Claire J. Tomlin
Keyword(s):  
Nonlinear Systems ◽  
Dynamic Games ◽  
Reachable Sets ◽  
Linear Dynamic

scholarly journals Estimation of Nonlinear Systems Parameters

2020 ◽  
Vol 9 (1) ◽  
pp. 26
Author(s):  
Mohamed Benyassi ◽  
A. Brouri
Keyword(s):  
Nonlinear Systems ◽  
Dead Zone ◽  
Suggested Approach ◽  
Practical Applications ◽  
Linear Dynamic ◽  
Wiener Systems ◽  
Linear Subsystem ◽  
Linear And Nonlinear ◽  
Dynamic Element ◽  
Hard Type

In this paper, an identification method is proposed to determine the nonlinear systems parameters. The proposed nonlinear systems can be described by Wiener systems. This structure of models consists of series of linear dynamic element and a nonlinearity block. Both the linear and nonlinear parts are nonparametric. In particular, the linear subsystem of structure entirely unknown. The considered nonlinearity function is of hard type. This latter can have a dead zone or with preload. These nonlinear systems have been confirmed by several practical applications. The suggested approach involves easily generated excitation signals.

Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets

Automatica ◽  
2006 ◽  
Vol 42 (10) ◽  
pp. 1745-1751 ◽  
Author(s):  
J.M. Bravo ◽  
T. Alamo ◽  
E.F. Camacho
Keyword(s):  
Nonlinear Systems ◽  
Discrete Time ◽  
Reachable Sets

scholarly journals Kaa: A Python Implementation of Reachable Set Computation Using Bernstein Polynomials

10.29007/rs5n ◽  
2020 ◽  
Author(s):  
Edward Kim ◽  
Parasara Sridhar Duggirala
Keyword(s):  
User Interface ◽  
Dynamical Systems ◽  
Nonlinear Systems ◽  
Bernstein Polynomials ◽  
Reachable Set ◽  
Reachable Sets ◽  
Safety Properties ◽  
User Friendliness ◽  
The Many ◽  
Discrete Nonlinear Systems

Reachable set computation is one of the many widely-used techniques for the verification of safety properties of dynamical systems. One of the simplest algorithms for computing reachable sets for discrete nonlinear systems uses parallelotope bundles and Bernstein polynomials. In this paper, we describe Kaa, a terse Python implementation of reachable set computation which leverages the widely used symbolic package sympy. Additionally, we simplify the user interface and provide easy-to-use plotting utilities. We believe that our tool has pedagogical value given the simplicity of the implementation and its user- friendliness.

Linear dynamic games with polytope strategy sets

2017 ◽  
Vol 11 (13) ◽  
pp. 2146-2151 ◽  
Author(s):  
Yuhu Wu ◽  
Mitsuru Toyoda ◽  
Tielong Shen
Keyword(s):  
Dynamic Games ◽  
Linear Dynamic
Sign in / Sign up

Export Citation Format

Share Document