Physical Sciences and Mathematics Commons^™

Genetic Algorithm Optimization Of Experiment Design For Targeted Uncertainty Reduction, Alexander Amedeo Depillis

Masters Theses

Nuclear cross sections are a set of parameters that capture probability information about various nuclear reactions. Nuclear cross section data must be experimentally measured, and this results in simulations with nuclear data-induced uncertainties on simulation outputs. This nuclear data-induced uncertainty on most parameters of interest can be reduced by adjusting the nuclear data based on the results from an experiment. Integral nuclear experiments are experiments where the results are related to many different cross sections. Nuclear data may be adjusted to have less uncertainty by adjusting them to match the results obtained from integral experiments. Different integral experiments will adjust …

An Efficient Hybrid Genetic Algorithm For The Quadratic Traveling Salesman Problem, Quang Anh Pham, Hoong Chuin Lau, Minh Hoang Ha, Lam Vu

Research Collection School Of Computing and Information Systems

The traveling salesman problem (TSP) is the most well-known problem in combinatorial optimization which hasbeen studied for many decades. This paper focuses on dealing with one of the most difficult TSP variants named thequadratic traveling salesman problem (QTSP) that has numerous planning applications in robotics and bioinformatics.The goal of QTSP is similar to TSP which finds a cycle visiting all nodes exactly once with minimum total costs. However, the costs in QTSP are associated with three vertices traversed in succession (instead of two like in TSP). This leadsto a quadratic objective function that is much harder to solve.To efficiently solve …

Research On Unmanned Swarm Combat System Adaptive Evolution Model Simulation, Zhiqiang Li, Yuanlong Li, Laixiang Yin, Xiangping Ma

Journal of System Simulation

Abstract: Aiming at the fact that the intelligent unmanned swarm combat system is mainly composed of large-scale combat individuals with limited behavioral capabilities and has limited ability to adapt to the changes of battlefield environment and combat opponents, a learning evolution method combining genetic algorithm and reinforcement learning is proposed to construct an individual-based unmanned bee colony combat system evolution model. To improve the adaptive evolution efficiency of bee colony combat system, an improved genetic algorithm is proposed to improve the learning and evolution speed of bee colony individuals by using individual-specific mutation optimization strategy. Simulation experiment on …

Research And Simulation On Control Algorithm For Multi-Objective Optimization Of Urban Rail Train, Jianjun Meng, Minggao Pei, Wu Fu, Tengzhou Wei, Hao Shuai

Journal of System Simulation

Abstract: According to the characteristics of urban rail train running multiple objective, the multi-objective operation model for urban rail train was established with the energy consumption, punctuality, accurate parking and comfort level as the optimization indexes. Genetic algorithms was used to optimize running multi-objective model of urban rail train, and according to train traction calculation and computer simulation, the train running target curve was obtained. The fuzzy control and PID control algorithm were applied to urban rail train system to establish adaptive fuzzy PID controller and PID control in order to track the target curve. Simulation results show that adaptive …

Algebraic Neural Architecture Representation, Evolutionary Neural Architecture Search, And Novelty Search In Deep Reinforcement Learning, Ethan C. Jackson

Electronic Thesis and Dissertation Repository

Evolutionary algorithms have recently re-emerged as powerful tools for machine learning and artificial intelligence, especially when combined with advances in deep learning developed over the last decade. In contrast to the use of fixed architectures and rigid learning algorithms, we leveraged the open-endedness of evolutionary algorithms to make both theoretical and methodological contributions to deep reinforcement learning. This thesis explores and develops two major areas at the intersection of evolutionary algorithms and deep reinforcement learning: generative network architectures and behaviour-based optimization. Over three distinct contributions, both theoretical and experimental methods were applied to deliver a novel mathematical framework and experimental …

Rvm Soft Sensing Model Based On Optimized Combined Kernel Function, Yanan Zhang, Huizhong Yang

Journal of System Simulation

Abstract: An RVM spft sensingmodeling method based onthe optimizedcombined kernel functionis proposed.In order to simultaneously get better prediction and sparsity, a fitness function synthesizing regression accuracy and sparsity is created while constructing a combined kernel functionfor RVM.The genetic algorithm is used to optimize the weights and kernel parametersof the RVMcombined kernel.The proposed method is used totomodela cleavage-recovery unit in the production process of Bisphenol-A.The results show that it can guarantee better sparsity andregression accuracy than the general SVM combinedkernel model andGA-RVM single kernel model.

Computational Modeling Of Trust Factors Using Reinforcement Learning, C. M. Kuzio, A. Dinh, C. Stone, L. Vidyaratne, K. M. Iftekharuddin

Electrical & Computer Engineering Faculty Publications

