Robust H-infinity sliding mode control for nonlinear stochastic systems with multiple data packet losses

This is the post-print version of this Article. The official published version can be accessed from the link below - Copyright @ 2012 John Wiley & SonsIn this paper, an ∞ sliding mode control (SMC) problem is studied for a class of discrete-time nonlinear stochastic systems with multiple data packet losses. The phenomenon of data packet losses, which is assumed to occur in a random way, is taken into consideration in the process of data transmission through both the state-feedback loop and the measurement output. The probability for the data packet loss for each individual state variable is governed by a corresponding individual random variable satisfying a certain probabilistic distribution over the interval [0 1]. The discrete-time system considered is also subject to norm-bounded parameter uncertainties and external nonlinear disturbances, which enter the system state equation in both matched and unmatched ways. A novel stochastic discrete-time switching function is proposed to facilitate the sliding mode controller design. Sufficient conditions are derived by means of the linear matrix inequality (LMI) approach. It is shown that the system dynamics in the specified sliding surface is exponentially stable in the mean square with a prescribed ∞ noise attenuation level if an LMI with an equality constraint is feasible. A discrete-time SMC controller is designed capable of guaranteeing the discrete-time sliding mode reaching condition of the specified sliding surface with probability 1. Finally, a simulation example is given to show the effectiveness of the proposed method.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National Natural Science Foundation of China under Grant 61028008 and the Alexander von Humboldt Foundation of German

Observer-based robust adaptive control for uncertain stochastic Hamiltonian systems with state and input delays

This paper investigates the observer-based robust adaptive control problem for a class of stochastic Hamiltonian systems. The systems under consideration relate to parameter uncertainties, unknown state time-delay and input delay. The purpose is to design a delay-dependent observer-based adaptive control law such that for all admissible uncertainties, as well as stochasticity, the closed-loop error system is robustly asymptotically stable in the mean square. Several sufficient conditions are presented to ensure the rationality and validity of the proposed control laws and observers, which are derived based on Lyapunov functional method. Numerical simulations spell out to illustrate the effectiveness of the proposed theories

Adaptive performance optimization for large-scale traffic control systems

In this paper, we study the problem of optimizing (fine-tuning) the design parameters of large-scale traffic control systems that are composed of distinct and mutually interacting modules. This problem usually requires a considerable amount of human effort and time to devote to the successful deployment and operation of traffic control systems due to the lack of an automated well-established systematic approach. We investigate the adaptive fine-tuning algorithm for determining the set of design parameters of two distinct mutually interacting modules of the traffic-responsive urban control (TUC) strategy, i.e., split and cycle, for the large-scale urban road network of the city of Chania, Greece. Simulation results are presented, demonstrating that the network performance in terms of the daily mean speed, which is attained by the proposed adaptive optimization methodology, is significantly better than the original TUC system in the case in which the aforementioned design parameters are manually fine-tuned to virtual perfection by the system operators

Finite-time Anti-synchronization of Memristive Stochastic BAM Neural Networks with Probabilistic Time-varying Delays

This paper investigates the drive-response finite-time anti-synchronization for memristive bidirectional associative memory neural networks (MBAMNNs). Firstly, a class of MBAMNNs with mixed probabilistic time-varying delays and stochastic perturbations is first formulated and analyzed in this paper. Secondly, an nonlinear control law is constructed and utilized to guarantee drive-response finite-time anti-synchronization of the neural networks. Thirdly, by employing some inequality technique and constructing an appropriate Lyapunov function, some anti-synchronization criteria are derived. Finally, a number simulation is provided to demonstrate the effectiveness of the proposed mechanism

Comparative evaluation of approaches in T.4.1-4.3 and working definition of adaptive module

The goal of this deliverable is two-fold: (1) to present and compare different approaches towards learning and encoding movements us- ing dynamical systems that have been developed by the AMARSi partners (in the past during the first 6 months of the project), and (2) to analyze their suitability to be used as adaptive modules, i.e. as building blocks for the complete architecture that will be devel- oped in the project. The document presents a total of eight approaches, in two groups: modules for discrete movements (i.e. with a clear goal where the movement stops) and for rhythmic movements (i.e. which exhibit periodicity). The basic formulation of each approach is presented together with some illustrative simulation results. Key character- istics such as the type of dynamical behavior, learning algorithm, generalization properties, stability analysis are then discussed for each approach. We then make a comparative analysis of the different approaches by comparing these characteristics and discussing their suitability for the AMARSi project

Resilient Observer Design for Discrete-Time Nonlinear Systems with General Criteria

A class of discrete-time nonlinear system and measurement equations having incrementally conic nonlinearities and finite energy disturbances is considered. A linear matrix inequality based resilient observer design approach is presented to guarantee the satisfaction of a variety of performance criteria ranging from simple estimation error boundedness to dissipativity in the presence of bounded perturbations on the gain. Some simulation examples are included to illustrate the proposed design methodology

Stability analysis for stochastic Cohen-Grossberg neural networks with mixed time delays

Copyright [2006] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this letter, the global asymptotic stability analysis problem is considered for a class of stochastic Cohen-Grossberg neural networks with mixed time delays, which consist of both the discrete and distributed time delays. Based on an Lyapunov-Krasovskii functional and the stochastic stability analysis theory, a linear matrix inequality (LMI) approach is developed to derive several sufficient conditions guaranteeing the global asymptotic convergence of the equilibrium point in the mean square. It is shown that the addressed stochastic Cohen-Grossberg neural networks with mixed delays are globally asymptotically stable in the mean square if two LMIs are feasible, where the feasibility of LMIs can be readily checked by the Matlab LMI toolbox. It is also pointed out that the main results comprise some existing results as special cases. A numerical example is given to demonstrate the usefulness of the proposed global stability criteria

Performance-based control system design automation via evolutionary computing

This paper develops an evolutionary algorithm (EA) based methodology for computer-aided control system design (CACSD) automation in both the time and frequency domains under performance satisfactions. The approach is automated by efficient evolution from plant step response data, bypassing the system identification or linearization stage as required by conventional designs. Intelligently guided by the evolutionary optimization, control engineers are able to obtain a near-optimal ‘‘off-thecomputer’’ controller by feeding the developed CACSD system with plant I/O data and customer specifications without the need of a differentiable performance index. A speedup of near-linear pipelineability is also observed for the EA parallelism implemented on a network of transputers of Parsytec SuperCluster. Validation results against linear and nonlinear physical plants are convincing, with good closed-loop performance and robustness in the presence of practical constraints and perturbations