Quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems

This paper presents a novel quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems via H^∞ approach. In the proposed algorithm, a self-constructing neural fuzzy network (SCNFN) is developed with both structure and parameter learning phases, so that the number of fuzzy rules and network parameters can be adaptively determined. Based on the SCNFN, an uncertainty observer is first introduced to watch compound system uncertainties. Subsequently, an optimal NFN-based controller is designed to overcome the effects of unstructured uncertainty and approximation error by integrating the NFN identifier, linear optimal control and H^∞ approach as a whole. The adaptive tuning laws of network parameters are derived in the sense of quadratic stability technique and Lyapunov synthesis approach to ensure the network convergence and H^∞ synchronization performance. The merits of the proposed control scheme are not only that the conservative estimation of NFN approximation error bound is avoided but also that a suitable-sized neural structure is found to sufficiently approximate the system uncertainties. Simulation results are provided to verify the effectiveness and robustness of the proposed control method.     

An involute spiral that matches Hermite data in the plane

A construction is given for a planar rational Pythagorean hodograph spiral, which interpolates any two-point G² Hermite data that a spiral can match. When the curvature at one of the points is zero, the construction gives the unique interpolant that is an involute of a rational Pythagorean hodograph curve of the form cubic over linear. Otherwise, the spiral comprises an involute of a Tschirnhausen cubic together with at most two circular arcs. The construction is by explicit formulas in the first case, and requires the solution of a quadratic equation in the second case.     

Suboptimal robust synthesis for MIMO plant under coprime factor perturbations

Suboptimal robust synthesis for MIMO nominal system under coprime factor perturbations is considered in classical and non-classical statements. In the classical statement, weights of perturbations and upper bound on magnitude bounded exogenous disturbance are assumed to be known to controller designer. Suboptimal synthesis within ε tolerance is reduced to the solution of log₂(1/ε) standard mixed sensitivity problems of ℓ₁ optimization. In the non-classical statement, the upper bounds on perturbations and exogenous disturbance are to be estimated from measurement data and suboptimal synthesis is reduced to the solution of 1/ε mixed sensitivity problems.     

A nonsmooth strict bounded real lemma

In the theory of linear H^∞ control, the strict bounded real lemma plays a critical role because it provides a connection between the stabilizing solutions to the H^∞ Riccati equations and the stability and disturbance attenuation of the closed-loop system. Nonlinear versions of the strict bounded real lemma are also important in nonlinear H^∞ control theory. In this paper, we investigate the extension of the linear strict bounded real lemma and its smooth nonlinear generalization to cases where the solutions of the associated nonlinear PDE are not necessarily differentiable.     

A -based optimal finite-word-length controller design

A novel optimal Finite Word Length (FWL) controller design is proposed in the framework of μ theory. A computationally tractable close-loop stability measure with FWL implementation considerations of the controller is derived based on the μ theory, and the optimal FWL controller realizations are obtained by solving the resulting optimal FWL realization problem using linear matrix inequality techniques.     

control for fast sampling discrete-time singularly perturbed systems

This paper is concerned with the H_∞ control problem via state feedback for fast sampling discrete-time singularly perturbed systems. A new H_∞ controller design method is given in terms of solutions to linear matrix inequalities (LMIs), which eliminates the regularity restrictions attached to the Riccati-based solution. A method for evaluating the upper bound of singular perturbation parameter with meeting a prescribed H_∞ performance bound requirement is also given. Furthermore, the results are extended to robust controller design for fast sampling discrete-time singularly perturbed systems with polytopic uncertainties. Numerical examples are given to illustrate the validity of the proposed methods.     

On standard control problems for systems with infinitely many unstable poles

In this paper, H^∞ control for a class of linear time invariant systems with infinitely many unstable poles is studied. An example of such a plant is a high gain system with delayed feedback. We formulate the problem via a generalized plant which consists of a rational transfer matrix and the inverse of a scalar (possibly irrational) inner function. It is shown that the problem can be decomposed into a finite-dimensional H^∞ control problem and an additional rank condition.     

Limitations of nonlinear discrete periodic control for disturbance attenuation and robust stabilization

