Search

In this paper, we consider the event-triggered control problem for continuous-time switched linear systems. It is assumed that only the sampled information of system state and switching signal is available to the controller at each sampling instant. Based on a mode-dependent event-triggered transmission scheme, the closed-loop system is modeled as a switched system with delayed state and augmented switching signal. Then, an exponential stability condition, characterized by the dwell time and average dwell time of the switching signal, is obtained. The condition presents an extension of the multiple Lyapunov functional method based stability analysis for sampled-data control of nonswitched system. Consequently, the design methods for state-feedback controller gains and event-triggered parameters are then formulated by the properly selected quadratic Lyapunov functional. The analysis results are significant and also lead to an important step to study the event-triggered control for switched system. Finally, based on the definition of event-trigger efficiency, the effectiveness and improvement of the proposed approach are illustrated by two numerical examples. [ABSTRACT FROM AUTHOR]

This paper introduces a model for freeway traffic dynamics under stochastic capacity-reducing incidents, and provides insights for freeway incident management by analyzing long-time (stability) properties of the proposed model. Incidents on a multicell freeway are modeled by reduction in capacity at the affected freeway sections, which occur and clear according to a Markov chain. We develop conditions under which the traffic queue induced by stochastic incidents is bounded. A necessary condition is that the demand must not exceed the time-average capacity adjusted for spillback. A sufficient condition, in the form of a set of bilinear inequalities, is also established by constructing a Lyapunov function and applying the classical Foster–Lyapunov drift condition. Both conditions can be easily verified for realistic instances of the stochastic incident model. Our analysis relies on the construction of a globally attracting invariant set, and exploits the properties of the traffic flow dynamics. We use our results to analyze the impact of stochastic capacity fluctuation (frequency, intensity, and spatial correlation) on the throughput of a freeway segment. [ABSTRACT FROM AUTHOR]

This paper is concerned with a general class of distributed constrained optimization problems over a multiagent network, where the global objective function is represented by the sum of all local objective functions. Each agent in the network only knows its own local objective function, and is restricted to a global nonempty closed convex set. We discuss the scenario where the communication of the whole multiagent network is expressed as a sequence of time-varying general unbalanced directed graphs. The directed graphs are required to be uniformly jointly strongly connected and the weight matrices are only row-stochastic. To collaboratively deal with the optimization problems, existing distributed methods mostly require the communication graph to be fixed or balanced, which is impractical and hardly inevitable. In contrast, we propose a new distributed projection subgradient algorithm which is applicable to the time-varying general unbalanced directed graphs and does not need each agent to know its in-neighbors’ out-degree. When the objective functions are convex and Lipschitz continuous, it is proved that the proposed algorithm exactly converges to the optimal solution. Simulation results on a numerical experiment are shown to substantiate feasibility of the proposed algorithm and correctness of the theoretical findings. [ABSTRACT FROM AUTHOR]

This paper addresses the cooperative output regulation problem of linear multi-agent systems under switching communication topologies. A distributed event-triggered control scheme is proposed so that the cooperative output regulation problem is solved with only intermittent communication. The communication topology is not required to be connected at every time instant under the jointly connected assumption. With the proposed triggering mechanism, each agent only transmits the information to its neighbors at its own triggering times or the switching times. By introducing a fixed timer, Zeno behavior is strictly excluded for each agent. The effectiveness of the proposed control scheme is demonstrated by an example. [ABSTRACT FROM AUTHOR]

This paper generalizes the LaSalle–Yoshizawa Theorem to switched nonsmooth systems. The Filippov and Krasovskii regularizations of a switched system are shown to be contained within the convex hull of the Filippov and Krasovskii regularizations of the subsystems, respectively. A common candidate Lyapunov function that has a negative semidefinite generalized time derivative along the trajectories of the subsystems is shown to be sufficient to establish LaSalle–Yoshizawa-like results for the switched system. Of independent interest, are the results on approximate continuity and Filippov regularization of set-valued maps, reduction of differential inclusions using Lipschitz continuous regular functions, and comparative remarks on different generalizations of the time derivative along the trajectories of a nonsmooth system. [ABSTRACT FROM AUTHOR]

This paper considers a singular problem in optimal control of continuous-time bimodal switched linear systems. A relaxed switched system with a continuous-valued switching signal is considered and the representations of singular control and singular arcs are derived. The similarity in the structure between the singular control and a stabilizing switching law is revealed and an approximation of the singular control by a well-defined switching signal is addressed. The results are demonstrated by numerical simulations. [ABSTRACT FROM AUTHOR]