As machine-learning algorithms continue to expand their scope and approach more ambiguous goals, they may be required to make decisions based on data that is often incomplete, imprecise, and uncertain. The capabilities of these models must, in turn, evolve to meet the increasingly complex challenges associated with the deployment and integration of intelligent systems into modern society. Historical variability in the performance of traditional machine-learning models in dynamic environments leads to ambiguity of trust in decisions made by such algorithms. Consequently, the objective of this work is to develop a novel computational model that effectively quantifies the reliability of autonomous …

Investigating Genetic Algorithm Optimization Techniques In Video Games, Nathan Ambuehl

Undergraduate Honors Theses

Immersion is essential for player experience in video games. Artificial Intelligence serves as an agent that can generate human-like responses and intelligence to reinforce a player’s immersion into their environment. The most common strategy involved in video game AI is using decision trees to guide chosen actions. However, decision trees result in repetitive and robotic actions that reflect an unrealistic interaction. This experiment applies a genetic algorithm that explores selection, crossover, and mutation functions for genetic algorithm implementation in an isolated Super Mario Bros. pathfinding environment. An optimized pathfinding AI can be created by combining an elitist selection strategy with …

A Genetic Algorithmic Approach To Automated Auction Mechanism Design, Jinzhong Niu, Simon Parsons

Publications and Research

In this paper, we present a genetic algorithmic approach to automated auction mechanism design in the context of \cat games. This is a follow-up to one piece of our prior work in the domain, the reinforcement learning-based grey-box approach. Our experiments show that given the same search space the grey-box approach is able to produce better auction mechanisms than the genetic algorithmic approach. The comparison can also shed light on the design and evaluation of similar search solutions to other domain problems.

Darwin: A Ground Truth Agnostic Captcha Generator Using Evolutionary Algorithm, Eric Y. Chen, Lin-Shung Huang, Ole J. Mengshoel, Jason D. Lohn

Ole J Mengshoel

Feedback Control For Multi-Modal Optimization Using Genetic Algorithms, Jun Shi, Ole J. Mengshoel, Dipan K. Pal

Ole J Mengshoel

Evaluating Heuristics And Crowding On Center Selection In K-Means Genetic Algorithms, William Mcgarvey

CCE Theses and Dissertations

Data clustering involves partitioning data points into clusters where data points within the same cluster have high similarity, but are dissimilar to the data points in other clusters. The k-means algorithm is among the most extensively used clustering techniques. Genetic algorithms (GA) have been successfully used to evolve successive generations of cluster centers. The primary goal of this research was to develop improved GA-based methods for center selection in k-means by using heuristic methods to improve the overall fitness of the initial population of chromosomes along with crowding techniques to avoid premature convergence. Prior to this research, no rigorous systematic …

Adaptive Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severinio Galan, Antonio De Dios

Ole J Mengshoel

A Novel Mating Approach For Genetic Algorithms, Severino Galan, Ole J. Mengshoel, Rafael Pinter

Ole J Mengshoel

Comparing Ai Archetypes And Hybrids Using Blackjack, Robert Edward Noonan

All Graduate Theses, Dissertations, and Other Capstone Projects

The discipline of artificial intelligence (AI) is a diverse field, with a vast variety of philosophies and implementations to consider. This work attempts to compare several of these paradigms as well as their variations and hybrids, using the card game of blackjack as the field of competition. This is done with an automated blackjack emulator, written in Java, which accepts computer-controlled players of various AI philosophies and their variants, training them and finally pitting them against each other in a series of tournaments with customizable rule sets. In order to avoid bias towards any particular implementation, the system treats each …

Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan

Ole J Mengshoel

Exploitation Of Self Organization In Uav Swarms For Optimization In Combat Environments, Dustin J. Nowak

Theses and Dissertations

This investigation focuses primarily on the development of effective target engagement for unmanned aerial vehicle (UAV) swarms using autonomous self-organized cooperative control. This development required the design of a new abstract UAV swarm control model which flows from an abstract Markov structure, a Partially Observable Markov Decision Process. Self-organization features, bio-inspired attack concepts, evolutionary computation (multi-objective genetic algorithms, differential evolution), and feedback from environmental awareness are instantiated within this model. The associated decomposition technique focuses on the iterative deconstruction of the problem domain state and dynamically building-up of self organizational rules as related to the problem domain environment. Resulting emergent …

Discovery Learning In Autonomous Agents Using Genetic Algorithms, Edward O. Gordon

Theses and Dissertations

As the new Distributed Interactive Simulation (DIS) draft standard evolves into a useful document and distributed simulations begin to emerge that implement parts of the standard, there is renewed interest in available methods to effectively control autonomous aircraft agents in such a simulated environment. This investigation examines the use of a genetics-based classifier system for agent control. These are robust learning systems that use the adaptive search mechanisms of genetic algorithms to guide the learning system in forming new concepts (decision rules) about its environment. By allowing the rule base to evolve, it adapts agent behavior to environmental changes. Addressed …