Fault-tolerant control for a class of nonlinear sampled-data systems via a Euler approximate observer

In this paper, a fault-tolerant control (FTC) scheme is developed for a class of nonlinear sampled-data systems. First, a Euler approximate discrete model is used to describe the plant under the sampling. Under this model, an observer-based fault estimation method is proposed. To guarantee the accuracy of both the state and fault estimation values, the conditions to make the approximate model consistent with the exact model are presented. Then, an active fault-tolerant controller, which has a constraint condition for the sampling time, is designed to make the faulty system stable. Finally, an inverted pendulum is used to show the efficiency of the proposed method.     

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

Fault-tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple spanning trees with a specific property in the underlying graph of a network to serve as a broadcasting scheme or a distribution protocol for receiving high levels of fault-tolerance and of security. A set of spanning trees in a graph is said to be edge-disjoint if these trees are rooted at the same node without sharing any common edge. Hsieh and Tu [S.-Y. Hsieh, C.-J. Tu, Constructing edge-disjoint spanning trees in locally twisted cubes, Theoretical Computer Science 410 (2009) 926-932] recently presented an algorithm for constructing n edge-disjoint spanning trees in an n-dimensional locally twisted cube. In this paper, we prove that indeed all spanning trees constructed by their algorithm are independent, i.e., any two spanning trees are rooted at the same node, say r, and for any other node v≠r, the two different paths from v to r, one path in each tree, are internally node-disjoint.     

Two algorithms for minimum 2-connected r-hop dominating set

For a graph G=(V,E), a subset D⊆V is an r-hop dominating set if every vertex u∈V−D is at most r-hops away from D. It is a 2-connected r-hop dominating set if the subgraph of G induced by D is 2-connected. In this paper, we present two approximation algorithms to compute minimum 2-connected r-hop dominating set. The first one is a greedy algorithm using ear decomposition of 2-connected graphs. This algorithm is applicable to any 2-connected general graph. The second one is a three-phase algorithm which is only applicable to unit disk graphs. For both algorithms, performance ratios are given.     

Robust fault-tolerant controller design for linear time-invariant systems with actuator failures: an indirect adaptive method

In this paper, indirect adaptive state feedback control schemes are developed to solve the robust faulttolerant control (FTC) design problem of actuator fault and perturbation compensations for linear time-invariant systems. A more general and practical model of actuator faults is presented. While both eventual faults on actuators and perturbations are unknown, the adaptive schemes are addressed to estimate the lower and upper bounds of actuator-stuck faults and perturbations online, as well as to estimate control effectiveness on actuators. Thus, on the basis of the information from adaptive schemes, an adaptive robust state feed-back controller is designed to compensate the effects of faults and perturbations automatically. According to Lyapunov stability theory, it is shown that the robust adaptive closed-loop systems can be ensured to be asymptotically stable under the influence of actuator faults and bounded perturbations. An example is provided to further illustrate the fault compensation effectiveness.     

一类多输入多输出系统的冗余设计

分析了多输入多输出多变量系统在某环节失效时系统的整体性,给出了针对开环传递函数矩阵以及解耦后新对象均为本质稳定对象时系统的冗余设计方法.该方法有效解决了某环节失效后对系统稳定性的影响,实现了复杂系统的容错控制.仿真结果表明,该冗余设计方法可行,能够实现系统的容错控制.     

Robust actuator fault isolation and management in constrained uncertain parabolic PDE systems

This paper presents a methodology for the design of an integrated robust fault detection and isolation (FDI) and fault-tolerant control (FTC) architecture for distributed parameter systems modeled by nonlinear parabolic Partial Differential Equations (PDEs) with time-varying uncertain variables, actuator constraints and faults. The design is based on an approximate finite-dimensional system that captures the dominant dynamics of the PDE system. Initially, an invertible coordinate transformation-obtained through judicious actuator placement-is used to transform the approximate system into a form where the evolution of each state is excited directly by only one actuator. For each state, a robustly stabilizing bounded feedback controller that achieves an arbitrary degree of asymptotic attenuation of the effect of uncertainty is then synthesized and its constrained stability region is explicitly characterized in terms of the constraints, the actuator locations and the size of the uncertainty. A key idea in the controller synthesis is to shape the fault-free closed-loop response of each state in a prescribed fashion that facilitates the derivation of (1) dedicated FDI residuals and thresholds for each actuator, and (2) an explicit characterization of the state-space regions where FDI can be performed under uncertainty and constraints. A switching law is then derived to orchestrate actuator reconfiguration in a way that preserves robust closed-loop stability following FDI. Precise FDI rules and control reconfiguration criteria that account for model reduction errors are derived for the implementation of the FDI-FTC structure on the distributed parameter system. Finally, the results are demonstrated using a tubular reactor example.     

CoRAL: A transparent fault-tolerant web service

The Web is increasingly used for critical applications and services. We present a client-transparent mechanism, called CoRAL, that provides high reliability and availability for Web service. CoRAL provides fault tolerance even for requests being processed at the time of server failure. The scheme does not require deterministic servers and can thus handle dynamic content. CoRAL actively replicates the TCP connection state while maintaining logs of HTTP requests and replies. In the event of a primary server failure, active client connections fail over to a spare, where their processing continues seamlessly. We describe key aspects of the design and implementation as well as several performance optimizations. Measurements of system overhead, failover performance, and preliminary validation using fault injection are presented.     

Embedding fault-free cycles in crossed cubes with conditional link faults

The crossed cube, which is a variation of the hypercube, possesses some properties that are superior to those of the hypercube. In this paper, we show that with the assumption of each node incident with at least two fault-free links, an n-dimensional crossed cube with up to 2n−5 link faults can embed, with dilation one, fault-free cycles of lengths ranging from 4 to 2 ⁿ . The assumption is meaningful, for its occurrence probability is very close to 1, and the result is optimal with respect to the number of link faults tolerated. Consequently, it is very probable that algorithms executable on rings of lengths ranging from 4 to 2 ⁿ can be applied to an n-dimensional crossed cube with up to 2n−5 link faults.

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges

The k-ary n-cube has been one of the most popular interconnection networks for massively parallel systems. In this paper, we investigate the edge-bipancyclicity of k-ary n-cubes with faulty nodes and edges. It is proved that every healthy edge of the faulty k-ary n-cube with f_v faulty nodes and f_e faulty edges lies in a fault-free cycle of every even length from 4 to kⁿ − 2f_v (resp. kⁿ − f_v) if k ? 4 is even (resp. k ? 3 is odd) and f_v + f_e ? 2n − 3. The results are optimal with respect to the number of node and edge faults tolerated.     

Pancyclicity of ternary n-cube networks under the conditional fault model

A graph G is said to be conditional k-edge-fault pancyclic if after removing k faulty edges from G, under the assumption that each vertex is incident to at least two fault-free edges, the resulting graph contains a cycle of every length from its girth to |V(G)|. In this paper, we consider ternary n-cube networks and show that they are conditional (4n−5)-edge-fault pancyclic.