This paper presents a performance analysis of nonlinear periodically time-varying discrete controllers acting upon a linear time-invariant discrete plant. Time-invariant controllers are distinguished from strictly periodically time-varying controllers. For a given nonlinear periodic controller, a time-invariant controller is constructed. Necessary and sufficient conditions are given under which the time-invariant controller gives strictly better control performance than the time-invariant controller from which it was obtained, for the attenuation of l_p exogenous disturbances and the robust stabilization of l_p unstructured perturbations, for all p[1,∞].     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

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 .     

A subband coding approach to control under limited data rates and message losses

For the design of networked control systems, we employ a subband coding technique to efficiently use the available data rate. Such coding schemes have widely been used in signal processing for data compression. We take an approach suitable from the control perspective in that frequency characteristics of a controller are directly used. In particular, we propose a three-step design procedure for the overall controller having the following features: On the coder side, it uses a controller consisting of a filter bank whose outputs are subband signals of the control input. On the decoder side is another filter bank for reconstruction of the subband signals. This decoder is capable to account for random message losses that occur in communication and is designed via an H^∞-type method. For the quantizers in the coder, an efficient bit allocation scheme is also developed.     

Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs

An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)−f(y)|≥2 if d(x,y)=1 and |f(x)−f(y)|≥1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-labeling number λ(G) of G is the smallest number k such that G has an L(2,1)-labeling with max{f(v):vV(G)}=k. Griggs and Yeh conjecture that λ(G)≤Δ² for any simple graph with maximum degree Δ≥2. This paper considers the graph formed by the skew product and the converse skew product of two graphs with a new approach on the analysis of adjacency matrices of the graphs as in [W.C. Shiu, Z. Shao, K.K. Poon, D. Zhang, A new approach to the L(2,1)-labeling of some products of graphs, IEEE Trans. Circuits Syst. II: Express Briefs (to appear)] and improves the previous upper bounds significantly.     

Shape-preserving interpolation of irregular data by bivariate curvature-based cubic splines in spherical coordinates

We investigate C¹-smooth bivariate curvature-based cubic L₁ interpolating splines in spherical coordinates. The coefficients of these splines are calculated by minimizing an integral involving the L₁ norm of univariate curvature in four directions at each point on the unit sphere. We compare these curvature-based cubic L₁ splines with analogous cubic L₂ interpolating splines calculated by minimizing an integral involving the square of the L₂ norm of univariate curvature in the same four directions at each point. For two sets of irregular data on an equilateral tetrahedron with protuberances on the faces, we compare these two types of curvature-based splines with each other and with cubic L₁ and L₂ splines calculated by minimizing the L₁ norm and the square of the L₂ norm, respectively, of second derivatives. Curvature-based cubic L₁ splines preserve the shape of irregular data well, better than curvature-based cubic L₂ splines and than second-derivative-based cubic L₁ and L₂ splines. Second-derivative-based cubic L₂ splines preserve shape poorly. Variants of curvature-based L₁ and L₂ splines in spherical and general curvilinear coordinate systems are outlined.     

The complete inclusion structure of leaf power classes

Let k≥2 be an integer and G=(V,E) be a finite simple graph. A tree T is a k-leaf root of G, if V is the set of leaves of T and, for any two distinct x,yV, the distance between x and y in T is at most k if and only if xyE. We say that G is a k-leaf power if there is a k-leaf root of G. The main result of this paper is that, for all 2≤k<k^′, the classes of k- and k^′-leaf powers are inclusion-incomparable, if and only if k^′≤2k−3 and k^′−k is an odd number. With this result, an open problem from the literature about the inclusion structure of these graph classes is solved completely. In addition, the intersection of the smallest pair of inclusion-incomparable classes is studied.     

Delay-dependent robust stability and control for jump linear systems with delays

This paper considers robust stochastic stability, stabilization and H_∞ control problems for a class of jump linear systems with time delays. By using some zero equations, neither model transformation nor bounding for cross terms is required to obtain the delay-dependent results, which are given in terms of linear matrix inequalities (LMIs). Maximum sizes of time delays are also studied for system stability. Furthermore, solvability conditions and corresponding H_∞ control laws are given which provide robust stabilization with a prescribed H_∞ disturbance attenuation level. Numerical examples show that the proposed methods are much less conservative than existing results.     

