Search results for "Bounded"
showing 10 items of 658 documents
Adaptive consensus of uncertain nonlinear systems with event triggered communication and intermittent actuator faults
2019
This paper investigates distributed consensus tracking problem for uncertain nonlinear systems with event-triggered communication. The common desired trajectory information and each subsystem's state will be broadcast to their linked subsystems only when predefined triggering conditions are satisfied. Compared with the existing related literature, the main features of the results presented in this paper include four folds. (i) A totally distributed adaptive control scheme is developed for multiple nonlinear systems without Lipschitz condition, while with parametric uncertainties. (ii) The derivative of desired trajectory function is allowed unknown by all subsystems and directed communicati…
Event-triggered robust adaptive control for discrete time uncertain systems with unmodelled dynamics and disturbances
2019
In practice, modelling errors caused by high-order unmodelled dynamics and external disturbances are unavoidable. How to ensure the robustness of an adaptive controller with respect to such modelling errors is always a critical concern. In this study, the authors consider the design of event-triggered robust adaptive control for a class of discrete-time uncertain systems which involve such modelling errors and also are allowed to be non-minimum phase. Unlike some existing event-triggered control schemes, the developed controllers do not require that the measurement errors meet the corresponding input-to-state stable condition. Global stability of the closed-loop system which means that all …
Density Flow in Dynamical Networks via Mean-Field Games
2016
Current distributed routing control algorithms for dynamic networks model networks using the time evolution of density at network edges, while the routing control algorithm ensures edge density to converge to a Wardrop equilibrium, which was characterized by an equal traffic density on all used paths. We rearrange the density model to recast the problem within the framework of mean-field games. In doing that, we illustrate an extended state-space solution approach and we study the stochastic case where the density evolution is driven by a Brownian motion. Further, we investigate the case where the density evolution is perturbed by a bounded adversarial disturbance. For both the stochastic a…
On stability and robustness of Virtual Torsion Sensor (VTS) for flexible joint robots
2016
The so called ‘Virtual Torsion Sensor’ (VTS) has been introduced in pervious works for flexible joint robots without sensing of the joint output states, i.e. link position and velocity. Since VTS is incorporated into the feedback control loop, so as to improve the links' positioning accuracy, the related stability is crucial for the overall control design and robust operation of VTS. In this paper, we analyze the stability of including VTS into the feedback loop while assuming the predicted joint torsion is gained by the proportional term of the underlying motor position feedback control. We start our consideration by an ideal case of the linear joint stiffness, first assuming the measured …
Darboux integrable system with a triple point and pseudo-abelian integrals
2016
We study pseudo-abelian integrals associated with polynomial perturbations of Dar-boux integrable system with a triple point. Under some assumptions we prove the local boundedness of the number of their zeros. Assuming that this is the only non-genericity, we prove that the number of zeros of the corresponding pseudo-abelian integrals is bounded uniformly for nearby Darboux integrable foliations.
New results on stability analysis and stabilization of time-delay continuous Markovian jump systems with partially known rates matrix
2015
Summary In this note, the problems of stability analysis and controller synthesis of Markovian jump systems with time-varying delay and partially known transition rates are investigated via an input–output approach. First, the system under consideration is transformed into an interconnected system, and new results on stochastic scaled small-gain condition for stochastic interconnected systems are established, which are crucial for the problems considered in this paper. Based on the system transformation and the stochastic scaled small-gain theorem, stochastic stability of the original system is examined via the stochastic version of the bounded realness of the transformed forward system. Th…
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
2018
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a node- and edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-matching problem. We show that the problem is NP-complete, even on graphs that are stars. As a positive result, we give an algorithm which is polynomial if both rules and query graph have bounded degree and bounded cut size. We demonstrate that molecular graphs of practically relevant molecules in d…