On solving non-standard ℍ -/ℍ 2/∞ fault detection problems

We discuss solvability issues of ℍ -/ℍ 2/∞ optimal fault detection problems in the most general setting. A solution approach is presented which successively reduces the initial problem to simpler ones. The last computational step generally may involve the solution of a non-standard ℍ -/ ℍ 2/∞ optimization problem for which we discuss possible solution approaches. Using an appropriate definition of the ℍ -- index, we provide a complete solution of this problem in the case of ℍ 2-norm. Furthermore, we discuss the solvability issues in the case of ℍ ∞-norm. © 2011 IEEE.

Optimal constraint tightening policies for robust variable horizon model predictive control

This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.

etl workflow analysis and verification using backwards constraint propagation

University of Twente; Centre for Telematics and Information Technology; Netherlands Organisation for Scientific Research; Jacquard; Capgemini

Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.