In this paper, the input-to-state stability is studied for stochastic impulsive switched time-delay systems. Using the vector Lyapunov function, average dwell time, and the properties of $M$ -matrix, different types of sufficient conditions are established. Both the case that the continuous dynamics is stable and the case that the discrete dynamics is stable are addressed, and the stability conditions are obtained. In the obtained stability conditions, different components of the vector Lyapunov function are allowed to be coupled; the information in consecutive impulsive switching intervals is also allowed to be coupled. Therefore, the magnification on the corresponding coupling items is avoided and the obtained results are more general and less conservative than the existing results. Furthermore, we investigate the relationships among the vector Lyapunov function approach, the approach based on the comparison principle and the scalar Lyapunov function approach. According to the vector Lyapunov function, the comparison system is constructed and the scalar-Lyapunov-function-based stability conditions are established. Finally, the applicability of our results is illustrated through two examples from neural systems and the synchronization problem of chaos-based secure communication systems. [ABSTRACT FROM AUTHOR]

This paper is concerned with studying Lyapunov characterization of integral input-to-state stability (iISS) for switched nonlinear time-varying systems. Sufficient conditions are given to verify iISS for switched nonlinear time-varying systems under a time-varying state-dependent switching law designed, which allow all subsystems to be not integral input-to-state stable (iISS) and the time derivative of Lyapunov functions of individual subsystems to be indefinite. An indefinite multiple Lyapunov functions (iMLFs) method for analyzing the dynamic behavior of switched nonlinear time-varying systems is provided. Also, an iMLFs-based small-gain theorem for switched interconnected nonlinear time-varying systems is presented, where each lower dimensional subsystem is allowed to be not iISS, which extends the small-gain technique from its original nonswitched nonlinear time-invariant version to a switched nonlinear time-varying version. Finally, an illustrative example is used to demonstrate the feasibility of the theoretical results. [ABSTRACT FROM AUTHOR]

Aggregate load modeling is of fundamental importance for systematic analysis and design of various demand response strategies. Instead of keeping track of the trajectories of individual loads, the aggregate modeling problem focuses on characterizing the density evolution of the load population. Most existing models are only applicable to thermostatically controlled loads (TCLs) with first-order linear dynamics. This paper develops a unified aggregate modeling approach that can be used for general TCLs as well as deferrable loads. We propose a deterministic hybrid system model to describe individual load dynamics under demand response rules, and develop a general stochastic hybrid system (SHS) model to capture the population dynamics. We also derive a set of partial differential equations (PDEs) that govern the probability density evolution of the SHS. Our results cannot be obtained using the existing SHS tools in the literature as the proposed SHS model involves both random and deterministic switchings with general switching surfaces in multidimensional domains. The derived PDE model includes many existing aggregate load modeling results as special cases and can be used in many other realistic modeling scenarios that have not been studied in the literature. [ABSTRACT FROM AUTHOR]

The two simplest language-based decentralized controls of discrete event systems are called conjunctive and permissive (C&P) and disjunctive and antipermissive (D&A) controls. On the other side, inference-based control is the most general language-based decentralized control. In this paper, we propose a decentralized control method, called arborescent control, which constructs and uses a tree-like control architecture that depends on the control objective. Each node $n$ of the tree is a disjunction or conjunction of the enabling/disabling decisions of the two children of $n$. We show that if inference-based control is applicable to the control objective, then every leaf of the obtained tree is a C&P or D&A control. This means that by combining adequately C&P and D&A controls, we can realize every control objective that is realizable by inference-based control. [ABSTRACT FROM AUTHOR]

This paper presents results on the solvability of the observer design problem for general nonlinear triangular systems with inputs, under weak observability assumptions. The local state estimation is exhibited by means of a delayed time-varying Luenberger-type system. In order to achieve the global estimation, a switching sequence of observers is designed. [ABSTRACT FROM AUTHOR]

This paper studies the problems of stability and stabilization for a class of singular switching semi-Markovian jump systems. The general transition rates in the semi-Markov process cover completely unknown and uncertain bounded as two special cases. First, sufficient conditions are developed to ensure the unforced system to be regular, impulse-free, and exponentially mean-square stable. Then, by proposing a state feedback controller, sufficient conditions in terms of strict linear matrix inequalities are derived to guarantee the closed-loop system to be stochastically stabilziable. Finally, a numerical example is provided to show the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic formation control problem for multi-agent systems over directed networks, in which a desired spatial shape is time-varying instead of fixed one as usually assumed in the literature. Inspired by the fact that the existing approaches, including absolute positions based, relative positions based, inter-agent distances based, and inter-agent bearings based, for specifying a formation shape are not invariant under all three transformations: translations, rotations, and scalings, a novel specification for formation shapes is proposed that is invariant under translations, rotations, and scalings in two- and three-dimensional spaces, and thus more intrinsic. In doing so, a new notion, called matrix-valued Laplacian, for graphs is introduced in detail along with some useful properties. It is demonstrated that the matrix-valued Laplacian provides much flexibility. Subsequently, two controllers are designed for guaranteeing the achievement of a dynamic formation shape. It is proved that arbitrary dynamic geometric shape can be reached by the designed controllers. Finally, two numerical examples are provided for demonstrating the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

