Modeling asphalt pavement overlay transverse cracks using the genetic operation tree and Levenberg-Marquardt Method

[[abstract]]The Artificial Neural Network (ANN) and the nonlinear regression method are commonly used to build models from experimental data. However, the ANN has been criticized for incapable of providing clear relationships and physical meanings, and is usually regarded as a black box. The nonlinear regression method needs predefined and correct formula structures to process parameter search in terms of the minimal sum of square errors. Unfortunately, the formula structures of these models are often unclear and cannot be defined in advance. To overcome these challenges, this study proposes a novel approach, called ââLMGOT,ââ that integrates two optimization techniques: the LevenbergâMarquardt (LM) Method and the genetic operation tree (GOT). The GOT borrows the concept from the genetic algorithm, a famous algorithm for solving discrete optimization problems, to generate operation trees (OTs), which represent the structures of the formulas. Meanwhile, the LM takes advantage of its merit for solving nonlinear continuous optimization problems, and determines the coefficients in the GOTs that best fit the experimental data. This paper uses the LMGOT to investigate the data sets of pavement cracks from a 15-year experiment conducted by the Texas Departments of Transportation. Results show a concise formula for predicting the length of pavement transverse cracking, and indicate that the LMGOT is an efficient approach to building an accurate crack model.[[incitationindex]]SCI[[booktype]]紙

Integrating Evolutionary Computation with Neural Networks

There is a tremendous interest in the development of the evolutionary computation techniques as they are well suited to deal with optimization of functions containing a large number of variables. This paper presents a brief review of evolutionary computing techniques. It also discusses briefly the hybridization of evolutionary computation and neural networks and presents a solution of a classical problem using neural computing and evolutionary computing technique

Parameters Identification for a Composite Piezoelectric Actuator Dynamics

This work presents an approach for identifying the model of a composite piezoelectric (PZT) bimorph actuator dynamics, with the objective of creating a robust model that can be used under various operating conditions. This actuator exhibits nonlinear behavior that can be described using backlash and hysteresis. A linear dynamic model with a damping matrix that incorporates the Bouc–Wen hysteresis model and the backlash operators is developed. This work proposes identifying the actuator’s model parameters using the hybrid master-slave genetic algorithm neural network (HGANN). In this algorithm, the neural network exploits the ability of the genetic algorithm to search globally to optimize its structure, weights, biases and transfer functions to perform time series analysis efficiently. A total of nine datasets (cases) representing three different voltage amplitudes excited at three different frequencies are used to train and validate the model. Four cases are considered for training the NN architecture, connection weights, bias weights and learning rules. The remaining five cases are used to validate the model, which produced results that closely match the experimental ones. The analysis shows that damping parameters are inversely proportional to the excitation frequency. This indicates that the suggested hysteresis model is too general for the PZT model in this work. It also suggests that backlash appears only when dynamic forces become dominant

A Genetic Programming Approach to Designing Convolutional Neural Network Architectures

The convolutional neural network (CNN), which is one of the deep learning models, has seen much success in a variety of computer vision tasks. However, designing CNN architectures still requires expert knowledge and a lot of trial and error. In this paper, we attempt to automatically construct CNN architectures for an image classification task based on Cartesian genetic programming (CGP). In our method, we adopt highly functional modules, such as convolutional blocks and tensor concatenation, as the node functions in CGP. The CNN structure and connectivity represented by the CGP encoding method are optimized to maximize the validation accuracy. To evaluate the proposed method, we constructed a CNN architecture for the image classification task with the CIFAR-10 dataset. The experimental result shows that the proposed method can be used to automatically find the competitive CNN architecture compared with state-of-the-art models.Comment: This is the revised version of the GECCO 2017 paper. The code of our method is available at https://github.com/sg-nm/cgp-cn

Applications of Biological Cell Models in Robotics

In this paper I present some of the most representative biological models applied to robotics. In particular, this work represents a survey of some models inspired, or making use of concepts, by gene regulatory networks (GRNs): these networks describe the complex interactions that affect gene expression and, consequently, cell behaviour

Evolutionary Algorithms for Reinforcement Learning

There are two distinct approaches to solving reinforcement learning problems, namely, searching in value function space and searching in policy space. Temporal difference methods and evolutionary algorithms are well-known examples of these approaches. Kaelbling, Littman and Moore recently provided an informative survey of temporal difference methods. This article focuses on the application of evolutionary algorithms to the reinforcement learning problem, emphasizing alternative policy representations, credit assignment methods, and problem-specific genetic operators. Strengths and weaknesses of the evolutionary approach to reinforcement learning are presented, along with a survey of representative applications