Research Trends in AI Maze Solving using GA Muhammad Younas 2005-02-0110 Hassan Javaid 2005-02-0304 Danish Hussain 2006-02-0225.

Slides:



Advertisements
Similar presentations
Algorithm Design Techniques
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Exact and heuristics algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
A PARALLEL GENETIC ALGORITHM FOR SOLVING THE SCHOOL TIME TABLING PROBLEM SUMALATHA.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
The Use of Linkage Learning in Genetic Algorithms By David Newman.
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Introduction to Genetic Algorithms Yonatan Shichel.
Research Trends in Artificial Intelligence Muhammad Younas Hassan Javid Danish Shah
Genetic Algorithm for Variable Selection
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Chapter 14 Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
GAlib A C++ Library of Genetic Algorithm Components Vanessa Herves Gómez Department of Computer Architecture and Technology,
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
1 Chapter 14 Genetic Algorithms. 2 Chapter 14 Contents (1) l Representation l The Algorithm l Fitness l Crossover l Mutation l Termination Criteria l.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
Evolution Programs (insert catchy subtitle here).
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Introduction to Genetic Algorithm Principle: survival-of-the-fitness Characteristics of GA Robust Error-tolerant Flexible When you have no idea about solving.
Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Genetic Algorithms MITM613 (Intelligent Systems).
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
AN OPTIMIZATION DESIGN OF ARTIFICIAL HIP STEM BY GENETIC ALGORITHM AND PATTERN CLASSIFICATION.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Warehouse Lending Optimization Paul Parker (2016).
Genetic Algorithm (Knapsack Problem)
Introduction to Genetic Algorithms
Using GA’s to Solve Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Genetic Algorithms.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
A Study of Genetic Algorithms for Parameter Optimization
Genetic Algorithms CPSC 212 Spring 2004.
EE368 Soft Computing Genetic Algorithms.
GA.
Presentation transcript:

Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain

Flash Back In the last presentation we showed our implementation of two functions. One of them was the mutate function and the other was the cross over function. In this presentation we have identified many other functions that we will be needing for project and we have made the pseudo code of many of them and have implemented some of them.

Functions 1. Mutate Takes a genome, returns the same genome with some of the bits flipped. 2. Cross Over Takes 2 genomes, performs one-point crossover on them to produce two new genomes. 3. Mate Takes 2 individuals and performs crossover on their genomes to get 2 new genomes. It then mutates the new genomes. Finally, it makes 2 new individuals with dummy values for fitness and phenome.

Functions continued Selecting an Individual Takes a population of individuals. Chooses a single individual randomly and returns that individual. This random choice is based on the fitness value of a genome in the population Random Population Takes a population size and number of genes in each genome and generates a population of individuals with random genomes Random Genome This function takes a genome-length and returns a random genome of that length.

Functions continued Make and Access individual's components This function will takes a fitness, genome and phenome and returns a list containing these items. Run Genetic Algorithm It creates an initial population with random-pop and then does the following things for each generation: * Creates the phenome for each individual in the population. * Evaluates the fitness of each individual. * Selects individuals and mates them to produce the new generation

Simulation Plan Simulations would be run on a variety of mazes to ensure the reliability of the algorithm Fitness value would be determined by the number of steps taken in the maze This fitness value could be changed to obtain the optimal results in the simulation

Testing Genetic Algorithm It will be good to make sure that there are enough genes to at least allow the robot to finish the maze. We have researched that it is always useful to have large populations. How much it is useful we will see once we have implemented the whole GA.

Reference Information Please refer to our previous presentation for a tentative GUI The Mutate and Crossover function are also present in our previous presentation Simulations results would be presented next week when implementation is complete

Q & A