AI Applications in Genetic Algorithms

Similar documents
GAME THEORY. By: Rishika and Nithya 12/04/13

CSE 473: Ar+ficial Intelligence

IAIP: INTELLIGENT SYSTEMS APPLIED TO INDUSTRIAL PROCESSES SPECIAL SESSION AT INTELLI 2017

Searching for Solu4ons. Searching for Solu4ons. Example: Traveling Romania. Example: Vacuum World 9/8/09

Advanced Game AI. Level 6 Search in Games. Prof Alexiei Dingli

Local Search: Hill Climbing. When A* doesn t work AIMA 4.1. Review: Hill climbing on a surface of states. Review: Local search and optimization

The Genetic Algorithm

CPS331 Lecture: Genetic Algorithms last revised October 28, 2016

DNA Solu)ons for Brick Walls And Adop)on

Introduc)on to So,ware Engineering

BIL 682 Ar+ficial Intelligence

Introduc)on to Ar)ficial Intelligence

! FTDNA! Ancestry. ! 23andMe. ! Medical Considera,ons. ! Iden,fying family medical history. ! Communica,ng with the medical community

Creating a Dominion AI Using Genetic Algorithms

CS 441/541 Artificial Intelligence Fall, Homework 6: Genetic Algorithms. Due Monday Nov. 24.

Optimization of Tile Sets for DNA Self- Assembly

GENETIC PROGRAMMING. In artificial intelligence, genetic programming (GP) is an evolutionary algorithmbased

ARRANGING WEEKLY WORK PLANS IN CONCRETE ELEMENT PREFABRICATION USING GENETIC ALGORITHMS

Louisiana Photographic Society Monthly Compe::on Guidelines

LANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS

Table of Contents. In the examinaon of the portfolio theory, the. The successful posioning of a brand implies at. Articles.

Lesson A7 - Counting Techniques and Permutations. Learning Goals:

Game AI Overview. What is Ar3ficial Intelligence. AI in Games. AI in Game. Scripted AI. Introduc3on

TJHSST Senior Research Project Evolving Motor Techniques for Artificial Life

Developing Conclusions About Different Modes of Inheritance

Computa(onal Vision Introduc(on and Overview. Lecture 1: Introduc(on Hamid Dehghani Office: UG38

6.02 Fall 2013 Lecture #7

Automated Software Engineering Writing Code to Help You Write Code. Gregory Gay CSCE Computing in the Modern World October 27, 2015

AI in Tabletop Games. Team 13 Josh Charnetsky Zachary Koch CSE Professor Anita Wasilewska

recap Describing a state. En're state space vs. incremental development. Elimina'on of children. the solu'on path. Genera'on of children.

New methods for es-ma-ng species trees from genome-scale data. Tandy Warnow The University of Illinois

SOCI 360. SociAL Movements. Community Change. sociology.morrisville.edu. Professor Kurt Reymers, Ph.D. And

Need a little help with the lab?

New landscape of compu)ng Personalized and targeted compu)ng

Agent based Modeling and Simula3on to study complex and interdependent systems

STI policies Theore.cal underpinnings and measurement issues

SECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM

USING GENETIC ALGORITHMS TO EVOLVE CHARACTER BEHAVIOURS IN MODERN VIDEO GAMES

A Novel approach for Optimizing Cross Layer among Physical Layer and MAC Layer of Infrastructure Based Wireless Network using Genetic Algorithm

Differen'a'ng tradi'onal and popular music by analyzing the social structure of fame: a computer simula'on of fan- ar'st affilia'on networks

What is AI? Ar)ficial Intelligence. What is AI? What is AI? 9/4/09

Genetic Algorithm Based Charge Optimization of Lithium-Ion Batteries in Small Satellites. Saurabh Jain Dan Simon