We study feedback control for a discrete-time integrator with unitary delay in the presence of quantization both in the control action and in the measurement of the controlled variable. In some applications the quantization effects can be neglected, but when high precision is needed, they have to be explicitly accounted for in control design. In this paper, we propose a switched control solution for minimizing the effect of quantization of both the control and controlled variables for the considered system, that is quite common in the computing systems domain, for example, in thread scheduling, clock synchronization, and resource allocation. We show that the switched solution outperforms the one without switching, designed by neglecting quantization, and analyze necessary and sufficient conditions for the controlled system to exhibit periodic solutions in the presence of an additive constant disturbance affecting the control input. Simulation results provide evidence of the effectiveness of the approach. [ABSTRACT FROM AUTHOR]

Inspired by the interesting findings regarding the hierarchy and coordination of pigeons in Nagy et al.  [Nature, 2010], we revisit the discrete-time leader–follower consensus problem with switching topologies. The purpose of this paper is to investigate the impact of hierarchical topologies and followers’ self-loops on the convergence performance of leader–follower consensus, including the convergence rate and robustness to switching topologies. We first study the fixed topology case, and show that the followers converge to the leader's state in finite time if and only if each follower has no self-loops and the topology is hierarchical. However, we show via counterexample, that leader–follower consensus may not be achieved when some followers have no self-loops and the topology is switching; even if each interaction graph has a spanning tree rooted at the leader. With the aid of binary relation theory, we further develop a new approach to present a novel sufficient condition for leader–follower consensus with switching topologies and with some followers having no self-loops. We prove that when no followers have self-loops and the same hierarchical organization is kept under the switching topologies, then the fastest rate of convergence in leader–follower consensus can be achieved; even in the presence of complex dynamic topologies. This is consistent with the natural phenomena found in pigeons by Nagy et al. [ABSTRACT FROM AUTHOR]

Event-triggered control is an effective control strategy, capable of reducing the amount of communications and retaining a satisfactory closed-loop performance. In this paper, we aim at proposing an event-triggered sampling mechanism and studying observer-based output feedback control for switched linear neutral systems with mixed time-varying delays. Different from the conventional event-triggered control strategies, our proposed one transmits not only the state but also the switching information to the controller, which is advantageous in applications where the measured outputs and the switching information have to be transmitted over a communication network. Moreover, asynchronous switchings may be caused between the subsystems and their matched subcontrollers under the proposed sampling mechanism, which increases difficulties in analyzing stability. We develop a sufficient condition, under which the proposed control scheme guarantees globally the exponential stability of the closed-loop system meanwhile taking into account asynchronous switchings. Finally, an illustrative example is given to show the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The stability and stabilization problems for a class of switched discrete-time nonlinear systems are studied in this paper. Each nonlinear subsystem of the presented switched system is modeled as a piecewise affine (PWA) one by splitting the state space into polyhedron regions. With the aid of a simple searching strategy for active state transition pairs at a switching instant, i.e., the so-called $\mathbb {S}$ -arbitrary switching approach, the stability criteria are derived via the relaxed piecewise quadratic Lyapunov function technique. Then, using the descriptor system approach, a family of PWA stabilizing controllers are designed to guarantee exponential stability of the resulting closed-loop control system, and the corresponding PWA controller gains could be calculated using numerical software. The validity and potential of the developed techniques are verified through a numerical example. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study the stabilizability of controlled discrete-time switched linear systems (CSLSs), where the discrete switching control input and the continuous control input coexist. For a given positive integer $h$ , we propose a quantitative metric of stabilizability, called $h$ -contraction rate ($h$ -CR), and prove that it serves as an indicator of the stabilizability in the following sense: the $h$ -CR is less than one for sufficiently large $h$ if and only if the switched linear system is stabilizable. In addition, we develop computational tools to estimate upper and lower bounds of the $h$ -CR. In particular, the upper bound estimation is expressed as a semidefinite programming problem. We derive its Lagrangian dual problem and prove that the dual problem with an additional rank constraint gives an exact characterization of the $h$ -CR. An algorithm is developed to solve the dual problem with the rank constraint. [ABSTRACT FROM AUTHOR]

