A delay-dependent functional observer for linear time-invariant systems with input delay

A delay-dependent functional observer is designed for linear time-invariant (LTI) systems with time-varying input delay. Compared to delay-free observers, delay-dependent functional observers are less conservative and cover more systems. The designed functional observer is with minimum possible order (minimal). Necessary and sufficient conditions of the existence of the observer and asymptomatic stability of it are illustrated. The proposed observer is extended to multiple input delayed systems with time-varying delays. An algorithm is developed for designing of the minimal order observer based on the methodology of this paper. Two numerical examples and simulations are used to support our proposed methodology.

Method for computing state transformations of time-delay systems

This study provides a systematic method for deriving state transformations of a class of time-delay systems with multiple output. The significance of this study is that such state transformations can be used to transform timedelay systems into new coordinates where all the time-delay terms in the system description are associated with the output and input only. Therefore, in the new coordinate system, a Luenberger-type state observer can be readily designed. Subsequently, of the three possible versions of the original state vector, namely, instantaneous, delayed, and a mixed of instantaneous and delayed, a state observer which estimates one of these versions can be obtained. This new finding allows the authors to design state observers for a wider class of time-delay systems. Conditions for the existence of such coordinate changes and an effective algorithm for computing them are provided in this study. A numerical example and simulation results are given to illustrate the simplicity and effectiveness of the proposed method.

Refined Jensen-based inequality approach to stability analysis of time-delay systems

© 2015 The Institution of Engineering and Technology. In this study, the authors derive some new refined Jensen-based inequalities, which encompass both the Jensen inequality and its most recent improvement based on the Wirtinger integral inequality. The potential capability of this approach is demonstrated through applications to stability analysis of time-delay systems. More precisely, by using the newly derived inequalities, they establish new stability criteria for two classes of time-delay systems, namely discrete and distributed constant delays systems and interval time-varying delay systems. The resulting stability conditions are derived in terms of linear matrix inequalities, which can be efficiently solved by various convex optimisation algorithms. Numerical examples are given to show the effectiveness and least conservativeness of the results obtained in this study.

Linear functional observers with guaranteed ε-convergence for discrete time-delay systems with input/output disturbances

The problem of designing linear functional observers for discrete time-delay systems with unknown-but-bounded disturbances in both the plant and the output is considered for the first time in this paper. A novel approach to design a minimum-order observer is proposed to guarantee that the observer error is ϵ-convergent, which means that the estimate converges robustly within an ϵ-bound of the true state. Conditions for the existence of this observer are first derived. Then, by utilising an extended Lyapunov-Krasovskii functional and the free-weighting matrix technique, a sufficient condition for ϵ-convergence of the observer error system is given. This condition is presented in terms of linear matrix inequalities with two parameters needed to be tuned, so that it can be efficiently solved by incorporating a two-dimensional search method into convex optimisation algorithms to obtain the smallest possible value for ϵ. Three numerical examples, including the well-known single-link flexible joint robotic system, are given to illustrate the feasibility and effectiveness of our results.

Stochastic stability of nonlinear discrete-time Markovian jump systems with time-varying delay and partially unknown transition rates

This paper is concerned with stochastic stability of a class of nonlinear discrete-time Markovian jump systems with interval time-varying delay and partially unknown transition probabilities. A new weighted summation inequality is first derived. We then employ the newly derived inequality to establish delay-dependent conditions which guarantee the stochastic stability of the system. These conditions are derived in terms of tractable matrix inequalities which can be computationally solved by various convex optimized algorithms. Numerical examples are provided to illustrate the effectiveness of the obtained results.

A new physarum network based genetic algorithm for bandwidth-delay constrained least-cost multicast routing

Bandwidth-delay constrained least-cost multicast routing is a typical NP-complete problem. Although some swarm-based intelligent algorithms (e.g., genetic algorithm (GA)) are proposed to solve this problem, the shortcomings of local search affect the computational effectiveness. Taking the ability of building a robust network of Physarum network model (PN), a new hybrid algorithm, Physarum network-based genetic algorithm (named as PNGA), is proposed in this paper. In PNGA, an updating strategy based on PN is used for improving the crossover operator of traditional GA, in which the same parts of parent chromosomes are reserved and the new offspring by the Physarum network model is generated. In order to estimate the effectiveness of our proposed optimized strategy, some typical genetic algorithms and the proposed PNGA are compared for solving multicast routing. The experiments show that PNGA has more efficient than original GA. More importantly, the PNGA is more robustness that is very important for solving the multicast routing problem.

Inter-cycle variability of ignition delay in an ethanol fumigated common rail diesel engine