Op(cal Lens Design Op#cal lens design is the science, art of calcula#ng the various lens construc#on parameters that will meet or at least

GOLEM Integrated Microelectronics Solutions GmbH Serguei Golovanov, PhD, Dipl.Eng

Balanced Map Generation using Genetic Algorithms in the Siphon Board-game

A Factorial Representation of Permutations and Its Application to Flow-Shop Scheduling

DECISION MAKING TECHNIQUES FOR COGNITIVE RADIOS

Build Order Optimization in StarCraft

Thinking. Design. Principles of. Thinking Like a Designer From Idea to Business

Exercise 4 Exploring Population Change without Selection

Solving Sudoku with Genetic Operations that Preserve Building Blocks

Op#mal Control of Non- determinis#c Systems for a Fragment of Temporal Logic

Inverter Current Control in Weak Distribu3on Grids. Christoph Kammer, Alireza Karimi Automa3c Control Laboratory EPFL

Chapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM

THE problem of automating the solving of

Evolving Neural Networks to Focus. Minimax Search. David E. Moriarty and Risto Miikkulainen. The University of Texas at Austin.

Kinship and Population Subdivision

Grant Proposals: How to Write and Argue Effectively

Contributed by "Kathy Hallett"

Techniques for Designing GPGPU Games. Mark Joselli Esteban Clua

Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters

6.02 Fall 2014 Lecture #1

The Behavior Evolving Model and Application of Virtual Robots

UCLA Presentations. Title. Permalink. Author. Publication Date. If Data Sharing is the Answer, What is the Question?

Democra(zing Data Science

Games and Adversarial Search. CS171, Fall 2016 Introduc=on to Ar=ficial Intelligence Prof. Alexander Ihler

SingularityNET. The pla(orm for the decentralized AI economy

Nineteenth-Century Progress. Inven3ons to Make Life Easier

NUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME

46.1 Introduction. Foundations of Artificial Intelligence Introduction MCTS in AlphaGo Neural Networks. 46.

ProBeam: A Prac,cal Mul,cell Beamforming System for Small- cell Networks

An Explore Mars BE BOLD technical project. Sanford Morton Emily Briere Cassidy Chan

Shared Networks and the Evolu;on towards 5G

Beyond Buzzwords: Emerging Technologies That Matter

Wire Layer Geometry Optimization using Stochastic Wire Sampling

Inbreeding and self-fertilization

New employment opportuni/es in the context of digitaliza/on: The case of Greece ARTEMIS SAITAKIS DIRECTOR, SCIENCE & TECHNOLOGY PARK OF CRETE

Creative Commons: Attribution 3.0 Hong Kong License

The Octagonal Harp. Music 8903 Design Project - Prof. Hsu. Garrett Osborne Due Nov. 24, 2015 OCTAGONAL HARP REPORT

Comp 3211 Final Project - Poker AI

IMPROVING COST ESTIMATION IN AN ERA OF INNOVATION. Gary Oleson TASC, an Engility Company,

Population Genetics 3: Inbreeding

1_Q&A. The views expressed in this presenta0on do not necessarily reflect the views of AT&T.

Neural Networks for Real-time Pathfinding in Computer Games

CYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS

Pedigrees How do scientists trace hereditary diseases through a family history?

A Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem

Optimum Coordination of Overcurrent Relays: GA Approach

K.1 Structure and Function: The natural world includes living and non-living things.

Disintermedia+on 2.0 Librarians and Systems. Rory Litwin FIP February 5, 2010 University of Alberta SLIS

Artificial Intelligence

INFO/CS 4302 Web Informa6on Systems

Rod Hagen. Tradi&onal Naming Prac&ces & Indigenous Birth Registra&on: Its not just a ma;er of ge=ng the numbers up!

A Review on Genetic Algorithm and Its Applications

Introduction to Computer Engineering

Human Pedigree Genetics Answer Key

Monte Carlo Tree Search and AlphaGo. Suraj Nair, Peter Kundzicz, Kevin An, Vansh Kumar

A robust method for deblurring and decoding a barcode image

Printer Model + Genetic Algorithm = Halftone Masks

Game Theory: From Zero-Sum to Non-Zero-Sum. CSCI 3202, Fall 2010

Transcription:

AI Applications in Genetic Algorithms CSE 352 Anita Wasilewska TEAM 6 Johnson Lu Sherry Ko Taqrim Sayed David Park 1

Works Cited https://www.mathworks.com/discovery/genetic-algorithm.html https://www.mathworks.com/help/gads/what-is-the-genetic-algorithm.html?requesteddomain=www.mathworks.com http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol1/hmw/article1.html https://github.com/codingtrain/rainbow-code/blob/master/codingchallenges/cc_29_smartrockets/dna.js https://www.whitman.edu/documents/academics/mathematics/2014/carrjk.pdf https://ti.arc.nasa.gov/m/pub-archive/1244h/1244%20(hornby).pdf https://www.inverse.com/article/35449-elon-musk-dota-2-openai-the-international-dendi-1v1 https://www.wired.com/2010/11/genetic-algorithms-starcraft/ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.463.9245&rep=rep1&type=pdf http://learn.genetics.utah.edu/content/basics/ http://www.talkorigins.org/faqs/genalg/genalg.html#examples:routing http://www.boente.eti.br/fuzzy/ebook-fuzzy-mitchell.pdf 2

Overview 1. What is Genetics? 2. What are Genetic Algorithms? 3. Brief History of Genetic Algorithms? 4. Genetic Algorithm Process 5. Example Code 6. Genetic Algorithms In Action 7. Useful Applications 8. Limitations 3

What is Genetics? Gene?cs is the study of Genes and Heredity. Genes are made up of sequences of DNA How offspring share traits with their parents Each person has a unique set of genes - this determines the features and characteris?cs present in each individual Even though our DNA is largely the same, the existence of slight variances from person to person makes us all different. Parents will pass on certain genes, muta?ons can cause some genes to change http://learn.genetics.utah.edu/content/basics/ 4

What are Genetic Algorithms? Gene?c Algorithms is the process of improving AI by having them replicate evolu?on. The points are placed into nodes that represent an itera?on of the AI and then are randomly selected and paired together to have child nodes who host an assortment of rules from both nodes. These nodes are then randomly selected again and paired un?l eventually an op?mal solu?on is found. The rules it follows are: Selec%on Rule, which chooses nodes to carry over to a next genera?on; Crossover Rules, combining two nodes to create an improved node; Muta%on Rule, which randomly alters the code passed down to the next genera?on. https://www.mathworks.com/discovery/genetic-algorithm.html https://www.mathworks.com/help/gads/what-is-the-genetic-algorithm.html?requesteddomain=www.mathworks.com 5

History of Genetic Algorithms The start of gene?c algorithms began in 1953 by Nils Barricelli and the goal was ini?ally to create ar?ficial life. Barricelli created the first gene?c algorithm which was later picked up in 1957 by biologist Alexander Fraser to study the path of evolu?on. While it was intended to study evolu?on and gene?cs, computer scien?sts found that gene?c algorithms were methods to solve complex problems and op?miza?on. Gene?c algorithms have an advantage over tradi?onal methods because they use a wide range of candidate solu?ons to op?mize a problem rather than looking for a single solu?on. https://www.whitman.edu/documents/academics/mathematics/2014/carrjk.pdf page 17 6

History (Cont.) In 1975, John Holland published a book called Adap%on in Natural and Ar%ficial Systems, which outlines the more recent specifics of gene?c algorithms The idea of a popula?on was a major innova?on to the field In lieu of evolu?onary computa?ons, these gene?c algorithms uses gene?c operators to determine the changes that a new popula?on will have In more recent years, the boundaries between this original defini?on of gene?c algorithms and their evolu?onary siblings have blurred hyp://www.boente.e?.br/fuzzy/ebook- fuzzy- mitchell.pdf 7

Genetic Algorithms Process Gene?c Algorithms ini?alize a large amount of nodes, known as popula?on of genes to create a viable set that will be broken down into the most op?mal solu?on. Gene?c Algorithms apply a fitness algorithm to judge the quality of the popula?on. The fitness algorithm is unique to the applica?on it is applied to. Earlier itera?ons of the Gene?c Algorithm have an extremely low fitness while later itera?ons are extremely fit. https://cs.stanford.edu/people/eroberts/courses/soco/projects/1997-98/genetic-algorithms/algo.html 8

Genetic Algorithms Process (CONT.) Gene?c algorithms use gene?c operators to gear the algorithm towards a correct solu?on. There are three gene?c operators Selec%on, Crossover, and Muta%on. Selec?on operators tells the algorithm what proper?es a candidate solu?on should have to be considered a good or be>er solu?on. Selec?on is analogous to the fitness property found in evolu?on. Crossover operators tells the algorithm what proper?es a candidate solu?on should adopt from its parent solu?on in order to find the best combina?on solu?on. Muta?on operators allows candidate solu?ons to create gene?c diversity and widen the pool of possible candidate solu?ons. Muta?on operators are an integral part of gene?c algorithms because they add complexity to the pool of candidate solu?ons, making it possible to solve complex problems. http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol1/hmw/article1.html 9

Example Code of an Genetic Algorithm https://github.com/codingtrain/rainbow-code/blob/master/codingchallenges/cc_29_smartrockets/dna.js 10

Example Code of an Genetic Algorithm https://i.gr-assets.com/images/s/compressed.photo.goodreads.com/books/1363560350i/17622418._uy200_.jpg https://github.com/codingtrain/rainbow-code/blob/master/codingchallenges/cc_29_smartrockets/dna.js 11

Genetic Algorithms in ACTION hyps://youtu.be/xcinbphgt7m?t=22s 12

Scheduling A very prac?cal applica?on Applies to many different situa?ons Seems like a rela?vely simple problem, but due to the existence of both hard and sod constraints means it is a NP- complete problem Hard constraints such as two tests can t be in the same room at the same?me Sod constraints such as fa?gue/ morale of workers Remember to include a source of any picture, of slides copied from a source or any DIRECT cita?on on the boyom of each of http://www.talkorigins.org/faqs/genalg/genalg.html#examples:routing your slides where it appears. REFERENCES are very important. You must be clear about the dis?nc?on between the informa?on from a source and your own statements. 13

The Evolved Antenna NASA developed an evolved antenna design using gene?c algorithms to find the most op?mal radia?on payerns for use on the ST5 spacecrad. Compared to standard antenna designs, the evolved antenna designs were 80% efficient with one antenna and 93% efficiency with two antennas. http://www.jeffreythompson.org/blog/wp-content/uploads/2015/05/geneticallygrownantennas_nasa-web-1024x441.jpg Remember to include a source of any picture, of slides copied from a source or any DIRECT cita?on on the boyom of each of https://ti.arc.nasa.gov/m/pub-archive/1244h/1244%20(hornby).pdf your slides where it appears. REFERENCES are very important. You must be clear about the dis?nc?on between the informa?on from a source and your own statements. 14

OpenAI Dota 2 Bot OpenAI is a project of Elon Musk to see whether a bot would be able to beat a professional player in the game Dota 2. The bot was not told any basic rules of the game, and was let loose on Dota 2 servers to learn basic techniques. Eventually the bot was able to perform high level techniques consistently. Eventually several pro players were versed in a 1v1 compe??on and had consistently beaten every player it was up against. https://www.inverse.com/article/35449-elon-musk-dota-2-openai-the-international-dendi-1v1 15

Genetic Algorithms in StarCraft A program called Evolu?on Chamber uses gene?c algorithms to find the perfect tac?cs for the game StarCrad. It starts by allowing the user to set up a list of basic ac?ons It runs a gene?c algorithm with these ac?ons as chromosome. The algorithm run many cycles to find the best popula?on strategy. Remember to include a source of any picture, of slides copied from a source or any DIRECT cita?on on the boyom of each ohttps://www.wired.com/2010/11/genetic-algorithms-starcraft/ f your slides where it appears. REFERENCES are very important. You must https://www.theverge.com/2017/4/19/15353282/download-starcraft-1-free-brood-war-blizzard be clear about the dis?nc?on between the informa?on from a source and your own statements. 16

Limitations Speed is highly depended on the ini?al popula?on Takes days to find a solu?on The solu?on may not be the best solu?on http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.463.9245&rep=rep1&type=pdf 17

QUESTIONS? 18