Controllability characterization of switched DAEs

We study controllability of switched differential algebraic equations (switched DAEs) with fixed switching signal. Based on a behavioral definition of controllability we are able to establish a controllability characterization that takes into account possible jumps and impulses induced by the switches. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On stability of discrete-time switched systems

This article deals with stability of discrete-time switched systems. Given a family of nonlinear systems and the admissible switches among the systems in the family, we first propose a class of switching signals under which the resulting switched system is globally asymptotically stable. We allow unstable systems in the family and our stability condition depends solely on asymptotic behaviour of the switching signals. We then discuss algorithmic construction of the above class of switching signals, and show that in the presence of exogenous inputs and outputs, a switching signal so constructed also ensures input/output-to-state stability for discrete-time switched nonlinear systems. We finally show that our class of switching signals that ensures global asymptotic stability also extends to the continuous-time setting with minor modifications under standard assumptions. We employ multiple Lyapunov-like functions and graph theoretic tools as the main apparatuses for our analysis.     

Third-order nilpotency, nice reachability and asymptotic stability

We consider an affine control system whose vector fields span a third-order nilpotent Lie algebra. We show that the reachable set at time T using measurable controls is equivalent to the reachable set at time T using piecewise-constant controls with no more than four switches. The bound on the number of switches is uniform over any final time T. As a corollary, we derive a new sufficient condition for stability of nonlinear switched systems under arbitrary switching. This provides a partial solution to an open problem posed in [D. Liberzon, Lie algebras and stability of switched nonlinear systems, in: V. Blondel, A. Megretski (Eds.), Unsolved Problems in Mathematical Systems and Control Theory, Princeton Univ. Press, 2004, pp. 203-207].     

Optimal Control for Switched Systems with Pre-defined Order and Switch-Dependent Dynamics

The optimal control problem for switched systems, with a predefined order of switches, is considered. The differential equations may depend explicitly on previous switching instants, and the latter may be state dependent. The solution is based on the Calculus-of-Variations, which leads to a single two-point boundary-value problem. A new condition for the Hamiltonian jump at the switching instants is obtained. Simple numerical examples demonstrate the results.     

Distributed adaptive switching consensus control of heterogeneous multi-agent systems with switched leader dynamics

In this paper, the leader-following distributed consensus control problem is addressed for general linear multi-agent systems with heterogeneous uncertain agent dynamics and switched leader dynamics. Different from most existing results with a single linear time-invariant (LTI) leader dynamics, the leader dynamics under consideration is composed by a family of LTI models and a switching logic governing the switches among them, which is capable of generating more diverse and sophisticated reference signals to accommodate more complicated consensus control design tasks. A novel distributed adaptive switching consensus protocol is developed by incorporating the model reference adaptive control mechanism and arbitrary switching control technique, which can be synthesized by following a two-layer hierarchical design scheme. A numerical example has been used to demonstrate the effectiveness of the proposed approach.     

Switching Stability of Automotive Roll Dynamics Subject to Interval Uncertainty

In this paper we apply some recent results on the stability of switched systems with interval uncertainty for analyzing the roll stability of automotive vehicles subject to bounded parametric uncertainties and switching. The application is motivated by the fact that the roll dynamics of an automotive vehicle is affected in a significant and a nonlinear fashion due to possible sudden switches in the vehicle's center of gravity (CG) height, as well as the uncertainty in the suspension parameters. Utilizing a recent stability result, it is possible to model such parametric variations as bounded interval uncertainties for this problem, and obtain easily verifiable conditions for analyzing the stability of the resulting switched/uncertain system. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

切换系统的全局指数稳定性

提出了一种确定切换系统稳定性分析的方法.引入了两个相关的实例(非完整系统和约束摆)进行说明.用有限个模型的集合组成非线性模型,且切换序列可以是任意的.假定在切换瞬间状态不出现跳跃,并且不出现Zeno现象,即在每个有界时间段上,切换次数是有限的.在对所确定切换系统的分析中,应用了多次Liapunov函数,并证明了全局指数稳定性.系统的指数稳定性平衡关系到实际应用,因为这样的系统有着更强健的抗干扰能力.     

Switched control of a nonholonomic mobile robot

We present a switched control algorithm to stabilize a car-like mobile robot which possesses velocity level nonholonomic constraint. The control approach rests on splitting the system into several second-order subsystems and then stabilizing the system sequentially using finite-time controllers, finally resulting in the mobile robot being moved from one point to another point. State dependent switching control is employed in which the controllers switches on a thin surface in the state-space. Robustness analysis is presented by redefining the switching signal using relaxed switching surface. Both, non-robust and robust controllers are validated through numerical simulation.     

Necessary and sufficient conditions for quadratic stabilizability of switched systems on non-uniform time domains