Static and output-feedback of discrete-time LTI systems with state multiplicative noise

A parameter dependent approach for designing static output-feedback controller for linear time-invariant systems with state-multiplicative noise is introduced which achieves a minimum bound on either the stochastic H₂ or the H_∞ performance levels. A solution is obtained also for the case where, in addition to the stochastic parameters, the system matrices reside in a given polytope. In this case, a parameter dependent Lyapunov function is described which enables the derivation of the required constant feedback gain via a solution of a set of linear matrix inequalities that correspond to the vertices of the uncertainty polytope.The stochastic parameters appear in both the dynamics and the input matrices of the state space model of the system. The problems are solved using the expected value of the standard performance indices over the stochastic parameters. The theory developed is demonstrated by a simple example.     

Adaptive patch-based mesh fitting for reverse engineering

In this paper,  we propose a novel adaptive mesh fitting algorithm that fits a triangular model with G¹ smoothly stitching bi-quintic Bézier patches. Our algorithm first segments the input mesh into a set of quadrilateral patches, whose boundaries form a quadrangle mesh. For each boundary of each quadrilateral patch, we construct a normal curve and a boundary-fitting curve, which fit the normal and position of its boundary vertices respectively. By interpolating the normal and boundary-fitting curves of each quadrilateral patch with a Bézier patch, an initial G¹ smoothly stitching Bézier patches is generated. We perform this patch-based fitting scheme in an adaptive fashion by recursively subdividing the underlying quadrilateral into four sub-patches. The experimental results show that our algorithm achieves precision-ensured Bézier patches with G¹ continuity and meets the requirements of reverse engineering.     

Isolation concepts for efficiently enumerating dense subgraphs

In an undirected graph G=(V,E), a set of k vertices is called c-isolated if it has less than ck outgoing edges. Ito and Iwama [H. Ito, K. Iwama, Enumeration of isolated cliques and pseudo-cliques, ACM Transactions on Algorithms (2008) (in press)] gave an algorithm to enumerate all c-isolated maximal cliques in O(4^cc⁴|E|) time. We extend this to enumerating all maximal c-isolated cliques (which are a superset) and improve the running time bound to O(2.89^cc²|E|), using modifications which also facilitate parallelizing the enumeration. Moreover, we introduce a more restricted and a more general isolation concept and show that both lead to faster enumeration algorithms. Finally, we extend our considerations to s-plexes (a relaxation of the clique notion), providing a W[1]-hardness result when the size of the s-plex is the parameter and a fixed-parameter algorithm for enumerating isolated s-plexes when the parameter describes the degree of isolation.     

Existence of positive solutions for th-order singular superlinear boundary value problems

This paper investigates the existence of positive solutions for 2nth-order (n>1) singular superlinear boundary value problems. A necessary and sufficient condition for the existence of C²ⁿ⁻²[0,1] as well as C²ⁿ⁻¹[0,1] positive solutions is given by constructing a special cone and with the e-Norm.     

Reduced-order filtering for singular systems

This paper solves the problem of reduced-order H_∞ filtering for singular systems. The purpose is to design linear filters with a specified order lower than the given system such that the filtering error dynamic system is regular, impulse-free (or causal), stable, and satisfies a prescribed H_∞ performance level. One major contribution of the present work is that necessary and sufficient conditions for the solvability of this problem are obtained for both continuous and discrete singular systems. These conditions are characterized in terms of linear matrix inequalities (LMIs) and a coupling non-convex rank constraint. Moreover, an explicit parametrization of all desired reduced-order filters is presented when these inequalities are feasible. In particular, when a static or zeroth-order H_∞ filter is desired, it is shown that the H_∞ filtering problem reduces to a convex LMI problem. All these results are expressed in terms of the original system matrices without decomposition, which makes the design procedure simple and directly. Last but not least, the results have generalized previous works on H_∞ filtering for state-space systems. An illustrative example is given to demonstrate the effectiveness of the proposed approach.