نتایج جستجو برای: reachable set analysis
تعداد نتایج: 3307769 فیلتر نتایج به سال:
Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some fundamental cases such systems can be reduced to Quantized Control System of type x = x+u, where the u takes values in a set of 2m + 1 integer numbers, symmetric with respect to 0. In this paper we consider this type systems and an...
The reachable set bounding estimation for distributed delay systems with disturbances is a new problem. In this paper,we consider this problem subject to not only time varying delay and polytopic uncertainties but also distributed delay systems which is not studied fully untill now. we can obtain improved non-ellipsoidal reachable set estimation for neural networks with time-varying delay by th...
Nowadays, quantum systems have become one of the focuses of the ongoing research and they are typical complex systems, whose state variables are defined on the complex field. In this paper, the issue of reachability and observability is addressed for a class of linear impulsive systems on complex field, for simplicity, complex linear impulsive systems. This kind of time-driven impulsive systems...
Current symbolic techniques for the automated reasoning over undecidable hybrid automata, force one to choose between the refinement of either an overapproximation or an underapproximation of the set of reachable states. When the analysis of branching time temporal properties is considered, the literature has developed a number of abstractions techniques based on the simulation preorder, that a...
This paper considers the problem of computing the state reachable points, from the origin, of a linear constant coefficient first or higher order descriptor system. A method is proposed that allows to compute the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system within the behavioral framework followed by a projection that se...
In this work, the issue of estimation reachable sets in continuous bimodal piecewise affine systems is studied. A new method proposed, framework ellipsoidal bounding, using quadratic Lyapunov functions. Although can be seen as a special class hybrid systems, reachability methods developed for might inappropriately complex dynamics. This work goes direction exploiting dynamical structure system ...
This work presents a method of efficiently computing inner and outer approximations forward reachable sets for nonlinear control systems with changed dynamics authority, given an priori computed set the nominal system. The functions by shrinking or inflating precomputed based on prior knowledge system's trajectory deviation growth dynamics, depending whether approximation is desired. These dete...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید