CSE 4705 Artificial Intelligence

Slides:



Advertisements
Similar presentations
Informed search algorithms
Advertisements

Notes Dijstra’s Algorithm Corrected syllabus.
Informed search algorithms
Artificial Intelligence Presentation
An Introduction to Artificial Intelligence
Informed Search Methods Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 4 Spring 2004.
Heuristics CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Solving Problem by Searching
1 Heuristic Search Chapter 4. 2 Outline Heuristic function Greedy Best-first search Admissible heuristic and A* Properties of A* Algorithm IDA*
Search Strategies CPS4801. Uninformed Search Strategies Uninformed search strategies use only the information available in the problem definition Breadth-first.
Problem Solving by Searching
CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier
CS 460 Spring 2011 Lecture 3 Heuristic Search / Local Search.
Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?
CSC344: AI for Games Lecture 4: Informed search
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Informed State Space Search Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Intelligent Systems (2II40) C3 Alexandra I. Cristea September 2005.
1 Shanghai Jiao Tong University Informed Search and Exploration.
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
Informed search algorithms Chapter 4. Best-first search Idea: use an evaluation function f(n) for each node –estimate of "desirability"  Expand most.
ISC 4322/6300 – GAM 4322 Artificial Intelligence Lecture 3 Informed Search and Exploration Instructor: Alireza Tavakkoli September 10, 2009 University.
Review: Tree search Initialize the frontier using the starting state While the frontier is not empty – Choose a frontier node to expand according to search.
Advanced Artificial Intelligence Lecture 2: Search.
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.
Artificial Intelligence for Games Informed Search (2) Patrick Olivier
CSC3203: AI for Games Informed search (1) Patrick Olivier
Informed Search I (Beginning of AIMA Chapter 4.1)
Artificial Intelligence University Politehnica of Bucharest Adina Magda Florea
Search (continued) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Power of Heuristic; non- conventional search.
4/11/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 4, 4/11/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Informed Search II CIS 391 Fall CIS Intro to AI 2 Outline PART I  Informed = use problem-specific knowledge  Best-first search and its variants.
CHAPTER 2 SEARCH HEURISTIC. QUESTION ???? What is Artificial Intelligence? The study of systems that act rationally What does rational mean? Given its.
3.5 Informed (Heuristic) Searches This section show how an informed search strategy can find solution more efficiently than uninformed strategy. Best-first.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lectures 18, 19, 20– A* Monotonicity 2 nd, 6 th and 7 th September, 2010.
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.
For Monday Read chapter 4 exercise 1 No homework.
Romania. Romania Problem Initial state: Arad Goal state: Bucharest Operators: From any node, you can visit any connected node. Operator cost, the.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Chapter 3.5 Heuristic Search. Learning Objectives Heuristic search strategies –Best-first search –A* algorithm Heuristic functions.
Pengantar Kecerdasan Buatan
CSE 4705 Artificial Intelligence
Review: Tree search Initialize the frontier using the starting state
Last time: Problem-Solving
CS 460 Spring 2011 Lecture 4.
Artificial Intelligence (CS 370D)
For Monday Chapter 6 Homework: Chapter 3, exercise 7.
Informed Search Methods
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
The A* Algorithm Héctor Muñoz-Avila.
CSE 4705 Artificial Intelligence
CS 4100 Artificial Intelligence
Artificial Intelligence Informed Search Algorithms
CSE 4705 Artificial Intelligence
CSE 4705 Artificial Intelligence
Week 4 Jan 29th 2016.
Artificial Intelligence
Informed search algorithms
Search Exercise Search Tree? Solution (Breadth First Search)?
Chap 4: Searching Techniques
SEG 4560 Midterm Review.
Artificial Intelligence
Midterm Review.
Reading: Chapter 4.5 HW#2 out today, due Oct 5th
Artificial Intelligence: Theory and Practice Ch. 3. Search
Informed Search.
Presentation transcript:

CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering http://www.engr.uconn.edu/~jinbo

Informed search strategies

Informed search Part I (classical search) Informed = use problem-specific knowledge Best-first search and its variants A* - Optimal search using knowledge Proof of optimality of A* A* for maneuvering AI agents in games Heuristic functions Part II (beyond classical search, Chap 4) Local search and optimization Local search in continuous space Hill climbing, local bean search, …

Informed search Is Uniform cost search the best we can do?

A better idea

The straight-line distance from each city to Bucharest: Start Goal

A heuristic function

Breadth first for games, robots http://theory.stanford.edu/~amitp/GameProgramming/

An optimal informed search (A*)

Breadth first for a world with obstacles Pink: start node; Dark blue: goal Breadth-first search expands many nodes

Informed search (A*) in that world

Greedy best-first search

Greedy best-first search example

Greedy best-first search example

Greedy best-first search example

Greedy best-first search example

Properties of greedy best-first search

Properties of greedy best-first search

Properties of greedy best-first search

A* search

Admissible heuristics

A* search example

A* search example

A* search example

A* search example

A* search example

A* search example

A* search example

Optimality of A* (intuitive)

Optimality of A* using tree search

Optimality of A* using tree search

Properties of A* search

Properties of A* search

Properties of A* search

Properties of A* search

A lemma: Consistency

Creating good heuristic functions Chap 3.6

Heuristic functions

Heuristic functions

Admissible heuristics

Admissible heuristics 8 3+1+2+3+2+2+2+3=18

Relaxed problems

Defining heuristics: h(n)

Dominance

Iterative deepening A* and beyond

Iterative deepening A* and beyond

Informed search II When A* fails – hill climbing, simulated annealing Genetic algorithms

Outline

Local search and optimization

Hill climbing

Hill climbing on a surface of states

Hill climbing search

Hill climbing search example 4

Questions?