Minimum-order filter design for partial state estimation of linear systems with multiple time-varying state delays and unknown input delays

Designing delay-dependent functional observers for LTI systems with multiple known time-varying state delays and unknown time-varying input delays is studied. The input delays are arbitrary, but the state delays should be upper-bounded. In addition, two scenarios of slow-varying and fast-varying state delays are investigated. The results of the paper can also be considered as one of the first contributions considering unknown-input functional observer design for linear systems with multiple time-varying state delays. Based on the Lyapunov Krasovskii approach, delay-dependent sufficient conditions of the exponential stability of the observer in each scenario are established in terms of linear matrix inequalities. Because of using effective techniques, such as the descriptor transformation and an advanced weighted integral inequality, the proposed stability criteria can result in larger stability regions compared with the other papers that study functional observers for time-varying delay systems. Furthermore, to help with the design procedure, a genetic algorithm-based scheme is proposed to adjust a weighting matrix in the established linear matrix inequalities. Two numerical examples illustrate the design procedure and demonstrate the efficacy of the proposed observer in each scenario.

Stability of two-dimensional Roesser systems with time-varying delays via novel 2D finitesum inequalities

This study considers the problem of stability analysis of discrete-time two-dimensional (2D) Roesser systems with interval time-varying delays. New 2D finite-sum inequalities, which provide a tighter lower bound than the existing ones based on 2D Jensen-type inequalities, are first developed. Based on an improved Lyapunov-Krasovskii functional, the newly derived inequalities are then utilised to establish delay-range-dependent linear matrix inequality-based stability conditions for a class of discrete time-delay 2D systems. The effectiveness of the obtained results is demonstrated by numerical examples.

Reachable sets bounding for generalized neural networks with interval time-varying delay and bounded disturbances

This paper deals with the problem of finding outer bound of forwards reachable sets and interbound of backwards reachable sets of generalized neural network systems with interval nondifferentiable time-varying delay and bounded disturbances. Based on constructing a suitable Lyapunov–Krasovskii functional and utilizing some improved Jensen integral-based inequalities, two sufficient conditions are derived for the existence of: (1) the smallest possible outer bound of forwards reachable sets and (2) the largest possible interbound of backwards reachable sets. These conditions are delay dependent and in the form of matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. Three numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Variable step-size LMS algorithm with a quotient form

An improved robust variable step-size least mean square (LMS) algorithm is developed in this paper. Unlike many existing approaches, we adjust the variable step-size using a quotient form of filtered versions of the quadratic error. The filtered estimates of the error are based on exponential windows, applying different decaying factors for the estimations in the numerator and denominator. The new algorithm, called more robust variable step-size (MRVSS), is able to reduce the sensitivity to the power of the measurement noise, and improve the steady-state performance for comparable transient behavior, with negligible increase in the computational cost. The mean convergence, the steady-state performance and the mean step-size behavior of the MRVSS algorithm are studied under a slow time-varying system model, which can be served as guidelines for the design of MRVSS algorithm in practical applications. Simulation results are demonstrated to corroborate the analytic results, and to compare MRVSS with the existing representative approaches. Superior properties of the MRVSS algorithm are indicated.

The development of a generic framework for the implementation of a cheap, component-based virtual video-conferencing system

We address the problem of virtual-videoconferencing. The proposed solution is effected in terms of a generic framework based on an in-house Virtual Reality system. The framework is composed of a number of distinct components: model acquisition, head tracking, expression analysis, network transmission and avatar reconstruction. The framework promises to provide a unique, cheap, and fast system for avatar construction, transmission and animation. This approach affords a conversion from the traditional video stream approach to the management of an avatar remotely and consequently makes minimal demands on network resources.

A dynamic time warped clustering technique for discrete event simulation-based system analysis

Abstract This paper introduces a novel approach for discrete event simulation output analysis. The approach combines dynamic time warping and clustering to enable the identification of system behaviours contributing to overall system performance, by linking the clustering cases to specific causal events within the system. Simulation model event logs have been analysed to group entity flows based on the path taken and travel time through the system. The proposed approach is investigated for a discrete event simulation of an international airport baggage handling system. Results show that the method is able to automatically identify key factors that influence the overall dwell time of system entities, such as bags that fail primary screening. The novel analysis methodology provides insight into system performance, beyond that achievable through traditional analysis techniques. This technique also has potential application to agent-based modelling paradigms and also business event logs traditionally studied using process mining techniques.

On backwards and forwards reachable sets bounding for perturbed time-delay systems

Linear systems with interval time-varying delay and unknown-but-bounded disturbances are considered in this paper. We study the problem of finding outer bound of forwards reachable sets and inter bound of backwards reachable sets of the system. Firstly, two definitions on forwards and backwards reachable sets, where initial state vectors are not necessary to be equal to zero, are introduced. Then, by using the Lyapunov-Krasovskii method, two sufficient conditions for the existence of: (i) the smallest possible outer bound of forwards reachable sets; and (ii) the largest possible inter bound of backwards reachable sets, are derived. These conditions are presented in terms of linear matrix inequalities with two parameters need to tuned, which therefore can be efficiently solved by combining existing convex optimization algorithms with a two-dimensional search method to obtain optimal bounds. Lastly, the obtained results are illustrated by four numerical examples.

An LMI-based functional estimation scheme of large-scale time-delay systems with strong interconnections