In this paper, we consider the quadratic stabilizability via state feedback for a particular class of switched systems that evolve on a non-uniform time domain by introducing time scales theory. The system considered switches between a continuous-time subsystem with variable lengths and a discrete-time subsystem with variable discrete step sizes. Necessary and sufficient conditions are derived to guarantee the quadratic stability of this class of switched systems via a switching state feedback law based on the existence of a common positive definite matrix satisfying the quadratic stabilizability condition by considering that the two subsystems are unstable. By state feedback, we mean that the switching among subsystems depends on the system states. Current results for this kind of state switching feedback control are derived only for switched systems evolving on a continuous time domain or a discrete time domain with fixed step’s size. These results are not applicable for the particular class of switched systems where there is a mixing between the continuous and discrete dynamics. This motivates the derivation of a new and more general state feedback control law for switched systems in this work. A numerical example illustrating the results is presented.     

Switching Time and Parameter Optimization in Nonlinear Switched Systems with Multiple Time-Delays

In this paper, we consider a dynamic optimization problem involving a general switched system that evolves by switching between several subsystems of nonlinear delay-differential equations. The optimization variables in this system consist of: (1) the times at which the subsystem switches occur; and (2) a set of system parameters that influence the subsystem dynamics. We first establish the existence of the partial derivatives of the system state with respect to both the switching times and the system parameters. Then, on the basis of this result, we show that the gradient of the cost function can be computed by solving the state system forward in time followed by a costate system backward in time. This gradient computation procedure can be combined with any gradient-based optimization method to determine the optimal switching times and parameters. We propose an effective optimization algorithm based on this idea. Finally, we consider three numerical examples, one involving the 1,3-propanediol fed-batch production process, to illustrate the effectiveness and applicability of the proposed algorithm.     

Reachability realization and stabilizability of switched linear discrete-time systems

In this paper, the reachability realization of a switched linear discrete-time system, which is a collection of linear time-invariant discrete-time systems along with some maps for “switching” among them, is addressed. The main contribution of this paper is to prove that for a switched linear discrete-time system, there exists a basic switching sequence such that the reachable (controllable) state set of this basic switching sequence is equal to the reachable (controllable) state set of the system. Hence, the reachability (controllability) can be realized by using only one switching sequence. We also discuss the stabilizability of switched systems, and obtain a sufficient condition for stabilizability. Two numeric examples are given to illustrate the results.     

Synchronization of uncertain hybrid switching and impulsive complex networks

This paper considers the asymptotic synchronization problem for a class of uncertain complex networks (CNs) with hybrid switching and impulsive effects. The switches and impulses occur by following a time sequence which is characterized by dwell-time constraint. By designing Lyapunov function with time-varying matrix parameter, two general synchronization criteria formulated by matrix inequalities are first given, which unify synchronizing and desynchronizing impulses. Then specific conditions in terms of linear matrix inequalities (LMIs) are given by partitioning the dwell time and using convex combination technique. Compared with those criteria which are only applicable to pure synchronizing impulses or pure desynchronizing impulses, our results are more practical. It is shown that the switched impulsive CNs (SICNs) can be synchronized by desynchronizing impulses even though CNs without impulse are unsynchronized. Numerical examples are given to show the effectiveness of our new results.     

Attractors synthesis for a Lotka-Volterra like system

The aim of this paper is to prove numerically, via computer graphic simulations, that the synthesis algorithmprovided by Danca et al. [1] can be utilized to synthesize any attractor of a dynamical system modeling a two-predator, one prey Lotka-Volterra like system. The algorithm switches in a periodic deterministic or a random way the control parameter inside a set of a chosen values. The obtained attractor is the same with the attractor obtained for parameter value taken as averaged value of the switched control values. This simple and effective algorithm relies on a convex property induced in the set of the attractors corresponding to the chosen switching parameters. The algorithm was tested successfully on systems depending linearly on the control parameter like Lorenz, Chen, Rossler, networks and other systems.     

Cycle Switches in Latin Squares

Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one class to another. Such graphs are constructed on sets of isotopy or main classes of latin squares for orders up to and including eight. Variants considered are when (i) only intercalates may be switched, (ii) any row cycle may be switched and (iii) all cycles may be switched. The structure of these graphs reveals special roles played by N₂, pan-Hamiltonian, atomic, semi-symmetric and totally symmetric latin squares. In some of the graphs parity is important because, for example, the odd latin squares may be disconnected from the even latin squares. An application of our results to the compact storage of large catalogues of latin squares is discussed. We also prove lower bounds on the number of cycles in latin squares of both even and odd orders and show these bounds are sharp for infinitely many orders.This work was undertaken while the author was employed by Christ Church, Oxford, UK     