An experimental study has been performed to investigate the ignition delay of a modern heavy-duty common-rail diesel engine run with fumigated ethanol substitutions up to 40% on an energy basis. The ignition delay was determined through the use of statistical modelling in a Bayesian framework this framework allows for the accurate determination of the start of combustion from single consecutive cycles and does not require any differentiation of the in-cylinder pressure signal. At full load the ignition delay has been shown to decrease with increasing ethanol substitutions and evidence of combustion with high ethanol substitutions prior to diesel injection have also been shown experimentally and by modelling. Whereas, at half load increasing ethanol substitutions have increased the ignition delay. A threshold absolute air to fuel ratio (mole basis) of above ~110 for consistent operation has been determined from the inter-cycle variability of the ignition delay, a result that agrees well with previous research of other in-cylinder parameters and further highlights the correlation between the air to fuel ratio and inter-cycle variability. Numerical modelling to investigate the sensitivity of ethanol combustion has also been performed. It has been shown that ethanol combustion is sensitive to the initial air temperature around the feasible operating conditions of the engine. Moreover, a negative temperature coefficient region of approximately 900{1050 K (the approximate temperature at fuel injection) has been shown with for n-heptane and n-heptane/ethanol blends in the numerical modelling. A consequence of this is that the dominate effect influencing the ignition delay under increasing ethanol substitutions may rather be from an increase in chemical reactions and not from in-cylinder temperature. Further investigation revealed that the chemical reactions at low ethanol substitutions are different compared to the high (> 20%) ethanol substitutions.

Towards power consumption-delay tradeoff by workload allocation in cloud-fog computing

Fog computing, characterized by extending cloud computing to the edge of the network, has recently received considerable attention. The fog is not a substitute but a powerful complement to the cloud. It is worthy of studying the interplay and cooperation between the edge (fog) and the core (cloud). To address this issue, we study the tradeoff between power consumption and delay in a cloud-fog computing system. Specifically, we first mathematically formulate the workload allocation problem. After that, we develop an approximate solution to decompose the primal problem into three subproblems of corresponding subsystems, which can be independently solved. Finally, based on extensive simulations and numerical results, we show that by sacrificing modest computation resources to save communication bandwidth and reduce transmission latency, fog computing can significantly improve the performance of cloud computing.

Theoretical study of quantum capacitance and associated delay in armchair-edge graphene nanoribbons

This work presents a comprehensive investigation of the quantum capacitance and the associated effects on the carrier transit delay in armchair-edge graphene nanoribbons (A-GNRs) based on semi-analytical method. We emphasize on the realistic analysis of bandgap with taking edge effects into account by means of modified tight binding (TB) model. The results show that the edge effects have significant influence in defining the bandgap which is a necessary input in the accurate analyses of capacitance. The quantum capacitance is discussed in both nondegenerate (low gate voltage) and degenerate (high gate voltage) regimes. We observe that the classical capacitance limits the total gate (external) capacitance in the degenerate regime, whereas, quantum capacitance limits the external gate capacitance in the nondegenerate regime. The influence of gate capacitances on the gate delay is studied extensively to demonstrate the optimization of switching time. Moreover, the high-field behavior of a GNR is studied in the degenerate and nondegenerate regimes. We find that a smaller intrinsic capacitance appears in the channel due to high velocity carrier, which limits the quantum capacitance and thus limit the gate delay. Such detail analysis of GNRs considering a realistic model would be useful for the optimized design of GNR-based nanoelectronic devices.

Functional observer-based fault detection of time-delay systems via an LMI approach

This paper presents a novel residual generator that uses minimum-order functional observers to trigger actuator and component faults in time-delay systems. We first present a fault detection scheme and derive existence conditions of the residual generator and functional observer. The observer and residual parameters are then systematically determined via solving some coupled generalized Sylvester matrix equations. To deal with the time-delay issue, a stabilizability condition expressed in terms of linear matrix inequality (LMI) is derived to ensure the time-delay observer error system converges to zero with a prescribed convergence rate. Our design approach has the advantage that the designed fault detection scheme has lower order than existing results in the literature. Two numerical examples are given to illustrate the effectiveness of our results.

Unknown input observer design for one-sided Lipschitz discrete-time systems subject to time-delay

In this paper, we address the problem of unknown input observer design, which simultaneously estimates state and unknown input, of a class of nonlinear discrete-time systems with time-delay. A novel approach to the state estimation problem of nonlinear systems where the nonlinearities satisfy the one-sided Lipschitz and quadratically inner-bounded conditions is proposed. This approach also allows us to reconstruct the unknown inputs of the systems. The nonlinear system is first transformed to a new system which can be decomposed into unknown-input-free and unknown-input-dependent subsystems. The estimation problem is then reduced to designing observer for the unknown-input-free subsystem. Rather than full-order observer design, in this paper, we propose observer design of reduced-order which is more practical and cost effective. By utilizing several mathematical techniques, the time-delay issue as well as the bilinear terms, which often emerge when designing observers for nonlinear discrete-time systems, are handled and less conservative observer synthesis conditions are derived in the linear matrix inequalities form. Two numerical examples are given to show the efficiency and high performance of our results.

Reachable sets bounding for switched systems with time-varying delay and bounded disturbances

In this paper, we address the problem of finding outer bound of forward reachable sets and inter-bound of backward reachable sets of switched systems with an interval time-varying delay and bounded disturbances. By constructing a flexible Lyapunov–Krasovskii functional combining with some recent refined integral-based inequalities, some sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter-bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Two numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Non-linear observer design for a class of singular time-delay systems with Lipschitz non-linearities

In this paper, we consider a class of time-delay singular systems with Lipschitz non-linearities. A method of designing full-order observers for the systems is presented which can handle non-linearities with large-Lipschitz constants. The Lipschitz conditions are reformulated into linear parameter varying systems, then the Lyapunov–Krasovskii approach and the convexity principle are applied to study stability of the new systems. Furthermore, the observers design does not require the assumption of regularity for singular systems. In case the systems are non-singular, a reduced-order observers design is proposed instead. In both cases, synthesis conditions for the observers designs are derived in terms of linear matrix inequalities which can be solved efficiently by numerical methods. The efficiency of the obtained results is illustrated by two numerical examples.