In this paper, a generalized discrete time reaching law for sliding variables with arbitrary relative degree is proposed. The reaching law is based on Gao's strategy and ensures higher order switching-type sliding motion, which is a novel concept in the field of discrete time plants. The controller synthesis process is simplified by performing a specific system state transformation. It is demonstrated that the width of the layer to which the representative point of the system is driven decreases as the relative degree of the sliding variable gets bigger. It has further been proven that achieving a narrower quasi-sliding mode band width is reflected in reduced state error. Finally, the reaching phase elimination for variables with arbitrary relative degree is considered. This is obtained by implementing a time-varying sliding surface in a finite number of initial time instants. Uniform ultimate boundedness of all state variables is guaranteed. [ABSTRACT FROM AUTHOR]

This paper is concerned with the stability problem of randomly switched systems. By using the probability analysis method, the almost surely globally asymptotical stability and almost surely exponential stability are investigated for switched systems with semi-Markovian switching, Markovian switching, and renewal process switching signals, respectively. Two examples are presented to demonstrate the effectiveness of the proposed results, in which an example of consensus of multiagent systems with nonlinear dynamics is taken into account. [ABSTRACT FROM AUTHOR]

This paper focuses on the stability analysis and control of adaptive switching systems by establishing Lyapunov-based logic switching rules. Through considering performance-index-based adaptive switching control under a general framework, sufficient conditions are proposed and proved to ensure global generalized exponential stability and global finite-time stability. By taking these conditions as guidelines for designing control laws and logic switching rules, we explore their applications in controlling a class of lower-triangular nonlinear systems with an unknown control direction. [ABSTRACT FROM AUTHOR]

This paper is concerned with dynamic output feedback control for a class of switched systems with mode-dependent average dwell-time switching. By constructing a quasi-time-dependent Lyapunov function, the issues of global uniform asymptotic stability and $\ell _{2}$ -gain analysis for the switched system are addressed first. Then, a set of reduced-order output feedback controllers is designed, which is both mode-dependent and quasi-time-dependent. Compared with time-independent criteria, the new results greatly reduce the conservatism. The effectiveness and merits of the proposed method are illustrated with a numerical example. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of secure state estimation for cyber-physical systems modeled by continuous or discrete-time linear systems when some sensors are corrupted by an attacker. A novel state observer is proposed with adaptive switching mechanism. Attack tolerance principle is established based on adaptively truncating the injection channels of attacks. To implement it, a switching function matrix is introduced into the observer design. Driven by a well-defined performance index, the switching function matrix automatically reaches and remains in the desired entry mode and turns off the input channels of attacks. Based on the equivalence between $s$ -strong detectability of the observation error system and $2s$ -sparse detectability of the original system, the observation error system is proven to be asymptotically stable even under the cyber attacks. Compared with the existing complex static batch optimization algorithms, the proposed adaptive observer can be derived only by offline solving a set of simple linear matrix inequalities. Simulation examples are given to illustrate the estimation performance and the computational efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents a fault-tolerant control scheme for constrained discrete-time linear systems against stuck actuators and bounded disturbances. The results proposed here are a significant generalization of a similar algorithm that has been designed only to manage healthy/out-of-service actuator units. A key feature of the proposed scheme consists of taking advantage of polyhedral algebra and computational geometry concepts in order to characterize the reconfiguration logic of the proposed fault-tolerant architecture. This is achieved by describing the plant via a set of a finite number of piecewise affine (PWA) systems capable to cover all the admissible faulty stuck scenarios. It is then proved that one-step sequences of controllable sets can be formally defined within a PWA system paradigm under the key property that each region is a polyhedron. [ABSTRACT FROM AUTHOR]

This note points out certain limitations of our results from the paper mentioned in the title, and provides a modified approach to overcome these limitations. Specifically, the observer design addressed in the aforementioned paper is, in general, only applicable to switched linear systems with invertible state reset maps and this note presents a modified algorithm for state estimation that can also handle non-invertible state reset maps. In the process, we also identify some equalities from that paper which may not hold in general for arbitrary state reset maps. [ABSTRACT FROM PUBLISHER]

This paper addresses the problem of modes detection for switching discrete-time linear and affine systems. A unified presentation of the model-based methods with the corresponding modes detectors is carried out and a comparative study is conducted. Next, the different notions of discernibility proposed in the literature are presented. Such notions are central since they guarantee the uniqueness of the solution delivered by the modes detectors. A complete step-by-step procedure of modes detection is proposed. The paper includes, whenever necessary, some extensions of the existing results. [ABSTRACT FROM AUTHOR]

