Acionamento vetorial por controlador fuzzy modo deslizante de motor de indução

Este trabalho estuda a técnica de acionamento vetorial aplicado ao motor de indução trifásico (MIT), utilizando como estratégia de controle a combinação de controle fuzzy com controladores chaveados do tipo modo deslizante, em uma configuração aqui denominada de Controlador Fuzzy Modo Deslizante (FSMC – Do inglês: Fuzzy Sliding Mode Control). Um modelo dinâmico do MIT é desenvolvido em variáveis ‘d-q’ o que conduziu a um modelo eletromecânico em espaço de estados que exibe fortes não linearidades. A este modelo são aplicadas as condições de controle vetorial que permitem desacoplar o torque e o fluxo no MIT, de maneira que o seu comportamento dinâmico se assemelha àquele verificado em uma máquina de corrente contínua. Nesta condição, são implementados controladores do tipo proporcional e integral (PI) às malhas de controle de corrente e velocidade do motor, e são realizadas simulações computacionais para o rastreamento de velocidade e perturbação de carga, o que levam a resultados satisfatórios do ponto de vista dinâmico. Visando investigar o desempenho das estratégias não lineares nesta abordagem é apresentado o estudo da técnica de controle a estrutura chaveada do tipo modo deslizante. Um controlador modo deslizante convencional é implementado, onde se verifica que, a despeito do excelente desempenho dinâmico a ocorrência do fenômeno do “chettering” inviabiliza a aplicação desta estratégia em testes reais. Assim, é proposta a estratégia de controle FSMC, buscando associar o bom resultado dinâmico obtido com o controlador modo deslizante e a supressão do fenômeno do chettering, o que se atinge pela definição de uma camada de chaveamento do tipo Fuzzy. O controlador FSMC proposto é submetido aos mesmos testes computacionais que o controlador PI, conduzindo a resultados superiores a este último no transitório da resposta dinâmica, porém com a presença de erro em regime permanente. Para atacar este problema é implementada uma combinação Fuzzy das estratégias FSMC com a ação de controle PI, onde o primeiro busca atuar em regiões afastadas da superfície de chaveamento e o segundo busca introduzir o efeito da ação integral próximo à superfície. Os resultados obtidos mostram a viabilidade da estratégia em acionamento de velocidade variável que exigem elevado desempenho dinâmico.

Comparação de métodos baseados em algoritmos genéticos para ajuste coordenado de estabilizadores de sistemas de potência

Essa dissertação de mestrado apresenta um estudo comparativo entre três metodologias baseadas em algoritmos genéticos para ajuste coordenado de estabilizadores de sistemas de potência (ESP). Os procedimentos de ajuste do ESP são formulados como um problema de otimização, a fim de: 1) maximizar o coeficiente de amortecimento mínimo do sistema em malha fechada; 2) maximizar o somatório de todos os coeficientes de amortecimento do sistema em malha fechada; e 3) deslocar os modos eletromecânicos poucos amortecidos ou mal amortecidos para uma zona pré-escrita no plano s. As três metodologias consideram um conjunto de condições de operacionais pré-especificadas. O sistema elétrico foi representado por equações no espaço de estado e as matrizes associadas com a modelagem foram obtidas por meio da versão acadêmica do programa PacDyn. As simulações foram realizadas usando o MATLAB. As metodologias foram aplicadas no conhecido sistema teste New England.

Aeroelastic stability analysis using linear matrix inequalities

The present work describes an alternative methodology for identification of aeroelastic stability in a range of varying parameters. Analysis is performed in time domain based on Lyapunov stability and solved by convex optimization algorithms. The theory is outlined and simulations are carried out on a benchmark system to illustrate the method. The classical methodology with the analysis of the system's eigenvalues is presented for comparing the results and validating the approach. The aeroelastic model is represented in state space format and the unsteady aerodynamic forces are written in time domain using rational function approximation. The problem is formulated as a polytopic differential inclusion system and the conceptual idea can be used in two different applications. In the first application the method verifies the aeroelastic stability in a range of air density (or its equivalent altitude range). In the second one, the stability is verified for a rage of velocities. These analyses are in contrast to the classical discrete analysis performed at fixed air density/velocity values. It is shown that this method is efficient to identify stability regions in the flight envelope and it offers promise for robust flutter identification.

