D Goforth - COSC 4117, fall 20061 Note to 4 th year students  students interested in doing masters degree and those who intend to apply for OGS/NSERC.

Slides:



Advertisements
Similar presentations
Informed search algorithms
Advertisements

Local Search Algorithms
Genetic Algorithm Example based on Koza, J Genetic Programming. Cambridge MA: Basic Books.
LOCAL SEARCH AND CONTINUOUS SEARCH. Local search algorithms  In many optimization problems, the path to the goal is irrelevant ; the goal state itself.
For Friday Finish chapter 5 Program 1, Milestone 1 due.
CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier
Local search algorithms
Local search algorithms
Two types of search problems
Optimization via Search CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Iterative Improvement Algorithms
CS 460 Spring 2011 Lecture 3 Heuristic Search / Local Search.
Trading optimality for speed…
Iterative Improvement Algorithms For some problems, path to solution is irrelevant: just want solution Start with initial state, and change it iteratively.
Review Best-first search uses an evaluation function f(n) to select the next node for expansion. Greedy best-first search uses f(n) = h(n). Greedy best.
CSC344: AI for Games Lecture 4: Informed search
Informed Search Chapter 4 Adapted from materials by Tim Finin, Marie desJardins, and Charles R. Dyer CS 63.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
1 CS 2710, ISSP 2610 R&N Chapter 4.1 Local Search and Optimization.
Informed Search Methods
Local Search and Optimization
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
INTRODUÇÃO AOS SISTEMAS INTELIGENTES Prof. Dr. Celso A.A. Kaestner PPGEE-CP / UTFPR Agosto de 2011.
An Introduction to Artificial Life Lecture 4b: Informed Search and Exploration Ramin Halavati In which we see how information.
Local Search Algorithms This lecture topic Chapter Next lecture topic Chapter 5 (Please read lecture topic material before and after each lecture.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Informed search algorithms
Informed search algorithms
1 Shanghai Jiao Tong University Informed Search and Exploration.
Informed search algorithms Chapter 4. Best-first search Idea: use an evaluation function f(n) for each node –estimate of "desirability"  Expand most.
Iterative Improvement Algorithm 2012/03/20. Outline Local Search Algorithms Hill-Climbing Search Simulated Annealing Search Local Beam Search Genetic.
Local Search Algorithms
Local Search Pat Riddle 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell,
CHAPTER 4, Part II Oliver Schulte Summer 2011 Local Search.
For Friday Finish chapter 6 Program 1, Milestone 1 due.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
For Wednesday Read chapter 6, sections 1-3 Homework: –Chapter 4, exercise 1.
For Wednesday Read chapter 5, sections 1-4 Homework: –Chapter 3, exercise 23. Then do the exercise again, but use greedy heuristic search instead of A*
Princess Nora University Artificial Intelligence Chapter (4) Informed search algorithms 1.
Local Search and Optimization Presented by Collin Kanaley.
When A* doesn’t work CIS 391 – Intro to Artificial Intelligence A few slides adapted from CS 471, Fall 2004, UBMC (which were adapted from notes by Charles.
Feng Zhiyong Tianjin University Fall  Best-first search  Greedy best-first search  A * search  Heuristics  Local search algorithms  Hill-climbing.
Local search algorithms In many optimization problems, the state space is the space of all possible complete solutions We have an objective function that.
Informed search algorithms Chapter 4 Slides derived in part from converted to powerpoint by Min-Yen.
Announcement "A note taker is being recruited for this class. No extra time outside of class is required. If you take clear, well-organized notes, this.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
Chapter 4 (Section 4.3, …) 2 nd Edition or Chapter 4 (3 rd Edition) Local Search and Optimization.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
Lecture 6 – Local Search Dr. Muhammad Adnan Hashmi 1 24 February 2016.
Local Search Algorithms and Optimization Problems
Heuristic Search  Best First Search –A* –IDA* –Beam Search  Generate and Test  Local Searches –Hill Climbing  Simple Hill Climbing  Steepest Ascend.
CPSC 420 – Artificial Intelligence Texas A & M University Lecture 5 Lecturer: Laurie webster II, M.S.S.E., M.S.E.e., M.S.BME, Ph.D., P.E.
Escaping Local Optima. Where are we? Optimization methods Complete solutions Partial solutions Exhaustive search Hill climbing Exhaustive search Hill.
Local Search Algorithms CMPT 463. When: Tuesday, April 5 3:30PM Where: RLC 105 Team based: one, two or three people per team Languages: Python, C++ and.
CMPT 463. What will be covered A* search Local search Game tree Constraint satisfaction problems (CSP)
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
1 Intro to AI Local Search. 2 Intro to AI Local search and optimization Local search: –use single current state & move to neighboring states Idea: –start.
Optimization via Search
CSCI 4310 Lecture 10: Local Search Algorithms
Local Search Algorithms
Artificial Intelligence (CS 370D)
CS621: Artificial Intelligence
Artificial Intelligence
More on HW 2 (due Jan 26) Again, it must be in Python 2.7.
More on HW 2 (due Jan 26) Again, it must be in Python 2.7.
First Exam 18/10/2010.
Local Search Algorithms
CSC 380: Design and Analysis of Algorithms
Local Search Algorithms
Presentation transcript:

D Goforth - COSC 4117, fall Note to 4 th year students  students interested in doing masters degree and those who intend to apply for OGS/NSERC scholarships should complete the required forms and apply before October 19. The forms can be obtained through the research office website.

Optimization Problems searching a space when paths don’t matter

D Goforth - COSC 4117, fall Local search algorithms If paths don’t matter, algorithms are able to ‘jump’ from state to state (ie not follow edges) Example the n queens problem: place n chess queens, n>3, on an n x n chess board so no queen threatens another according to chess rules

D Goforth - COSC 4117, fall Optimisation problems  find maximum value of a function over a parameter state space e.g., one-dimensional = max f(x) over x x f(x)

D Goforth - COSC 4117, fall Optimisation problems e.g., 2-dimensional = max f(x,y) over x,y x f(x,y) y

D Goforth - COSC 4117, fall Algorithms  hill-climbing (~greedy best-first dfs)  weaknesses local optima ridges plateaux  variations on hill-climbing to avoid the traps

D Goforth - COSC 4117, fall Hill climbing

D Goforth - COSC 4117, fall Getting outside the local area  variations on hill-climbing choosing a successor that may not be the optimal (escape by path) random restart (escape by jump) simulated annealing

D Goforth - COSC 4117, fall Getting outside the local area  choosing a successor that may not be the optimal (escape by path)

D Goforth - COSC 4117, fall Getting outside the local area  random restart

D Goforth - COSC 4117, fall Getting outside the local area  simulated annealing random move is generated, probability of moving is based on change in value x f(x)

D Goforth - COSC 4117, fall Simulated annealing  Probability of move function  Probability of making bad move decreases with time +- probability of moving

D Goforth - COSC 4117, fall Avoiding paths altogether  genetic algorithms 1.pick set of states randomly 2.order states by fitness 3.create new set of states by combining state variables of most fit 4.make a few random changes to state variables 5.go to 2

D Goforth - COSC 4117, fall Genetic algorithm example  Guessing a 32 bit sequence  fitness function – number of matching bits (hill-climbing would be better!)

D Goforth - COSC 4117, fall Genetic algorithm example  population size: 4  first generation randomfitness  order: 3,2,1,4  cross 3 x 2 and 3 x 1 for next generation

D Goforth - COSC 4117, fall Genetic algorithm example  crossing 3 x 2 pick random cut point: after 9 th | | recombine crossed pieces | |  crossing 3 x 1 (cut after 21) | | (4 potential new sequences)

D Goforth - COSC 4117, fall Genetic algorithm example  next generation (2 best new combinations replace 2 worst from original population)  repeat