Checking validity of a model is a crucial step in the process of system identification. This is especially true when dealing with switched affine systems since, in this case, the problem of system identification from noisy data is known to be generically NP-Hard and can only be solved in practice by using heuristics and relaxations. Therefore, before the identified models can be used for instance for controller design, they should be systematically validated against additional experimental data. In this paper we address the problem of model (in)validation for multi-input multi-output switched affine systems in output error form with unknown switches. As a first step, we prove that necessary and sufficient invalidation certificates can be obtained by solving a sequence of convex optimization problems. In principle, these problems involve increasingly large matrices. However, as we show in the paper by exploiting recent results from semialgebraic geometry, the proposed algorithm is guaranteed to stop after a finite number of steps that can be be explicitly computed from the a priori information. In addition, this algorithm exploits the sparse structure of the underlying optimization problem to substantially reduce the computational burden. The effectiveness of the proposed method is illustrated using both academic examples and a non-trivial problem arising in computer vision: activity monitoring. [ABSTRACT FROM AUTHOR]

This paper considers near-time-optimal setpoint tracking of a second-order oscillator. First, the time-optimal setpoint tracking feedback law is derived by recasting the problem as a regulator problem in the error coordinates with shifted control limits. This result is used to construct a derated approximation of the optimal control. Initially, the control law is derived as a regulator controller. This result is then extended to include setpoint tracking. Global stability is proven for the setpoint tracking controller in the zero-damping case. A scaling method is developed, which allows an efficient implementation of the control laws using a single lookup table. Both the damped and undamped controllers are validated experimentally. [ABSTRACT FROM AUTHOR]

This paper deals with the exponential stabilization problem of discrete-time Markovian jump systems via a hybrid control strategy, in which the transition probability matrix and static output-feedback controller are designed simultaneously. A necessary and sufficient condition for the existence of an exponential stabilizing transition probability matrix is derived by means of a mode-dependent parametric approach. Furthermore, a sufficient condition is established for the above-mentioned hybrid design with a specified lower bound on the decay rate. The proposed design approaches can be applied to solve two kinds of control design problems with practical constraints imposed on the hybrid design. Besides, an estimation approach is proposed on the decay rate and decay coefficient of the jump systems. Also, two optimization problems are formulated to obtain the hybrid control strategy. Finally, two numerical examples and a network-on-chip based application are provided to illustrate the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

Distributing nominal models in multiple-models applications constitutes a long standing problem. The set of models needs to be distributed in such a way that their corresponding controllers can stabilize all possible system configurations in a large uncertainty set. This paper presents a systematic solution by phrasing the distribution as coverage control problem, in which each model covers a subset of the uncertainty. The subsets are derived based on a combination of the $\nu$-gap metric, which serves as a distance measure, and the generalized stability margin. Characterizing coverage in terms of the \nu$-gap also motivates the use of \mathcal {H}_{\infty } controller synthesis to design a set of controllers. The proposed algorithms are initialized with suboptimal model configurations. Two update laws optimize the model parameters and minimize the coverage function. The first algorithm performs a gradient descent on the coverage function and the second algorithm performs pairwise optimizations. Due to computational complexity, a discretized implementation is derived, which reduces the optimization to an efficient graph search. The proposed algorithms are evaluated in numeric benchmark examples. [ABSTRACT FROM PUBLISHER]

There has been much recent interest in distributed demand response—where loads adjust in response to shortfalls (or excesses) in power supply—in order to maintain power quality, reduce dispatch costs, and even prevent or ameliorate blackouts. Some of the most promising candidates for demand response are thermal loads, such as heaters, air conditioners, and refrigeration units, which can often be switched OFF temporarily without inconveniencing the user. However, naive attempts to control such loads have experienced difficulties due to devices becoming synchronized in an undesirable way. Recent work using stochastic controls has been shown to be very promising, but still has certain practical limitations. In particular, these controls exhibit poor robustness and undesirable nominal device behavior. In this paper, we propose a novel stable closed-loop stochastic thermal controller that shows much greater robustness than the state of the art algorithm and provides nominal behavior very similar to that of ordinary hysteretic control. Our controller allows a large population of devices to react to the same demand response signal while maintaining an even distribution of device states. This allows them to act in unison to closely approximate a single deterministically controlled load. [ABSTRACT FROM PUBLISHER]

Most of the existing characterizations of the integral input-to-state stability (iISS) property are not valid for time-varying or switched systems in cases where converse Lyapunov theorems for stability are not available. This paper provides a characterization that is valid for switched and time-varying systems, and shows that natural extensions of some of the existing characterizations result in only sufficient but not necessary conditions. The results provided also pinpoint suitable iISS gains and relate these to supply functions and bounds on the function defining the system dynamics. [ABSTRACT FROM PUBLISHER]