Control of Limit Cycle Oscillation in a Three Degrees of Freedom Airfoil Section Using Fuzzy Takagi-Sugeno Modeling

This work presents a strategy to control nonlinear responses of aeroelastic systems with control surface freeplay. The proposed methodology is developed for the three degrees of freedom typical section airfoil considering aerodynamic forces from Theodorsen's theory. The mathematical model is written in the state space representation using rational function approximation to write the aerodynamic forces in time domain. The control system is designed using the fuzzy Takagi-Sugeno modeling to compute a feedback control gain. It useds Lyapunov's stability function and linear matrix inequalities (LMIs) to solve a convex optimization problem. Time simulations with different initial conditions are performed using a modified Runge-Kutta algorithm to compare the system with and without control forces. It is shown that this approach can compute linear control gain able to stabilize aeroelastic systems with discontinuous nonlinearities.

Modified routine for decreasing numeric oscillations at associations of lumped elements

Some changes in the application of the numeric trapezoidal integration are analyzed for applications considering pi circuits. It is considered numeric and computational proceedings for improving the numeric results obtained with associations of pi circuits. In numeric integration solutions of the linear systems, it is common to represent these associations of pi circuits by only one matrix. This representation introduces undesirable numeric oscillations in simulations of the dynamics of wave propagation in electrical systems. The proposed changes improve the results of application of cascades of pi circuits associated to the trapezoidal integration, avoiding that the numerical oscillations, or Gibb's oscillations, have high values and are slowly damped. For the carried out simulations, different number of pi circuits and voltage sources are checked, confirming the reduction of the influence of the numeric oscillations on the obtained results. (C) 2014 Elsevier B.V. All rights reserved.

Métodos de identificação e redução de modelos para atenuação de vibrações em estruturas inteligentes

Pós-graduação em Engenharia Mecânica - FEIS

Efficient Kernel Computation for Volterra Filter Structure Evaluation

Despite their generality, conventional Volterra filters are inadequate for some applications, due to the huge number of parameters that may be needed for accurate modelling. When a state-space model of the target system is known, this can be assessed by computing its kernels, which also provides valuable information for choosing an adequate alternate Volterra filter structure, if necessary, and is useful for validating parameter estimation procedures. In this letter, we derive expressions for the kernels by using the Carleman bilinearization method, for which an efficient algorithm is given. Simulation results are presented, which confirm the usefulness of the proposed approach.

Average control of Markov decision processes with Feller transition probabilities and general action spaces

This paper studies the average control problem of discrete-time Markov Decision Processes (MDPs for short) with general state space, Feller transition probabilities, and possibly non-compact control constraint sets A(x). Two hypotheses are considered: either the cost function c is strictly unbounded or the multifunctions A(r)(x) = {a is an element of A(x) : c(x, a) <= r} are upper-semicontinuous and compact-valued for each real r. For these two cases we provide new results for the existence of a solution to the average-cost optimality equality and inequality using the vanishing discount approach. We also study the convergence of the policy iteration approach under these conditions. It should be pointed out that we do not make any assumptions regarding the convergence and the continuity of the limit function generated by the sequence of relative difference of the alpha-discounted value functions and the Poisson equations as often encountered in the literature. (C) 2012 Elsevier Inc. All rights reserved.

Closed-loop stable model predictive control of integrating systems with dead time

Model predictive control (MPC) applications in the process industry usually deal with process systems that show time delays (dead times) between the system inputs and outputs. Also, in many industrial applications of MPC, integrating outputs resulting from liquid level control or recycle streams need to be considered as controlled outputs. Conventional MPC packages can be applied to time-delay systems but stability of the closed loop system will depend on the tuning parameters of the controller and cannot be guaranteed even in the nominal case. In this work, a state space model based on the analytical step response model is extended to the case of integrating time systems with time delays. This model is applied to the development of two versions of a nominally stable MPC, which is designed to the practical scenario in which one has targets for some of the inputs and/or outputs that may be unreachable and zone control (or interval tracking) for the remaining outputs. The controller is tested through simulation of a multivariable industrial reactor system. (C) 2012 Elsevier Ltd. All rights reserved.

