Output feedback control of a class of stochastic hybrid systems

This paper deals with static output feedback control of a class of reconfigurable systems with Markovian Parameters and state-dependent noise. The main contribution is to formulate conditions for multi-performance design related to this class of stochastic hybrid systems. The specifications and objectives under consideration include stochastic stability, and performances. Another problem related to a more general class of stochastic hybrid systems, known as Markovian Jump Linear Systems (MJLS), is also addressed. This problem concerns the mode-independent output feedback control of MJLS. The obtained results are illustrated on a numerical example.     

Rewrite-Based Decision Procedures

The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an inference system generates finitely many clauses from the presentation of a theory and a finite set of ground unit clauses, then any fair strategy based on that system can be used as a -satisfiability procedure. In this paper, we introduce a set of sufficient conditions to generalize the entire framework of rewrite-based -satisfiability procedures to rewrite-based -decision procedures. These conditions, collectively termed subterm-inactivity, will allow us to obtain rewrite-based -decision procedures for several theories, namely those of equality with uninterpreted functions, arrays with or without extensionality and two of its extensions, finite sets with extensionality and recursive data structures.     

Stabilization of some fractional delay systems of neutral type

In this note, we give new stability tests which enable one to fully characterize the H_∞-stability of systems with transfer function , where h>0 and p,q,r are real polynomials in the variable s^μ for 0<μ<1.As an application of this, in the case r(s)=1 and degp=degq=1, families of H_∞-stabilizing controllers are given and a complete parametrization of all H_∞-stabilizing controllers is obtained when .     

Full-rank representation of generalized inverse AT,S and its application

In this paper, we introduce a full-rank representation of the generalized inverse of a given complex matrix A, which is based on an arbitrary full-rank decomposition of G, where G is a matrix such that R(G)=T and N(G)=S. Using this representation, we introduce the minor of the generalized inverse ; as a special case of the minor, a determinantal representation of the generalized inverse is obtained. As an application, we use an example to demonstrate that this representation is correct.     

Minimality considerations for graph energy over a class of graphs

Let G be a graph on n vertices, and let CHP(G;λ) be the characteristic polynomial of its adjacency matrix A(G). All n roots of CHP(G;λ), denoted by , are called to be its eigenvalues. The energy E(G) of a graph G, is the sum of absolute values of all eigenvalues, namely, . Let be the set of n-vertex unicyclic graphs, the graphs with n vertices and n edges. A fully loaded unicyclic graph is a unicyclic graph taken from with the property that there exists no vertex with degree less than 3 in its unique cycle. Let be the set of fully loaded unicyclic graphs. In this article, the graphs in with minimal and second-minimal energies are uniquely determined, respectively.     

-admissibility of the right-shift semigroup on

It is shown that the right-shift semigroup on does not satisfy the weighted Weiss conjecture for α(0,1). In other words, α-admissibility of scalar valued observation operators cannot always be characterised by a simple resolvent growth condition. This result is in contrast to the unweighted case, where 0-admissibility can be characterised by a simple growth bound. The result is proved by providing a link between discrete and continuous α-admissibility and then translating a counterexample for the unilateral shift on to continuous time systems.     

Controller synthesis with guaranteed closed-loop phase constraints

In this paper, we present an analysis and synthesis approach for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the interval [−α,α] for a given α>0 at all frequencies. Specifically, we first derive a sufficient condition involving a frequency domain inequality for guaranteeing a given phase constraint. Next, we use the Kalman–Yakubovich–Popov theorem to derive an equivalent time domain condition. In the case where , we show that frequency and time domain sufficient conditions specialize to the positivity theorem. Furthermore, using linear matrix inequalities, we develop a controller synthesis approach for guaranteeing a phase constraint on the closed-loop transfer function. Finally, we extend this synthesis approach to address mixed gain and phase constraints on the closed-loop transfer function.     

Delay-dependent filtering for time-delayed LPV systems

The present paper addresses the parameter-dependent filter design problem for output estimation in linear parameter varying (LPV) plants that include constant delays in the state. We develop LMI-based delay-dependent conditions to guarantee stability and an induced gain bound performance for the filtering error system. An explicit characterization of the filters’ state–space representation is given in terms of the solutions to a convex optimization problem associated with the synthesis conditions. By taking the output estimation error into account as the criterion, the developed filters are shown to be capable of tracking the desired outputs of the time-delayed parameter varying system in the presence of external disturbances. Two families of filters are examined: memoryless and state-delayed filters. The latter one which involves a delay term in its dynamics has the benefit of reducing the conservatism in the design and improving performance. Illustrative examples are provided to demonstrate the feasibility and advantages of the proposed methodologies for memoryless and state-delayed filter design and to validate the superiority of using the state-delayed configuration compared to the conventional memoryless filters.     

Existence and uniqueness theorems for fourth-order singular boundary value problems

By constructing a special cone and using cone compression and expansion fixed point theorem, the existence and uniqueness are established for the following singular fourth-order boundary value problems:

where f(t,x,y) may be singular at t=0,1; x=0 and y=0.     

An algorithm to generate all upper boundary points for in terms of minimal cuts

This paper discusses a stochastic-flow network from single-commodity case to multicommodity case. We propose a performance index, namely the probability that the upper bound of the system capacity is a given vector subject to the budget constraint, to evaluate the quality level for such a network. A simple approach based on minimal cuts is presented to generate the all upper boundary points for the demand subject to the budget B in order to evaluate the performance index.     

A simple derivation of ARE solutions to the standard control problem based on LMI solution

In this note, a simple derivation of the Riccati equation based solutions to the standard control problem, namely the well-known Glover–Doyle solution and DGKF solution is given based on LMI solution. It is hoped that this will be helpful in deepening the understanding of Riccati equation solutions.     

Robust PID controller tuning based on the heuristic Kalman algorithm

This paper presents a simple but effective tuning strategy for robust PID controllers satisfying multiple performance criteria. Finding such a controller is known to be computationally intractable via the conventional techniques. This is mainly due to the non-convexity of the resulting control problem which is of the fixed order/structure type. To solve this kind of control problem easily and directly, without using any complicated mathematical manipulations and without using too many “user defined” parameters, we utilize the heuristic Kalman algorithm (HKA) for the resolution of the underlying constrained non-convex optimization problem. The resulting tuning strategy is applicable both to stable and unstable systems, without any limitation concerning the order of the process to be controlled. Various numerical studies are conducted to demonstrate the validity of the proposed tuning procedure. Comparisons with previously published works are also given.     

How many servers are best in a dual-priority system?

We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?” Our setting is the system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the service demand variability of high priority jobs on low priority jobs.     

Multi-degree reduction of Bézier curves using reparameterization

L₂-norms are often used in the multi-degree reduction problem of Bézier curves or surfaces. Conventional methods on curve cases are to minimize , where and are the given curve and the approximation curve, respectively. A much better solution is to minimize , where is the closest point to point , that produces a similar effect as that of the Hausdorff distance. This paper uses a piecewise linear function L(t) instead of t to approximate the function φ(t) for a constrained multi-degree reduction of Bézier curves. Numerical examples show that this new reparameterization-based method has a much better approximation effect under Hausdorff distance than those of previous methods.