Search Heuristic Search vs. Evolutionary Search Prepared by Kirque Leung 18 Mar 05.

Slides:



Advertisements
Similar presentations
Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
Advertisements

Heuristic Searches. Feedback: Tutorial 1 Describing a state. Entire state space vs. incremental development. Elimination of children. Closed and the solution.
Heuristic Search techniques
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
GENETICA The problem-solving approach proposed here, largely based on the previous remarks, is implemented through the computer language GENETICA. GENETICA.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
The Decision-Making Process IT Brainpower
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Chapter 14: Usability testing and field studies. Usability Testing Emphasizes the property of being usable Key Components –User Pre-Test –User Test –User.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Imagine that I am in a good mood Imagine that I am going to give you some money ! In particular I am going to give you z dollars, after you tell me the.
EXPERT SYSTEMS Part I.
STATISTICAL INFERENCE PART VI
Genetic Algorithms: A Tutorial
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Requirements II: Task Analysis. Objectives By the end of the class, you will be able to… Write detailed task descriptions to inform design. Create scenarios.
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice A. J. Gonzalez and D. D. Dankel.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Lily  It is the kind of writing used in high school and college classes.  Academic writing is different from creative writing, which is the kind.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
CS440 Computer Science Seminar Introduction to Evolutionary Computing.
PSO and ASO Variants/Hybrids/Example Applications & Results Lecture 12 of Biologically Inspired Computing Purpose: Not just to show variants/etc … for.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Heuristic Optimization Methods Greedy algorithms, Approximation algorithms, and GRASP.
Pei-Chuan Tsai Chih-Ming Chen Ying-ping Chen WCCI 2012 IEEE World Congress on Computational Intelligence Sparse Degrees Analysis for LT Codes Optimization.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Advanced Computer Architecture & Processing Systems Research Lab Framework for Automatic Design Space Exploration.
Interactive Evolution in Automated Knowledge Discovery Tomáš Řehořek March 2011.
Political Competition The Role of Interest Groups.
Biologically Inspired Computation Ant Colony Optimisation.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
INTRO TO OPTIMIZATION MATH-415 Numerical Analysis 1.
Introduction to Machine Learning © Roni Rosenfeld,
ITEC 1010 Information and Organizations Chapter V Expert Systems.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Artificial Intelligence Lecture No. 8 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Overview Last two weeks we looked at evolutionary algorithms.
Universidad de Santiago de Chile Facultad de Humanidades Departamento de Lingüística y Literatura Lingüística Aplicada.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolutionary Algorithms Jim Whitehead
Unit 7 Part II: Cognition
Heuristic Optimization Methods Optimization as Search
An Act of Kindness -
C.-S. Shieh, EC, KUAS, Taiwan
An Introduction to Open Space Method Andy Gibbs
Informed Search and Exploration
Knowledge Representation
Introduction Artificial Intelligent.
Announcements Homework 3 due today (grace period through Friday)
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
KNOWLEDGE REPRESENTATION
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Ch. 1 Vocabulary Alice.
Presentation transcript:

Search Heuristic Search vs. Evolutionary Search Prepared by Kirque Leung 18 Mar 05

AI-based creativity research  Knowledge-based systems incorporation of expert knowledge in some domains, usually in the form of rules incorporation of expert knowledge in some domains, usually in the form of rules  Grammars alternative way of representing knowledge in a particular domain  grammar vs. narrative alternative way of representing knowledge in a particular domain  grammar vs. narrative grammars embody rules about languages  their role in creativity stems from viewing designs or compositions as statements in a language grammars embody rules about languages  their role in creativity stems from viewing designs or compositions as statements in a language it concerns the attempt to computationally understand natural languages, or translate between them it concerns the attempt to computationally understand natural languages, or translate between them

Con’t  Search The long journey (made speedier via computation) through an immersive space of possibilities in search of something suitable  production of space (journey vs. computation) The long journey (made speedier via computation) through an immersive space of possibilities in search of something suitable  production of space (journey vs. computation) 2 kinds of search: Heuristic search and evolutionary search 2 kinds of search: Heuristic search and evolutionary search

Heuristic Search  A solution, perhaps a design, a schedule or so forth is constructed gradually, bit by bit, with heuristics (rules of thumb) employed to decide ho to choose each successive part  Heuristics are used to decide which link to explore next  Pretty fuzzy about the next move, it concentrates on exploring areas that are sanctioned by the heuristics in used

Evolutionary Search (Computation)  The use of search algorithm  a computational problem is defined in terms of a search space, usually viewed as a massive collection of potential solutions to the problem (The process of search = task of navigating that space) (The process of search = task of navigating that space)

Con’t  Points closer together in space will also tend to be close in terms of quality, and qualities are derived from the search parameters  one move = change in 1 parameter distance in space is related to distance in terms of parameter settings distance in space is related to distance in terms of parameter settings Idea of close-ness Idea of close-ness  ES makes use of previously visited solutions to help decide where to look next

Con’t  ES doesn ’ t work with 1 solution at a time but a large collection of population of solution at once  local search  ES doesn ’ t allow evolution but it does show some emergent properties  Better solutions are allowed to have “ child ”, and the worse ones to “ die ”  imitation of the nature Population control  optimization (search for the best) Population control  optimization (search for the best)  ES searches the space in parallel

Con’t  In non-euclidean geometry, objects of smaller size on the tableau do not represent a further distance from us, but showing a sense of spatial interiority