A new approach for modeling and control of nonlinear systems via norm-bounded linear differential inclusions

A systematic approach to model nonlinear systems using norm-bounded linear differential inclusions (NLDIs) is proposed in this paper. The resulting NLDI model is suitable for the application of linear control design techniques and, therefore, it is possible to fulfill certain specifications for the underlying nonlinear system, within an operating region of interest in the state-space, using a linear controller designed for this NLDI model. Hence, a procedure to design a dynamic output feedback controller for the NLDI model is also proposed in this paper. One of the main contributions of the proposed modeling and control approach is the use of the mean-value theorem to represent the nonlinear system by a linear parameter-varying model, which is then mapped into a polytopic linear differential inclusion (PLDI) within the region of interest. To avoid the combinatorial problem that is inherent of polytopic models for medium- and large-sized systems, the PLDI is transformed into an NLDI, and the whole process is carried out ensuring that all trajectories of the underlying nonlinear system are also trajectories of the resulting NLDI within the operating region of interest. Furthermore, it is also possible to choose a particular structure for the NLDI parameters to reduce the conservatism in the representation of the nonlinear system by the NLDI model, and this feature is also one important contribution of this paper. Once the NLDI representation of the nonlinear system is obtained, the paper proposes the application of a linear control design method to this representation. The design is based on quadratic Lyapunov functions and formulated as search problem over a set of bilinear matrix inequalities (BMIs), which is solved using a two-step separation procedure that maps the BMIs into a set of corresponding linear matrix inequalities. Two numerical examples are given to demonstrate the effectiveness of the proposed approach.

The dark side of the board: advances in chess Kriegspiel

While imperfect information games are an excellent model of real-world problems and tasks, they are often difficult for computer programs to play at a high level of proficiency, especially if they involve major uncertainty and a very large state space. Kriegspiel, a variant of chess making it similar to a wargame, is a perfect example: while the game was studied for decades from a game-theoretical viewpoint, it was only very recently that the first practical algorithms for playing it began to appear. This thesis presents, documents and tests a multi-sided effort towards making a strong Kriegspiel player, using heuristic searching, retrograde analysis and Monte Carlo tree search algorithms to achieve increasingly higher levels of play. The resulting program is currently the strongest computer player in the world and plays at an above-average human level.

Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics

Non-Equilibrium Statistical Mechanics is a broad subject. Grossly speaking, it deals with systems which have not yet relaxed to an equilibrium state, or else with systems which are in a steady non-equilibrium state, or with more general situations. They are characterized by external forcing and internal fluxes, resulting in a net production of entropy which quantifies dissipation and the extent by which, by the Second Law of Thermodynamics, time-reversal invariance is broken. In this thesis we discuss some of the mathematical structures involved with generic discrete-state-space non-equilibrium systems, that we depict with networks in all analogous to electrical networks. We define suitable observables and derive their linear regime relationships, we discuss a duality between external and internal observables that reverses the role of the system and of the environment, we show that network observables serve as constraints for a derivation of the minimum entropy production principle. We dwell on deep combinatorial aspects regarding linear response determinants, which are related to spanning tree polynomials in graph theory, and we give a geometrical interpretation of observables in terms of Wilson loops of a connection and gauge degrees of freedom. We specialize the formalism to continuous-time Markov chains, we give a physical interpretation for observables in terms of locally detailed balanced rates, we prove many variants of the fluctuation theorem, and show that a well-known expression for the entropy production due to Schnakenberg descends from considerations of gauge invariance, where the gauge symmetry is related to the freedom in the choice of a prior probability distribution. As an additional topic of geometrical flavor related to continuous-time Markov chains, we discuss the Fisher-Rao geometry of nonequilibrium decay modes, showing that the Fisher matrix contains information about many aspects of non-equilibrium behavior, including non-equilibrium phase transitions and superposition of modes. We establish a sort of statistical equivalence principle and discuss the behavior of the Fisher matrix under time-reversal. To conclude, we propose that geometry and combinatorics might greatly increase our understanding of nonequilibrium phenomena.

