43,720 research outputs found

    New methods for the estimation of Takagi-Sugeno model based extended Kalman filter and its applications to optimal control for nonlinear systems

    Get PDF
    This paper describes new approaches to improve the local and global approximation (matching) and modeling capability of Takagi–Sugeno (T-S) fuzzy model. The main aim is obtaining high function approximation accuracy and fast convergence. The main problem encountered is that T-S identification method cannot be applied when the membership functions are overlapped by pairs. This restricts the application of the T-S method because this type of membership function has been widely used during the last 2 decades in the stability, controller design of fuzzy systems and is popular in industrial control applications. The approach developed here can be considered as a generalized version of T-S identification method with optimized performance in approximating nonlinear functions. We propose a noniterative method through weighting of parameters approach and an iterative algorithm by applying the extended Kalman filter, based on the same idea of parameters’ weighting. We show that the Kalman filter is an effective tool in the identification of T-S fuzzy model. A fuzzy controller based linear quadratic regulator is proposed in order to show the effectiveness of the estimation method developed here in control applications. An illustrative example of an inverted pendulum is chosen to evaluate the robustness and remarkable performance of the proposed method locally and globally in comparison with the original T-S model. Simulation results indicate the potential, simplicity, and generality of the algorithm. An illustrative example is chosen to evaluate the robustness. In this paper, we prove that these algorithms converge very fast, thereby making them very practical to use

    A solving tool for fuzzy quadratic optimal control problems

    Get PDF
    In this paper we propose an iterative method to solve an optimal control problem, with fuzzy target and constraints. The algorithm is developed in such a way as to satisfy the target function and the constraints. The algorithm can be applied only if a method exists to solve a crisp parametric sub-problem obtained by the original one. This is the case for a quadratic-linear target function with linear constraints, for which some well established solvable methods exist for the crisp associated sub-problem. A numerical test confirmed the good convergence properties.fuzzy, mathematical programming

    Filter Design for Positive T-S Fuzzy Continuous-Time Systems with Time Delay Using Piecewise-Linear Membership Functions

    Get PDF
    The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.This work focuses on the filtering problem and stability analysis for positive Takagi-Sugeno (T-S) fuzzy systems with time delay under L1-induced performance. Due to the importance of estimation of system states but the few filter design results on positive nonlinear systems, it is an attractive and meaningful topic well worth studying. In order to fully exploit and take advantage of the positivity of positive T-S fuzzy systems, many commonly used methods, for instance free-weighting matrix approach and similarity transformation are probably not suitable for positive systems. To address the hard-nut-to-crack problem, an auxiliary variable is introduced so that the augmentation approach can be employed to carry out the positivity and stability analysis of filtering error systems. In addition, another obstacle that cannot be ignored is the existence of non-convex terms in the stability and positivity conditions. For getting around this barrier, some iterative linear matrix inequality (ILMI) algorithms have been proposed in the literature. However, considering the weakness that these methods cannot guarantee the convergence to a numerical solution and the iterative process is exhaustive, we present an effective matrix decoupling method to convert the nonconvex conditions into convex ones in this paper. Furthermore, a linear co-positive Lyapunov function which incorporates the positivity of system states and time delay at the same time is chosen so that the positivity characteristic of filtering error systems can be captured further. However, because of plenty of valuable information of membership functions (MFs) being ignored, hence, the obtained results are conservative. For the sake of relaxing the conservativeness, the advanced piecewise-linear membership functions (PLMFs) approximate method is utilized to facilitate the stability and positivity analysis. Therefore, the relaxed stability and positivity conditions which are cast as sum of squares (SOS) are obtained and can be solved numerically. Finally, the effectiveness of the designed fuzzy filtering strategy with satisfying L1-induced performance are demonstrated by a simulation example

    A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

    Get PDF
    Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.Comment: 33 pages, 9 figures; for a project overview see http://www.dbai.tuwien.ac.at/proj/StarFLIP

    Learning Opposites with Evolving Rules

    Full text link
    The idea of opposition-based learning was introduced 10 years ago. Since then a noteworthy group of researchers has used some notions of oppositeness to improve existing optimization and learning algorithms. Among others, evolutionary algorithms, reinforcement agents, and neural networks have been reportedly extended into their opposition-based version to become faster and/or more accurate. However, most works still use a simple notion of opposites, namely linear (or type- I) opposition, that for each x[a,b]x\in[a,b] assigns its opposite as x˘I=a+bx\breve{x}_I=a+b-x. This, of course, is a very naive estimate of the actual or true (non-linear) opposite x˘II\breve{x}_{II}, which has been called type-II opposite in literature. In absence of any knowledge about a function y=f(x)y=f(\mathbf{x}) that we need to approximate, there seems to be no alternative to the naivety of type-I opposition if one intents to utilize oppositional concepts. But the question is if we can receive some level of accuracy increase and time savings by using the naive opposite estimate x˘I\breve{x}_I according to all reports in literature, what would we be able to gain, in terms of even higher accuracies and more reduction in computational complexity, if we would generate and employ true opposites? This work introduces an approach to approximate type-II opposites using evolving fuzzy rules when we first perform opposition mining. We show with multiple examples that learning true opposites is possible when we mine the opposites from the training data to subsequently approximate x˘II=f(x,y)\breve{x}_{II}=f(\mathbf{x},y).Comment: Accepted for publication in The 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2015), August 2-5, 2015, Istanbul, Turke
    corecore