CSCI 4310 Lecture 2: Search. Search Techniques Search is Fundamental to Many AI Techniques.

Slides:



Advertisements
Similar presentations
Artificial Intelligent
Advertisements

Artificial Intelligence: Knowledge Representation
Review: Search problem formulation
Heuristic Search techniques
Announcements Course TA: Danny Kumar
Uninformed search strategies
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Artificial Intelligence Solving problems by searching
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Solving Problem by Searching
Part2 AI as Representation and Search
1 Lecture 3 Uninformed Search. 2 Uninformed search strategies Uninformed: While searching you have no clue whether one non-goal state is better than any.
CS 480 Lec 3 Sept 11, 09 Goals: Chapter 3 (uninformed search) project # 1 and # 2 Chapter 4 (heuristic search)
Blind Search1 Solving problems by searching Chapter 3.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
Solving Problem by Searching Chapter 3. Outline Problem-solving agents Problem formulation Example problems Basic search algorithms – blind search Heuristic.
Touring problems Start from Arad, visit each city at least once. What is the state-space formulation? Start from Arad, visit each city exactly once. What.
CSC 423 ARTIFICIAL INTELLIGENCE
Uninformed Search Jim Little UBC CS 322 – Search 2 September 12, 2014
UNINFORMED SEARCH Problem - solving agents Example : Romania  On holiday in Romania ; currently in Arad.  Flight leaves tomorrow from Bucharest.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
Review: Search problem formulation
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2004.
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
1 Lecture 3 Uninformed Search. 2 Complexity Recap (app.A) We often want to characterize algorithms independent of their implementation. “This algorithm.
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?
CSCI 5582 Fall 2006 Page 1 CSCI 5582 Artificial Intelligence Lecture 3 Jim Martin.
Blind Search-Part 2 Ref: Chapter 2. Search Trees The search for a solution can be described by a tree - each node represents one state. The path from.
Using Search in Problem Solving
CS 188: Artificial Intelligence Spring 2006 Lecture 2: Queue-Based Search 8/31/2006 Dan Klein – UC Berkeley Many slides over the course adapted from either.
Solving problems by searching
Search  Exhaustive/Blind Search Methods Depth First Search Breadth First Search  Heuristic Methods Hill Climbing Beam Search Best First Search…
1 Lecture 3 Uninformed Search
Problem-solving agents
Intro to AI, Fall 2004 © L. Joskowicz 1 Introduction to Artificial Intelligence LECTURE 3: Uninformed Search Problem solving by search: definitions Graph.
For Friday Finish chapter 3 Homework: –Chapter 3, exercise 6 –May be done in groups. –Clarification on part d: an “action” must be running the program.
Artificial Intelligence Course outline Introduction Problem solving Generic algorithms Knowledge Representation and Reasoning Expert Systems Uncertainty.
Review: Search problem formulation Initial state Actions Transition model Goal state (or goal test) Path cost What is the optimal solution? What is the.
Computer Science CPSC 322 Lecture 4 Search: Intro (textbook Ch: ) 1.
1 Solving problems by searching This Lecture Chapters 3.1 to 3.4 Next Lecture Chapter 3.5 to 3.7 (Please read lecture topic material before and after each.
Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l inference l all learning.
How are things going? Core AI Problem Mobile robot path planning: identifying a trajectory that, when executed, will enable the robot to reach the goal.
CS 415 – A.I. Slide Set 5. Chapter 3 Structures and Strategies for State Space Search – Predicate Calculus: provides a means of describing objects and.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 02 : Search.
Search with Costs and Heuristic Search 1 CPSC 322 – Search 3 January 17, 2011 Textbook §3.5.3, Taught by: Mike Chiang.
Lecture 3: Uninformed Search
Search CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Lecture 3: 18/4/1435 Searching for solutions. Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Advanced Artificial Intelligence Lecture 2: Search.
A General Introduction to Artificial Intelligence.
Intelligent Control Methods Lecture 4: Searching in State Space Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Uninformed Search ECE457 Applied Artificial Intelligence Spring 2007 Lecture #2.
Goal-based Problem Solving Goal formation Based upon the current situation and performance measures. Result is moving into a desirable state (goal state).
1 search CS 331/531 Dr M M Awais REPRESENTATION METHODS Represent the information: Animals are generally divided into birds and mammals. Birds are further.
Implementation: General Tree Search
Solving problems by searching A I C h a p t e r 3.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 13, 2013.
AI Adjacent Fields  Philosophy:  Logic, methods of reasoning  Mind as physical system  Foundations of learning, language, rationality  Mathematics.
Search Part I Introduction Solutions and Performance Uninformed Search Strategies Avoiding Repeated States Partial Information Summary.
Brian Williams, Fall 041 Analysis of Uninformed Search Methods Brian C. Williams Sep 21 st, 2004 Slides adapted from: Tomas Lozano Perez,
Chapter 3 Solving problems by searching. Search We will consider the problem of designing goal-based agents in observable, deterministic, discrete, known.
Artificial Intelligence Solving problems by searching.
Lecture 3 Problem Solving through search Uninformed Search
Breadth First and Depth First
Problem Solving by Searching
Solving problems by searching
Lecture 1B: Search.
Principles of Computing – UFCFA3-30-1
Chap 4: Searching Techniques
Presentation transcript:

CSCI 4310 Lecture 2: Search

Search Techniques Search is Fundamental to Many AI Techniques

Semantic Networks Nodes: objects in the domain Links: Relationships between objects OOP: link is an “is a” relationship Meaning depends on the application This abstract concept is put into practice in Ch. 4

Semantic Nets Book Converts to Trees

Search What should a goal-based program do when none of the actions it can currently perform result in a goal state? Choose an action that at least leads to a state that is closer to a goal than the current state. Heuristics Refine our search procedure, or narrow the search space.

Definitions State: finite representation of the world at a given time. Operator: a function that transforms one state into another ( also called rule, transition, successor function, production, action). Initial state: world state at the beginning. Goal state: desired world state (can be several) Goal test: test to determine if the goal has been reached.

Definitions Reachable goal: a state reachable via a sequence of operators. State space: set of all reachable states from initial state (possibly infinite). Cost function: a function that assigns a cost to each operation. The ‘path cost’ is the TOTAL cost of getting from the start to the goal. Performance: cost of the final operator sequence cost of finding the sequence Path: A sequence of actions leading from one state to another. Solution: A path from the initial state to a state that satisfies the goal test (goal state).

Depth First Search Uninformed search DFS applet

Depth First Search dfs (node v) { visit(v); for each child w of v dfs(w); } O(b m ) time complexity b: max branching factor m: max depth Can be implemented with only storing the ‘current’ path: O(bm) space

Depth First Search Use when all partial paths reach dead ends or become complete paths after a reasonable number of steps Can use fewer resources than BFS

Breadth First Search Uninformed search

Breadth First Search O(b d ) time and space complexity b: max branching factor d: depth of solution DEPTH 0 DEPTH 1 DEPTH 2

Breadth First Search BFS may use more memory, but will not get stuck in blind alleys, and will always find the shortest path first. BFS may be more appropriate when exploring very large search spaces where there is an expected solution which takes a relatively small number of steps, or when you are interested in all the solutions.

Summary: Uninformed Search Problem formulation and representation is key! Implementation as expanding directed graph of states and transitions Appropriate for problems where no solution is known and many combinations must be tried Problem space is of exponential size in the number of world states -- NP-hard problems Fails due to lack of space and/or time.

From a Higher Level Task discriminator Many AI ‘searching’ techniques DFS or BFS Heuristic Rule-based system Genetic Algorithm …

“Macro”-search Neural Network Rule Based Expert System Facial recognition algorithm Stair Climbing What do I do next?

Limited Cross-disciplinary systems We have made impressive progress in machines that… Play chess Diagnose medical problems Climb stairs But no robot can walk down stairs and then play a game of chess? Why

A simple example, but the task of task determination is difficult How do you do this as a human? Goal-driven behaviors and divide and conquer can help

Reading Chapters 2 in Winston Chapters 2-3 in Buckland