Controlling for supplier switching in the presence of real options and asymmetric information

Applying a real option approach, this paper examines how asymmetric information alters key variables of a firm’s supplier switching process, such as the timing of contracting (hurried versus delayed contracting), transfer payments, set-up, switching, and abandonment decisions. In a symmetric information setting, delayed contracting is unambiguously beneficial. Abandoning the once established relation with the entrant supplier is never an issue. In contrast, under asymmetric information hurried contracting with potentially abandoning the relation can be beneficial. Consistent with adverse selection models, we find that under delayed contracting, in equilibrium, the firm switches less frequently to the entrant supplier (switching inertia). Surprisingly, we also find that under hurried contracting the firm switches more frequently to the entrant supplier (switching acceleration) and may abandon the relation. Finally, we study how these key variables of the supplier switching process change when also the incumbent supplier has private information (two-sided asymmetric information case).     

Applications of numerical optimal control to nonlinear hybrid systems

This paper develops a technique for numerically solving hybrid optimal control problems. The theoretical foundation of the approach is a recently developed methodology by S.C. Bengea and R.A. DeCarlo [Optimal control of switching systems, Automatica. A Journal of IFAC 41 (1) (2005) 11–27] for solving switched optimal control problems through embedding. The methodology is extended to incorporate hybrid behavior stemming from autonomous (uncontrolled) switches that results in plant equations with piecewise smooth vector fields. We demonstrate that when the system has no memory, the embedding technique can be used to reduce the hybrid optimal control problem for such systems to the traditional one. In particular, we show that the solution methodology does not require mixed integer programming (MIP) methods, but rather can utilize traditional nonlinear programming techniques such as sequential quadratic programming (SQP). By dramatically reducing the computational complexity over existing approaches, the proposed techniques make optimal control highly appealing for hybrid systems. This appeal is concretely demonstrated in an exhaustive application to a unicycle model that contains both autonomous and controlled switches; optimal and model predictive control solutions are given for two types of models using both a minimum energy and minimum time performance index. Controller performance is evaluated in the presence of a step frictional disturbance and parameter uncertainties which demonstrates the robustness of the controllers.     

Quadratic stabilization of a class of switched nonlinear systems via single Lyapunov function

This paper is concerned with the problem of globally quadratic stabilization for a class of switched cascade systems. The system under consideration is composed of two subsystems: a linear switched part and a nonlinear part, which are also switched systems. The feedback control law and the switching law are designed respectively when the first part is stabilized under some switching law and when both parts can be stabilized under some switching laws. We construct the single Lyapunov functions and design the switching laws based on the structure characteristics of the switched system. Also, the designed switching laws are of hysteresis switching form in order to avoid sliding models.     

Stability of switched systems with time delay

In this paper, we study the qualitative properties of linear and nonlinear delay switched systems which have stable and unstable subsystems. First, we prove some inequalities which lead to the switching laws that guarantee: (a) the global exponential stability to linear switched delay systems with stable and unstable subsystems; (b) the local exponential stability of nonlinear switched delay systems with stable and unstable subsystems. In addition, these switching laws indicate that if the total activation time ratio among the stable subsystems, unstable subsystems and time delay is larger than a certain number, the switched systems are exponentially stable for any switching signals under these laws. Some examples are given to illustrate the main results.     

Stabilization of switched linear systems with mode-dependent time-varying delays

In this paper, we investigate the problem of stabilization via state feedback and/or state-based switching for switched linear systems with mode-dependent time-varying delays. By using the multiple Lyapunov functional method, we establish sufficient conditions that guarantee the switched system is stabilizable via state feedback and/or switching under time-varying delays with appropriate upper bounds. The main results are presented in terms of linear matrix inequalities (LMIs) which generalize some known results and can be easily tested by using the Matlab’s LMI Tool-box.     

A randomized method for the identification of switched NARX systems

The identification of switched systems is a complex optimization problem that involves both continuous (parametrizations of the local models, a.k.a. modes) and discrete variables (model structures, switching signal). In particular, the combinatorial complexity associated with the estimation of the switching signal grows exponentially with the number of samples, which makes data segmentation (i.e. estimating the number and location of mode switchings, and the mode sequence) a challenging problem. In this work, we extend a previously developed randomized approach for the identification of switched systems to encompass the estimation of the switching locations. The method operates by extracting samples from a probability distribution of switched models, and gathering information from the associated model performances to update the distribution, until convergence to a limit distribution associated to a specific model. A suitable probability distribution is employed to represent the likelihood of a mode switching at a certain time, and the update process is designed to correct the switching locations and remove redundant switchings. The proposed algorithm has been compared to existing state-of-the-art methods and has been tested on various benchmark examples, to demonstrate its effectiveness.