A Critical Review of Optimization Methods for Road Vehicles Design

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/77078/1/AIAA-2006-6998-235.pd

Neuroevolution in Games: State of the Art and Open Challenges

This paper surveys research on applying neuroevolution (NE) to games. In neuroevolution, artificial neural networks are trained through evolutionary algorithms, taking inspiration from the way biological brains evolved. We analyse the application of NE in games along five different axes, which are the role NE is chosen to play in a game, the different types of neural networks used, the way these networks are evolved, how the fitness is determined and what type of input the network receives. The article also highlights important open research challenges in the field.Comment: - Added more references - Corrected typos - Added an overview table (Table 1

Optimisation of racing car suspensions featuring inerters

Racing car suspensions are a critical system in the overall performance of the vehicle. They must be able to accurately control ride dynamics as well as influencing the handling characteristics of the vehicle and providing stability under the action of external forces. This work is a research study on the design and optimisation of high performance vehicle suspensions using inerters. The starting point is a theoretical investigation of the dynamics of a system fitted with an ideal inerter. This sets the foundation for developing a more complex and novel vehicle suspension model incorporating real inerters. The accuracy and predictability of this model has been assessed and validated against experimental data from 4- post rig testing. In order to maximise overall vehicle performance, a race car suspension must meet a large number of conflicting objectives. Hence, suspension design and optimisation is a complex task where a compromised solution among a set of objectives needs to be adopted. The first task in this process is to define a set of performance based objective functions. The approach taken was to relate the ride dynamic behaviour of the suspension to the overall performance of the race car. The second task of the optimisation process is to develop an efficient and robust optimisation methodology. To address this, a multi-stage optimisation algorithm has been developed. The algorithm is based on two stages, a hybrid surrogate model based multiobjective evolutionary algorithm to obtain a set of non-dominated optimal suspension solutions and a transient lap-time simulation tool to incorporate external factors to the decision process and provide a final optimal solution. A transient lap-time simulation tool has been developed. The minimum time manoeuvring problem has been defined as an Optimal Control problem. A novel solution method based on a multi-level algorithm and a closed-loop driver steering control has been proposed to find the optimal lap time. The results obtained suggest that performance gains can be obtained by incorporating inerters into the suspension system. The work suggests that the use of inerters provides the car with an optimised aerodynamic platform and the overall stability of the vehicle is improved

Evolutionary Reinforcement Learning: A Survey

Reinforcement learning (RL) is a machine learning approach that trains agents to maximize cumulative rewards through interactions with environments. The integration of RL with deep learning has recently resulted in impressive achievements in a wide range of challenging tasks, including board games, arcade games, and robot control. Despite these successes, there remain several crucial challenges, including brittle convergence properties caused by sensitive hyperparameters, difficulties in temporal credit assignment with long time horizons and sparse rewards, a lack of diverse exploration, especially in continuous search space scenarios, difficulties in credit assignment in multi-agent reinforcement learning, and conflicting objectives for rewards. Evolutionary computation (EC), which maintains a population of learning agents, has demonstrated promising performance in addressing these limitations. This article presents a comprehensive survey of state-of-the-art methods for integrating EC into RL, referred to as evolutionary reinforcement learning (EvoRL). We categorize EvoRL methods according to key research fields in RL, including hyperparameter optimization, policy search, exploration, reward shaping, meta-RL, and multi-objective RL. We then discuss future research directions in terms of efficient methods, benchmarks, and scalable platforms. This survey serves as a resource for researchers and practitioners interested in the field of EvoRL, highlighting the important challenges and opportunities for future research. With the help of this survey, researchers and practitioners can develop more efficient methods and tailored benchmarks for EvoRL, further advancing this promising cross-disciplinary research field

Enhancing player experience in computer games: A computational Intelligence approach.

Ph.DDOCTOR OF PHILOSOPH

Multi-objective adaptation of a parameterized GVGAI agent towards several games

This paper proposes a benchmark for multi-objective optimization based on video game playing. The challenge is to optimize an agent to perform well on several different games, where each objective score corresponds to the performance on a different game. The benchmark is inspired from the quest for general intelligence in the form of general game playing, and builds on the General Video Game AI (GVGAI) framework. As it is based on game-playing, this benchmark incorporates salient aspects of game-playing problems such as discontinuous feedback and a non-trivial amount of stochasticity. We argue that the proposed benchmark thus provides a different challenge from many other benchmarks for multi-objective optimization algorithms currently available. We also provide initial results on categorizing the space offered by this benchmark and applying a standard multi-objective optimization algorithm to it.peer-reviewe

A Field Guide to Genetic Programming

xiv, 233 p. : il. ; 23 cm.Libro ElectrónicoA Field Guide to Genetic Programming (ISBN 978-1-4092-0073-4) is an introduction to genetic programming (GP). GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. The authorsIntroduction -- Representation, initialisation and operators in Tree-based GP -- Getting ready to run genetic programming -- Example genetic programming run -- Alternative initialisations and operators in Tree-based GP -- Modular, grammatical and developmental Tree-based GP -- Linear and graph genetic programming -- Probalistic genetic programming -- Multi-objective genetic programming -- Fast and distributed genetic programming -- GP theory and its applications -- Applications -- Troubleshooting GP -- Conclusions.Contents xi 1 Introduction 1.1 Genetic Programming in a Nutshell 1.2 Getting Started 1.3 Prerequisites 1.4 Overview of this Field Guide I Basics 2 Representation, Initialisation and GP 2.1 Representation 2.2 Initialising the Population 2.3 Selection 2.4 Recombination and Mutation Operators in Tree-based 3 Getting Ready to Run Genetic Programming 19 3.1 Step 1: Terminal Set 19 3.2 Step 2: Function Set 20 3.2.1 Closure 21 3.2.2 Sufficiency 23 3.2.3 Evolving Structures other than Programs 23 3.3 Step 3: Fitness Function 24 3.4 Step 4: GP Parameters 26 3.5 Step 5: Termination and solution designation 27 4 Example Genetic Programming Run 4.1 Preparatory Steps 29 4.2 Step-by-Step Sample Run 31 4.2.1 Initialisation 31 4.2.2 Fitness Evaluation Selection, Crossover and Mutation Termination and Solution Designation Advanced Genetic Programming 5 Alternative Initialisations and Operators in 5.1 Constructing the Initial Population 5.1.1 Uniform Initialisation 5.1.2 Initialisation may Affect Bloat 5.1.3 Seeding 5.2 GP Mutation 5.2.1 Is Mutation Necessary? 5.2.2 Mutation Cookbook 5.3 GP Crossover 5.4 Other Techniques 32 5.5 Tree-based GP 39 6 Modular, Grammatical and Developmental Tree-based GP 47 6.1 Evolving Modular and Hierarchical Structures 47 6.1.1 Automatically Defined Functions 48 6.1.2 Program Architecture and Architecture-Altering 50 6.2 Constraining Structures 51 6.2.1 Enforcing Particular Structures 52 6.2.2 Strongly Typed GP 52 6.2.3 Grammar-based Constraints 53 6.2.4 Constraints and Bias 55 6.3 Developmental Genetic Programming 57 6.4 Strongly Typed Autoconstructive GP with PushGP 59 7 Linear and Graph Genetic Programming 61 7.1 Linear Genetic Programming 61 7.1.1 Motivations 61 7.1.2 Linear GP Representations 62 7.1.3 Linear GP Operators 64 7.2 Graph-Based Genetic Programming 65 7.2.1 Parallel Distributed GP (PDGP) 65 7.2.2 PADO 67 7.2.3 Cartesian GP 67 7.2.4 Evolving Parallel Programs using Indirect Encodings 68 8 Probabilistic Genetic Programming 8.1 Estimation of Distribution Algorithms 69 8.2 Pure EDA GP 71 8.3 Mixing Grammars and Probabilities 74 9 Multi-objective Genetic Programming 75 9.1 Combining Multiple Objectives into a Scalar Fitness Function 75 9.2 Keeping the Objectives Separate 76 9.2.1 Multi-objective Bloat and Complexity Control 77 9.2.2 Other Objectives 78 9.2.3 Non-Pareto Criteria 80 9.3 Multiple Objectives via Dynamic and Staged Fitness Functions 80 9.4 Multi-objective Optimisation via Operator Bias 81 10 Fast and Distributed Genetic Programming 83 10.1 Reducing Fitness Evaluations/Increasing their Effectiveness 83 10.2 Reducing Cost of Fitness with Caches 86 10.3 Parallel and Distributed GP are Not Equivalent 88 10.4 Running GP on Parallel Hardware 89 10.4.1 Master–slave GP 89 10.4.2 GP Running on GPUs 90 10.4.3 GP on FPGAs 92 10.4.4 Sub-machine-code GP 93 10.5 Geographically Distributed GP 93 11 GP Theory and its Applications 97 11.1 Mathematical Models 98 11.2 Search Spaces 99 11.3 Bloat 101 11.3.1 Bloat in Theory 101 11.3.2 Bloat Control in Practice 104 III Practical Genetic Programming 12 Applications 12.1 Where GP has Done Well 12.2 Curve Fitting, Data Modelling and Symbolic Regression 12.3 Human Competitive Results – the Humies 12.4 Image and Signal Processing 12.5 Financial Trading, Time Series, and Economic Modelling 12.6 Industrial Process Control 12.7 Medicine, Biology and Bioinformatics 12.8 GP to Create Searchers and Solvers – Hyper-heuristics xiii 12.9 Entertainment and Computer Games 127 12.10The Arts 127 12.11Compression 128 13 Troubleshooting GP 13.1 Is there a Bug in the Code? 13.2 Can you Trust your Results? 13.3 There are No Silver Bullets 13.4 Small Changes can have Big Effects 13.5 Big Changes can have No Effect 13.6 Study your Populations 13.7 Encourage Diversity 13.8 Embrace Approximation 13.9 Control Bloat 13.10 Checkpoint Results 13.11 Report Well 13.12 Convince your Customers 14 Conclusions Tricks of the Trade A Resources A.1 Key Books A.2 Key Journals A.3 Key International Meetings A.4 GP Implementations A.5 On-Line Resources 145 B TinyGP 151 B.1 Overview of TinyGP 151 B.2 Input Data Files for TinyGP 153 B.3 Source Code 154 B.4 Compiling and Running TinyGP 162 Bibliography 167 Inde

Two-Dimensional-Based Hybrid Shape Optimisation of a 5-Element Formula 1 Race Car Front Wing under FIA Regulations

Front wings are a key element in the aerodynamic performance of Formula 1 race cars. Thus, their optimisation makes an important contribution to the performance of cars in races. However, their design is constrained by regulation, which makes it more difficult to find good designs. The present work develops a hybrid shape optimisation approach to obtain an optimal five-element airfoil front wing under the FIA regulations and 17 design parameters. A first baseline design is obtained by parametric optimisation, on which the adjoint method is applied for shape optimisation via Mesh Morphing with Radial Basis Functions. The optimal front wing candidate obtained outperforms the parametric baseline up to a 25% at certain local positions. This shows that the proposed and tested hybrid approach can be a very efficient alternative. Although a direct 3D optimisation approach could be developed, the computational costs would be dramatically increased (possibly unaffordable for such a complex five-element front wing realistic shape with 17 design parameters and regulatory constraints). Thus, the present approach is of strong interest if the computational budget is low and/or a fast new front wing design is desired, which is a frequent scenario in Formula 1 race car design.The authors want to acknowledge the financial support from the Ramón y Cajal 2021 Excellence Research Grant action from the Spanish Ministry of Science and Innovation (FSE/AGENCIA ESTATAL DE INVESTIGACIÓN), the UMA18-FEDERJA-184 grant, and the Andalusian Research, Development and Innovation Plan (PAIDI—Junta de Andalucia) fundings. Partial funding for open access charge: Universidad de Málag