Lernen mit einer Hybride aus Lernendem Klassifizierendem System und Selbstorganisierender Karte

Im Forschungsgebiet der Künstlichen Intelligenz, insbesondere im Bereich des maschinellen Lernens, hat sich eine ganze Reihe von Verfahren etabliert, die von biologischen Vorbildern inspiriert sind. Die prominentesten Vertreter derartiger Verfahren sind zum einen Evolutionäre Algorithmen, zum anderen Künstliche Neuronale Netze. Die vorliegende Arbeit befasst sich mit der Entwicklung eines Systems zum maschinellen Lernen, das Charakteristika beider Paradigmen in sich vereint: Das Hybride Lernende Klassifizierende System (HCS) wird basierend auf dem reellwertig kodierten eXtended Learning Classifier System (XCS), das als Lernmechanismus einen Genetischen Algorithmus enthält, und dem Wachsenden Neuralen Gas (GNG) entwickelt. Wie das XCS evolviert auch das HCS mit Hilfe eines Genetischen Algorithmus eine Population von Klassifizierern - das sind Regeln der Form [WENN Bedingung DANN Aktion], wobei die Bedingung angibt, in welchem Bereich des Zustandsraumes eines Lernproblems ein Klassifizierer anwendbar ist. Beim XCS spezifiziert die Bedingung in der Regel einen achsenparallelen Hyperquader, was oftmals keine angemessene Unterteilung des Zustandsraumes erlaubt. Beim HCS hingegen werden die Bedingungen der Klassifizierer durch Gewichtsvektoren beschrieben, wie die Neuronen des GNG sie besitzen. Jeder Klassifizierer ist anwendbar in seiner Zelle der durch die Population des HCS induzierten Voronoizerlegung des Zustandsraumes, dieser kann also flexibler unterteilt werden als beim XCS. Die Verwendung von Gewichtsvektoren ermöglicht ferner, einen vom Neuronenadaptationsverfahren des GNG abgeleiteten Mechanismus als zweites Lernverfahren neben dem Genetischen Algorithmus einzusetzen. Während das Lernen beim XCS rein evolutionär erfolgt, also nur durch Erzeugen neuer Klassifizierer, ermöglicht dies dem HCS, bereits vorhandene Klassifizierer anzupassen und zu verbessern. Zur Evaluation des HCS werden mit diesem verschiedene Lern-Experimente durchgeführt. Die Leistungsfähigkeit des Ansatzes wird in einer Reihe von Lernproblemen aus den Bereichen der Klassifikation, der Funktionsapproximation und des Lernens von Aktionen in einer interaktiven Lernumgebung unter Beweis gestellt.

Numerische Integration, angewandt bei der Inferenz in Zustandsraummodellen

In dieser Arbeit werden neuere methodische Entwicklungen aus dem Bereich der Numerischen Integration für die näherungsweise Berechnung von Zustandraummodellen erprobt. Die resultierenden Algorithmen werden bzgl. ihrer Approximationsgüte mit den populären simulationsbasierten Näherungsverfahren verglichen.

Stationary states in random walks on networks

In this thesis we dealt with the problem of describing a transportation network in which the objects in movement were subject to both finite transportation capacity and finite accomodation capacity. The movements across such a system are realistically of a simultaneous nature which poses some challenges when formulating a mathematical description. We tried to derive such a general modellization from one posed on a simplified problem based on asyncronicity in particle transitions. We did so considering one-step processes based on the assumption that the system could be describable through discrete time Markov processes with finite state space. After describing the pre-established dynamics in terms of master equations we determined stationary states for the considered processes. Numerical simulations then led to the conclusion that a general system naturally evolves toward a congestion state when its particle transition simultaneously and we consider one single constraint in the form of network node capacity. Moreover the congested nodes of a system tend to be located in adjacent spots in the network, thus forming local clusters of congested nodes.