In this paper, we study the cooperative global robust output regulation problem for nonlinear multiagent systems in output feedback form with any relative degree subject to directed switching networks. Through the augmentation by a distributed internal model and a distributed observer of the given system, we first convert the original problem into the global robust stabilization problem of the so-called extended augmented system, which is a multi-input-coupled switched system. Then, we establish a few technical lemmas to lay the foundation for constructing a switching control law and the corresponding multiple Lyapunov functions for the switched system. Then, we present the solvability conditions of our problem via the multiple Lyapunov functions and average dwell time method. The main result will be applied to the leader-following synchronization problem for a group of hyperchaotic Lorenz multiagent systems with a directed switching network. [ABSTRACT FROM PUBLISHER]

In this paper, we study geometric properties of basins of attraction of monotone systems. Our results are based on a combination of monotone systems theory and spectral operator theory. We exploit the framework of the Koopman operator, which provides a linear infinite-dimensional description of nonlinear dynamical systems and spectral operator-theoretic notions such as eigenvalues and eigenfunctions. The sublevel sets of the dominant eigenfunction form a family of nested forward-invariant sets and the basin of attraction is the largest of these sets. The boundaries of these sets, called isostables, allow studying temporal properties of the system. Our first observation is that the dominant eigenfunction is increasing in every variable in the case of monotone systems. This is a strong geometric property which simplifies the computation of isostables. We also show how variations in basins of attraction can be bounded under parametric uncertainty in the vector field of monotone systems. Finally, we study the properties of the parameter set for which a monotone system is multistable. Our results are illustrated on several systems of two to four dimensions. [ABSTRACT FROM PUBLISHER]

This paper considers the discrete-time version of Altafini's model for opinion dynamics in which the interaction among a group of agents is described by a time-varying signed digraph. Prompted by an idea from [3], exponential convergence of the system is studied using a graphical approach. Necessary and sufficient conditions for exponential convergence with respect to each possible type of limit states are provided. Specifically, under the assumption of repeatedly jointly strong connectivity, it is shown that 1) a certain type of two-clustering will be reached exponentially fast for almost all initial conditions if, and only if, the sequence of signed digraphs is repeatedly jointly structurally balanced corresponding to that type of two-clustering; 2) the system will converge to zero exponentially fast for all initial conditions if, and only if, the sequence of signed digraphs is repeatedly jointly structurally unbalanced. An upper bound on the convergence rate is provided. The results are also extended to the continuous-time Altafini model. [ABSTRACT FROM PUBLISHER]

In this paper, global adaptive finite-time stabilization is investigated by logic-based switching control for a class of uncertain nonlinear systems with the powers of positive odd rational numbers. Parametric uncertainties entering the state equations nonlinearly can be fast time-varying or jumping at unknown time instants, and the control coefficient appearing in the control channel can be unknown. The bounds of the parametric uncertainties and the unknown control coefficient are not required to know a priori. Our proposed controller is a switching-type one, in which a nonlinear controller with two parameters to be tuned is first designed by adding a power integrator, and then a switching mechanism is proposed to tune the parameters online to finite-time stabilize the system. An example is provided to demonstrate the effectiveness of the proposed result. [ABSTRACT FROM AUTHOR]

This paper tackles the controllability problem of Boolean control networks (BCNs). By resorting to the semi-tensor product technique and the Warshall algorithm, several improved novel reachability and controllability criteria are obtained for the BCNs. Through constructing a sequence of rigorous Boolean matrices, controllability matrix of the considered BCNs is derived iteratively. It is worth pointing out that the proposed method has lower computational complexity, and thus facilitates the reachability and controllability analysis for BCNs. In addition, the issue concerning controllability of BCNs with undesirable interior states is investigated by checking a set of designated Boolean matrices. Finally, to test the effectiveness of the obtained theoretical results, a genetic network model known as the $\lambda$ switch is used as an example for numerical simulation. [ABSTRACT FROM AUTHOR]

This paper addresses the output reachable set estimation problem for continuous-time switched linear systems consisting of Hurwtiz stable subsystems. Based on a common Lyapunov function approach, the output reachable set is estimated by a union of bounding ellipsoids. Then, multiple Lyapunov functions with time-scheduled structure are employed to estimate the output reachable set for switched systems under dwell-time constraint. Furthermore, the safety verification problem of uncertain switched systems is investigated based on the result of output reachable set estimation. First, a sufficient condition ensuring the existence of an approximate bisimulation relation between two switched linear systems with a prescribed precision is proposed. Then, the safety verification for an uncertain switched system can be performed through an alternative safety verification for a switched system with exact parameters. Numerical examples are provided to illustrate our results. [ABSTRACT FROM AUTHOR]

