138,129 research outputs found

    Comparative performance of intelligent algorithms for system identification and control

    Get PDF
    This paper presents an investigation into the comparative performance of intelligent system identification and control algorithms within the framework of an active vibration control (AVC) system. Evolutionary Genetic algorithms (GAs) and Adaptive Neuro-Fuzzy Inference system (ANFIS) algorithms are used to develop mechanisms of an AVC system, where the controller is designed based on optimal vibration suppression using the plant model. A simulation platform of a flexible beam system in transverse vibration using finite difference (FD) method is considered to demonstrate the capabilities of the AVC system using GAs and ANFIS. MATLAB GA tool box for GAs and Fuzzy Logic tool box for ANFIS function are used to design the AVC system. The system is men implemented, tested and its performance assessed for GAs and ANFIS based algorithms. Finally, a comparative performance of the algorithms in implementing system identification and corresponding AVC system using GAs and ANFIS is presented and discussed through a set of experiments

    Investigation into the applications of genetic algorithms to control engineering

    Get PDF
    Bibliography: pages 117-120.This thesis report presents the results of a study carried out to determine possible uses of genetic algorithms to problems in control engineering. This thesis reviewed the literature on the subject of genetics and genetic algorithms and applied the algorithms to the problems of systems parameter identification and Pl/D controller tuning. More specifically, the study had the following objectives: To investigate possible uses of genetic algorithms to the task of system identification and Pl/D controller tuning. To do an in depth comparison of the proposed uses with orthodox traditional engineering thinking which is based on mathematical optimisation and empirical studies. To draw conclusions and present the findings in the form of a thesis. Genetic algorithms are a class of artificial intelligence methods inspired by the Darwinian principles of natural selection and survival of the fittest. The algorithm encodes potential solutions into chromosome-like data structures that. are evolved using genetic ·operators to determine the optimal solution of the problem. Fundamentally, the evolutionary nature of the algorithm is introduced through the operators called crossover and mutation. Crossover fundamentally takes two strings, selects a crossing point randomly and swaps segments of the strings on either side of the crossover point to create two new individuals. There are three variations of crossover which were considered in this thesis: single point crossover, two point crossover and uniform crossover. It was important that these be given careful consideration since much of the outcome of the algorithm is influenced by both the choice and the amount with which they are applied

    Metaheuristic Bio-Inspired Algorithms for Prognostics: Application to On-Board Electromechanical Actuators

    Get PDF
    Metaheuristic bio inspired algorithms are a wide class of optimization algorithms, which recently saw a significant growth due to its effectiveness for the solution of complex problems. In this preliminary work, we assess the performance of two of these algorithms-Genetic Algorithm (GA) and Particle Swarm Optimization (PSO)-for the prognostic analysis of an electro-mechanical flight control actuator, powered by a Brushless DC (BLDC) trapezoidal motor. We focus on the first step of the prognostic process, consisting in an early Fault Detection and Identification (FDI); our model-based strategy consists in using an optimization algorithm to approximate the output of the physical system with a computationally light Monitor Model

    Nonlinear system identification and control using state transition algorithm

    Full text link
    By transforming identification and control for nonlinear system into optimization problems, a novel optimization method named state transition algorithm (STA) is introduced to solve the problems. In the proposed STA, a solution to a optimization problem is considered as a state, and the updating of a solution equates to a state transition, which makes it easy to understand and convenient to implement. First, the STA is applied to identify the optimal parameters of the estimated system with previously known structure. With the accurate estimated model, an off-line PID controller is then designed optimally by using the STA as well. Experimental results have demonstrated the validity of the methodology, and comparisons to STA with other optimization algorithms have testified that STA is a promising alternative method for system identification and control due to its stronger search ability, faster convergence rate and more stable performance.Comment: 20 pages, 18 figure

    Identifying component modules

    Get PDF
    A computer-based system for modelling component dependencies and identifying component modules is presented. A variation of the Dependency Structure Matrix (DSM) representation was used to model component dependencies. The system utilises a two-stage approach towards facilitating the identification of a hierarchical modular structure. The first stage calculates a value for a clustering criterion that may be used to group component dependencies together. A Genetic Algorithm is described to optimise the order of the components within the DSM with the focus of minimising the value of the clustering criterion to identify the most significant component groupings (modules) within the product structure. The second stage utilises a 'Module Strength Indicator' (MSI) function to determine a value representative of the degree of modularity of the component groupings. The application of this function to the DSM produces a 'Module Structure Matrix' (MSM) depicting the relative modularity of available component groupings within it. The approach enabled the identification of hierarchical modularity in the product structure without the requirement for any additional domain specific knowledge within the system. The system supports design by providing mechanisms to explicitly represent and utilise component and dependency knowledge to facilitate the nontrivial task of determining near-optimal component modules and representing product modularity

    Assembly and Disassembly Planning by using Fuzzy Logic & Genetic Algorithms

    Full text link
    The authors propose the implementation of hybrid Fuzzy Logic-Genetic Algorithm (FL-GA) methodology to plan the automatic assembly and disassembly sequence of products. The GA-Fuzzy Logic approach is implemented onto two levels. The first level of hybridization consists of the development of a Fuzzy controller for the parameters of an assembly or disassembly planner based on GAs. This controller acts on mutation probability and crossover rate in order to adapt their values dynamically while the algorithm runs. The second level consists of the identification of theoptimal assembly or disassembly sequence by a Fuzzy function, in order to obtain a closer control of the technological knowledge of the assembly/disassembly process. Two case studies were analyzed in order to test the efficiency of the Fuzzy-GA methodologies

    Performance-based control system design automation via evolutionary computing

    Get PDF
    This paper develops an evolutionary algorithm (EA) based methodology for computer-aided control system design (CACSD) automation in both the time and frequency domains under performance satisfactions. The approach is automated by efficient evolution from plant step response data, bypassing the system identification or linearization stage as required by conventional designs. Intelligently guided by the evolutionary optimization, control engineers are able to obtain a near-optimal ‘‘off-thecomputer’’ controller by feeding the developed CACSD system with plant I/O data and customer specifications without the need of a differentiable performance index. A speedup of near-linear pipelineability is also observed for the EA parallelism implemented on a network of transputers of Parsytec SuperCluster. Validation results against linear and nonlinear physical plants are convincing, with good closed-loop performance and robustness in the presence of practical constraints and perturbations

    Evolutionary-based sparse regression for the experimental identification of duffing oscillator

    Get PDF
    In this paper, an evolutionary-based sparse regression algorithm is proposed and applied onto experimental data collected from a Duffing oscillator setup and numerical simulation data. Our purpose is to identify the Coulomb friction terms as part of the ordinary differential equation of the system. Correct identification of this nonlinear system using sparse identification is hugely dependent on selecting the correct form of nonlinearity included in the function library. Consequently, in this work, the evolutionary-based sparse identification is replacing the need for user knowledge when constructing the library in sparse identification. Constructing the library based on the data-driven evolutionary approach is an effective way to extend the space of nonlinear functions, allowing for the sparse regression to be applied on an extensive space of functions. The results show that the method provides an effective algorithm for the purpose of unveiling the physical nature of the Duffing oscillator. In addition, the robustness of the identification algorithm is investigated for various levels of noise in simulation. The proposed method has possible applications to other nonlinear dynamic systems in mechatronics, robotics, and electronics
    corecore