Polyhedral approximation method for reachable sets of linear delay systems

2020 ◽  
Vol 14 (12) ◽  
pp. 1548-1556
Author(s):  
Renhong Hu ◽  
Lizhen Shao ◽  
Yuhao Cong
Keyword(s):  
Approximation Method ◽  
Reachable Sets ◽  
Delay Systems ◽  
Polyhedral Approximation ◽  
Linear Delay

scholarly journals Complete Controllability Conditions for Linear Singularly Perturbed Time-Invariant Systems with Multiple Delays via Chang-Type Transformation

Axioms ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 71 ◽  
Author(s):  
Olga Tsekhan
Keyword(s):  
Sufficient Conditions ◽  
Singularly Perturbed ◽  
Degenerate System ◽  
Multiple Delays ◽  
Complete Controllability ◽  
Singularly Perturbed System ◽  
System With Delay ◽  
Perturbed System ◽  
Time Invariant ◽  
Controllability Conditions

The problem of complete controllability of a linear time-invariant singularly-perturbed system with multiple commensurate non-small delays in the slow state variables is considered. An approach to the time-scale separation of the original singularly-perturbed system by means of Chang-type non-degenerate transformation, generalized for the system with delay, is used. Sufficient conditions for complete controllability of the singularly-perturbed system with delay are obtained. The conditions do not depend on a singularity parameter and are valid for all its sufficiently small values. The conditions have a parametric rank form and are expressed in terms of the controllability conditions of two systems of a lower dimension than the original one: the degenerate system and the boundary layer system.

scholarly journals Reachable sets for a 3D accidentally symmetric molecule

2020 ◽  
Vol 53 (2) ◽  
pp. 1943-1948
Author(s):  
U. Boscain ◽  
E. Pozzoli ◽  
M. Sigalotti
Keyword(s):  
Reachable Sets ◽  
Symmetric Molecule

Asymptotics for Shapes of Singularly Perturbed Reachable Sets *

2010 ◽  
Vol 43 (14) ◽  
pp. 1391-1393
Author(s):  
Elena Goncharova ◽  
Alexander Ovseevich
Keyword(s):  
Singularly Perturbed ◽  
Reachable Sets

Mining k-reachable sets in real-world networks using domination in shortcut graphs

2017 ◽  
Vol 22 ◽  
pp. 1-14 ◽  
Author(s):  
David Chalupa ◽  
Christian Blum
Keyword(s):  
Real World ◽  
Reachable Sets
Sign in / Sign up

Export Citation Format

Share Document