This paper introduces the notion of common zeroing-output systems (CZOS) to analyze the stability of switched systems. The concept of CZOS allows one to verify weak zero-state detectability. It characterizes a common behavior of any individual subsystem when the output signal for each subsystem is “approaching” zero. Heuristically speaking, it removes the effect of switching behavior, and thus enables one to analyze stability properties in systems with complex switching signals. With the help of CZOS, the Krasovskii–LaSalle theorem can be extended to switched nonlinear time-varying systems with both arbitrary switching and more general restricted switching cases. For switched nonlinear time-invariant systems, the needed detectability condition is further simplified, leading to several new stability results. Particularly, when a switched linear time-invariant system is considered, it is possible to generate a recursive method, which combines a Krasovskii–LaSalle result and a nested Matrosov result, to find a CZOS if it exists. The power of the proposed CZOS is demonstrated by consensus problems in literature to obtain a stronger convergence result with weaker conditions. [ABSTRACT FROM AUTHOR]

This paper studies the problem of stabilizing discrete-time switched linear control systems (SLCSs) using continuous input by a user against adversarial switching by an adversary. It is assumed that at each time the adversary knows the user's decision on the continuous input but not vice versa. A quantitative metric of stabilizability is proposed. Systems at the margin of stabilizability are further classified and studied via the notions of defectiveness and reducibility. Analytical bounds on the stabilizability metric are derived using (semi)norms, with tight bounds provided by extremal norms. Numerical algorithms are also developed for computing this metric. An application example in networked control systems is presented. [ABSTRACT FROM AUTHOR]

This paper investigates the state observer design of a class of unknown input switched linear systems via mode-dependent dwell time switchings. The distinguishing feature of the proposed method is that strong detectability condition of subsystems of the switched systems is unnecessarily required. First, a time-varying coordinate transformation is introduced to design a suitable reduced-order observer for each subsystem. Then, computable sufficient conditions on the synthesis of the observers are proposed in the framework of a mode-dependent dwell time technique. Since the observer of an individual subsystem cannot be designed due to unavailability of strong detectability condition of the subsystem, the state of the switched system is estimated under the condition of confining the dwell time by a pair of upper and lower bounds, restricting the growth of the Lyapunov function of the active subsystem and forcing “energy” of the overall switched system to decrease at switching instants. Finally, an example is presented to demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper presents some results on stability and $l_1$ gain analysis of Boolean networks with Markovian jump parameters. A necessary and sufficient condition for global stability of the concerned Boolean networks is given in terms of linear programming by utilizing the semi-tensor product of matrices and some properties of linear positive systems. Then, the definition of Lyapunov function for stochastic Boolean networks is presented and Lyapunov theorem is derived. Moreover, an $l_1$ gain problem for stochastic Boolean networks with external disturbances is formulated and solved by a sufficient condition. Examples are shown to illustrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

Multiple Lyapunov functions (MLFs)-based small-gain theorems are presented for switched interconnected nonlinear systems with unstable subsystems, which extend the small-gain technique from its original non-switched nonlinear version to a switched nonlinear version. Each low dimensional subsystem does not necessarily have the input-to-state stability (ISS) property in the whole state space, and it only has individual ISS property in some subregions of the state space. The novelty of this paper is that integral-type MLFs and small-gain techniques are utilized to establish some MLFs-based small-gain theorems for switched interconnected nonlinear systems, which derive various stability results under some novel switching laws designed and construct integral-type MLFs. The small-gain theorems proposed cover several recent results as special cases, which also permit removal of a common restriction in which all low dimensional subsystems in switched interconnected systems are ISS or only some are ISS and others are not. Finally, two illustrative examples are presented to demonstrate the effectiveness of the results provided. [ABSTRACT FROM AUTHOR]

In this paper, we address the optimal control problem for Boolean control networks (BCNs). We first consider the problem of finding the input sequences that minimize a given cost function over a finite time horizon. The problem solution is obtained by means of a recursive algorithm that represents the analogue for BCNs of the difference Riccati equation for linear systems. We prove that a significant number of optimal control problems for BCNs can be easily reframed into the present setup. In particular, the cost function can be adjusted so as to include penalties on the switchings, provided that we augment the size of the BCN state variable. In the second part of the paper, we address the infinite horizon optimal control problem and we provide necessary and sufficient conditions for the problem solvability. The solution is obtained as the limit of the solution over the finite horizon [0,T], and it is always achieved in a finite number of steps. Finally, the average cost problem over the infinite horizon, investigated in “Optimal control of logical control networks” (Y. Zhao , IEEE Trans. Autom. Control, vol 56, no. 8, pp. 1766–1776, Aug. 2011), is addressed by making use of the results obtained in the previous sections. [ABSTRACT FROM AUTHOR]