In this paper, the problem of distributed functional state observer design for a class of large-scale interconnected systems in the presence of heterogeneous time-varying delays in the interconnections and the local state vectors is considered. The resulting observer scheme is suitable for strongly coupled subsystems with multiple time-varying delays, and is shown to give better results for systems with very strong interconnections while only some mild existence conditions are imposed. A set of existence conditions are derived along with a computationally simple observer constructive procedure. Based on the Lyapunov-Krasovskii functional method (LKF) in the framework of linear matrix inequalities (LMIs), delay-dependent conditions are derived to obtain the observer parameters ensuring the exponential convergence of the observer error dynamics. The effectiveness of the obtained results is illustrated and tested through a numerical example of a three-area interconnected system.

Componentwise ultimate bounds for positive discrete time-delay systems perturbed by interval disturbances

This paper presents a method to derive componentwise ultimate upper bounds and componentwise ultimate lower bounds for linear positive systems with time-varying delays and bounded disturbances. The disturbance vector is assumed to vary within a known interval whose lower bound may be different from zero. We first derive a sufficient condition for the existence of componentwise ultimate bounds. This condition is given in terms of the spectral radius of the system matrices which is easy to check and allows us to compute directly both the smallest componentwise ultimate upper bound and the largest componentwise ultimate lower bound. Then, by using the comparison method, we extend the obtained result to a class of nonlinear time-delay systems which has linear positive bounds. Two numerical examples are given to illustrate the effectiveness of the obtained results.

An explicit criterion for finite-time stability of linear nonautonomous systems with delays

In this paper, the problem of finite-time stability of linear nonautonomous systems with time-varying delays is considered. Using a novel approach based on some techniques developed for linear positive systems, we derive new explicit conditions in terms of matrix inequalities ensuring that the state trajectories of the system do not exceed a certain threshold over a pre-specified finite time interval. These conditions are shown to be relaxed for the Lyapunov asymptotic stability. A numerical example is given to illustrate the effectiveness of the obtained result.

Static output feedback frequency stabilization of time-delay power systems with coordinated electric vehicles state of charge control

In this paper, for the first time, electric vehicles are used for both the primary and secondary frequency controls to support power plants to rapidly suppress fluctuations in the system frequency due to load disturbances. Via networked control and wide-area communication infrastructures, multiple interval time-varying delays exist in the communication channels between the control center, power plant, and an aggregation of electric vehicles. By coordinating batteries’ state of charge control, the behaviors of the vehicle owners and the uncertainties imposed by the changes of the batteries’ state of charge are taken intoconsideration. A power system model incorporating multiple time-varying delays and uncertainties is first proposed. Then, a robust static output feedback frequency controller is designed to guarantee the resulting closed-loop system stable with an H∞ attenuation level. By utilizing a novel integral inequality, namely refined-Jensen inequality, and an improved reciprocally convex combination, the design conditions are formulated in terms of tractable linear matrix inequalities which can be efficiently solved by various computational tools. The effectiveness of the proposed control scheme is verified by extensive simulations.

Joint space-time trellis decoding and channel estimation in correlated fading channels

This letter addresses the issue of joint space-time trellis decoding and channel estimation in time-varying fading channels that are spatially and temporally correlated. A recursive space-time receiver which incorporates per-survivor processing (PSP) and Kalman filtering into the Viterbi algorithm is proposed. This approach generalizes existing work to the correlated fading channel case. The channel time-evolution is modeled by a multichannel autoregressive process, and a bank of Kalman filters is used to track the channel variations. Computer simulation results show that a performance close to the maximum likelihood receiver with perfect channel state information (CSI) can be obtained. The effects of the spatial correlation on the performance of a receiver that assumes independent fading channels are examined.

State and input simultaneous estimation for a class of time-delay systems with uncertainties

This brief addresses the problem of estimation of both the states and the unknown inputs of a class of systems that are subject to a time-varying delay in their state variables, to an unknown input, and also to an additive uncertain, nonlinear disturbance. Conditions are derived for the solvability of the design matrices of a reduced-order observer for state and input estimation, and for the stability of its dynamics. To improve computational efficiency, a delay-dependent asymptotic stability condition is then developed using the linear matrix inequality formulation. A design procedure is proposed and illustrated by a numerical example.

A low-order linear functional observer for time delay systems

This paper presents an efficient technique to design low order state function observers for linear time-delay systems. Assuming the existence of a linear state feedback controller to achieve stability or some control performance criteria of the time-delay system, a design procedure is proposed for
reconstruction of the state feedback control action. The procedure involves solving an optimisation problem with the objective to generate a matrix that is as close as possible to the given feedback gain of the required feedback controller. A condition for robust stability of the time-delay system using the observer-based control scheme is given. The attractive features of the proposed design procedure are that the resulted linear functional state observer is of a very low order and it requires information of a small number of outputs. Numerical examples are given to demonstrate the design procedure and its merits.

On the discrete time dynamics of a self-stabilizing MCA learning algorithm

The stability of minor component analysis (MCA) learning algorithms is an important problem in many signal processing applications. In this paper, we propose an effective MCA learning algorithm that can offer better stability. The dynamics of the proposed algorithm are analyzed via a corresponding deterministic discrete time (DDT) system. It is proven that if the learning rate satisfies some mild conditions, almost all trajectories of the DDT system starting from points in an invariant set are bounded, and will converge to the minor component of the autocorrelation matrix of the input data. Simulation results will be furnished to illustrate the theoretical results achieved.