This paper analyzes the passivity and feedback passivity of discrete-time-switched nonlinear systems with passive and nonpassive modes that are affine in the control input. When a nonpassive mode is active, the increase in storage function is not necessarily bounded by the energy supplied to the switched system at every time step. Therefore, a switched system with at least one nonpassive mode is defined to be nonpassive in the classical passivity theory. In this paper, we propose a framework to analyze the passivity of such switched systems in a more general sense. We consider switched nonlinear systems which are affine in the control input and may consist of passive, feedback passive modes, and modes which cannot be rendered passive using feedback. In the proposed framework, we prove that a switched nonlinear system is locally feedback passive if and only if its zero dynamics are locally passive. A lower bound on the ratio of total activation time between (feedback) passive and nonfeedback passive modes is obtained to guarantee passive zero dynamics. Finally, we prove that two important properties of classical passivity still hold for the proposed passivity definition, that is: 1) output feedback control can be used to stabilize the switched system, and 2) parallel and negative feedback interconnections of two such passive systems are also passive. [ABSTRACT FROM AUTHOR]

In this paper, the problem of stability on stochastic systems with state-dependent switching is investigated. To analyze properties of the switched system by means of Itô's formula and Dynkin's formula, it is critical to show switching instants being stopping times. When the given active-region set can be replaced by its interior, the local solution of the switched system is constructed by defining a series of stopping times as switching instants, and the criteria on global existence and stability of solution are presented by Lyapunov approach. For the case where the active-region set can not be replaced by its interior, the switched systems do not necessarily have solutions, thereby quasi-solution to the underlying problem is constructed and the boundedness criterion is proposed. The significance of this paper is that all the results presented depend on some easily-verified assumptions that are as elegant as those in the deterministic case, and the proofs themselves provide design procedures for switching controls. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study the exponential stabilization problem for autonomous discrete-time switched linear systems (SLSs), where only the discrete mode can be controlled. Our approach is based on periodic control Lyapunov functions whose value decreases periodically instead of at each time step as in the classical control Lyapunov functions. Using periodic control Lyapunov functions, we develop stabilizability analysis and controller synthesis conditions that are less conservative than existing results in that they apply to a larger class of SLSs. Utilizing recent results on the switched optimal control problems, a constructive way to find periodic control Lyapunov functions is presented. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a new design method of discrete-valued control for continuous-time linear time-invariant systems based on sum-of-absolute-values (SOAV) optimization. We first formulate the discrete-valued control design as a finite-horizon SOAV optimal control, which is an extended version of \mathbbL^1 optimal control. We then give simple conditions that guarantee the existence, discreteness, and uniqueness of the SOAV optimal control. Also, we show that the value function is continuous, by which we prove the stability of infinite-horizon model predictive SOAV control systems. We provide a fast algorithm for the SOAV optimization based on the alternating direction method of multipliers (ADMM), which has an important advantage in real-time control computation. A simulation result shows the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper is concerned with a class of discrete-time semi-Markov jump linear systems (S-MJLSs) subject to exponentially modulated periodic (EMP) probability density function (PDF) of sojourn time, and the problems of stability and stabilization are addressed. Setting a relatively large period, the considered systems are capable of approximating the general S-MJLSs (without any requirements on sojourn-time PDFs) for which numerically testable stability and stabilization conditions are rather difficult to obtain. Necessary and sufficient criterion for mean square stability of the general S-MJLSs is first derived, which involves an infinite number of conditions and as such not checkable. However, the developments lay a foundation to further establish the numerically testable conditions for the systems when the PDF of sojourn time is EMP albeit the sojourn time can tend to infinity. The derivations explicitly depend on the PDF of sojourn time, which circumvents the difficulty in obtaining the memory transition probabilities of S-MJLSs. The adopted Lyapunov function is sojourn-time-dependent (STD), by which the existence conditions of STD controller are developed as well using certain techniques that can eliminate the terms of power of matrices in the stability conditions. Two illustrative examples including a class of population ecological systems are presented to show the validity and applicability of the developed theoretical results. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of designing time-varying quantizers for the stabilization of switched linear systems with quantized output and switching delays. The detection delays of switches are assumed to be time-varying but bounded, and the dwell time of the switching signal is assumed to be larger than the maximum delay. Given a switching controller, we analyze reachable sets of the closed-loop state by using a common Lyapunov function and then construct a quantizer that guarantees asymptotic stability. A sufficient condition for the existence of such a quantizer is characterized by the maximum switching delay and the dwell time. [ABSTRACT FROM AUTHOR]