Teaching Plan Problem Solving

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Artificial Intelligence Presentation
Traveling Salesperson Problem
CS 480 Lec 3 Sept 11, 09 Goals: Chapter 3 (uninformed search) project # 1 and # 2 Chapter 4 (heuristic search)
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
CSC 423 ARTIFICIAL INTELLIGENCE
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
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?
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
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.
Problem Solving and Search Andrea Danyluk September 11, 2013.
Vilalta&Eick: Informed Search Informed Search and Exploration Search Strategies Heuristic Functions Local Search Algorithms Vilalta&Eick: Informed Search.
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.
Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA.
For Monday Read chapter 4, section 1 No homework..
Lecture 3: Uninformed Search
1 Solving problems by searching 171, Class 2 Chapter 3.
Search CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
For Friday Read chapter 4, sections 1 and 2 Homework –Chapter 3, exercise 7 –May be done in groups.
Search (continued) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Problem Reduction So far we have considered search strategies for OR graph. In OR graph, several arcs indicate a variety of ways in which the original.
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches - Introduction.
Ch. Eick: Introduction to Search Classification of Search Problems Search Uninformed Search Heuristic Search State Space SearchConstraint Satisfaction.
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Artificial Intelligence Solving problems by searching.
Eick: Informed Search Informed Search and Exploration Search Strategies Heuristic Functions Local Search Algorithms Vilalta&Eick: Informed Search.
Lecture 3: Uninformed Search
Introduction to Artificial Intelligence
Constraint Satisfaction Problems vs. Finite State Problems
Introduction to Artificial Intelligence
Problem Solving by Searching
Informed Search and Exploration
Artificial Intelligence (CS 370D)
Computer Science cpsc322, Lecture 14
Artificial Intelligence Problem solving by searching CSC 361
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Games with Chance Other Search Algorithms
Motion Planning for a Point Robot (2/2)
CSE 4705 Artificial Intelligence
Example: Applying EC to the TSP Problem
Introduction to Artificial Intelligence and Soft Computing
1. Randomized Hill Climbing
Randomized Hill Climbing
Computing the Entropy (H-Function)
Problem Solving and Searching
Randomized Hill Climbing
CSE 4705 Artificial Intelligence
EA C461 – Artificial Intelligence
Artificial Intelligence
Review session covering text book pages and
Problem Solving and Searching
Principles of Computing – UFCFA3-30-1
CSE (c) S. Tanimoto, 2001 Search-Introduction
A General Backtracking Algorithm
Blay Whitby 2003 Search Blay Whitby 2003
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
CO Games Development 1 Week 8 Depth-first search, Combinatorial Explosion, Heuristics, Hill-Climbing Gareth Bellaby.
Chap 4: Searching Techniques
State-Space Searches.
State-Space Searches.
ECE457 Applied Artificial Intelligence Fall 2007 Lecture #2
CMSC 471 Fall 2011 Class #4 Tue 9/13/11 Uninformed Search
Midterm Review.
Reading: Chapter 4.5 HW#2 out today, due Oct 5th
State-Space Searches.
Teaching Plan Problem Solving
Lecture 4: Tree Search Strategies
Presentation transcript:

Teaching Plan Problem Solving Search1: Classification of Search Problems, Terminology, and Overview Search2: Problem Solving Agents Search3: Heuristic Search and Exploration Search4: Randomized Hill Climbing and Backtracking (not covered in the textbook!) Search5: Games (will use slide set for Chapter 6 of the author of the textbook) Search6: Constraint Satisfaction Problems (short!) Search7: More on Greedy Search and A* (will be covered in the October review, but not in the lecture!). Search8: Information and Discussion of Course Project1 EC1: Introduction to Evolutionary Computing (EC) / Genetic Algorithms (GA) EC2: Using EC to Solve Travelling Salesman Problems A

Classification of Search Problems http://www.cis.temple.edu/~ingargio/cis587/readings/constraints.html Optimization Problems State Space Search Constraint Satisfaction Problems Search The last technology I like to introduce in today’s presentation are shared ontologies. Shared ontologies are important to standardize communication, and for gathering information from different information sources. Ontologies play an important role for agent-based systems. Ontologies basically describe... Heuristic Search Uninformed Search

Figure Example: State Space Search Goal: find an operator sequence that leads from the start state to the goal state State Space: a 3x3 matrix containing the numbers 1,…,8 and *(empty) Operators: North, South, East, West

A Search Tree for the 8-Puzzle Space Complexity: O(n)=O(b**(d+1)

Optimization Problems Maximize f(x,y,z)=|x-y-0.2|*|x*z-0.8|*|0.3-z*z*y| with x,y,z in [0,1] Characteristics: No explicit operators the path that leads to the solution is not important Frequently involves real numbers  number of solutions is not finite Problems might be complicated by additionally requiring that the solution satisfies a set of contraints. Life is easier if the function is continuous and differentiable  e.g. classical numerical optimization techniques can directly be applied AI and evolutionary computing are more attractive for “nasty” optimization problems.

Constraint Satisfaction Problems Find q1=(x1,y1),…,q8=(x8,y8) such that constraint_satisfied.

Heuristic Search augment General Search Domain-specific Algorithms Knowledge The last technology I like to introduce in today’s presentation are shared ontologies. Shared ontologies are important to standardize communication, and for gathering information from different information sources. Ontologies play an important role for agent-based systems. Ontologies basically describe...

Figure 2.13

Classification of Search Algorithms State Space Search Expansion Search Hill Climbing Backtracking Breadth First Depth First Best First Search Uniform Cost The last technology I like to introduce in today’s presentation are shared ontologies. Shared ontologies are important to standardize communication, and for gathering information from different information sources. Ontologies play an important role for agent-based systems. Ontologies basically describe... A* Greedy Search Remark: Many other search algorithms exist that do not appear above

Characterization of State Space Search Algorithms A search strategy consists of the following: A state space S, set of operators O: SS, an initial state, and a (set of) goal state(s). A control strategy that determines how the search space will be searched; it consists of an operator selection and state selection function: Operator selection function: selects which operator(s) is (are) applied to a given state State selection function: selects the state to which an operator (selected by the operator selection function) is applied next. Remarks: Operator selection functions only return operators that have not been applied yet, and state selection functions return only states that have not been completely expanded yet (some applicable operators have not been applied to this state yet); moreover, we assume that ties are broken randomly. The last technology I like to introduce in today’s presentation are shared ontologies. Shared ontologies are important to standardize communication, and for gathering information from different information sources. Ontologies play an important role for agent-based systems. Ontologies basically describe...

Example: Search Strategies for the 8 Puzzle Strategy 1 (Breadth First): Operator Selection Function: select all operators State Selection Function: Select a state s giving preference to states that are closer to the initial state i(closeness is evaluated by the number of operator applications it took to reach s from i) Strategy 2 (Backtracking with depth bound set to 3): Operator Selection Function : Select (applicable) operator by priorities: N>S>E>W State Selection Function : If the most recently created state is less than 3 operator applications away from the initial state, use this state; otherwise, use the predecessor of the most recent state. Background: https://en.wikipedia.org/wiki/Ariadne https://en.wikipedia.org/wiki/Ariadne%27s_thread_%28logic%29 https://en.wikipedia.org/wiki/Labyrinth

Tree Produced by Depth First Search Space Complexity Backtracking: O(d) Space Complexity Expansion Depth-first Search: O(b*d) Search Graph or Tree??

Un-graded Homework1 2016 Assume you have to search a labyrinth of interconnected rooms trying to find a particular room that contain a red flower. There will be many intersections of walkways that connect rooms all of which look completely the same; you will not know if you entered a particular crossing before; however, you will be given a piece of chalk that allow you to mark the to put signs of your own choosing on a wall. Devise a search strategy that will find a room with a red flower assuming that such a room exists. To be discussed on Sept. 8 in class! Motivation: https://www.youtube.com/watch?v=8P-ALSqmWRI Goal State

Also on September 8 What Does Cooperate America Think about AI? http://research.google.com/pubs/MachineIntelligence.html (Read!) http://www.bloomberg.com/news/articles/2015-10-26/google-turning-its-lucrative-web-search-over-to-ai-machines (Video about RankBrain that uses AI) http://www.zdnet.com/article/beyond-cortana-what-artificial-intelligence-means-for-the-future-of-microsoft/ (Read!) AI is getting better with time and making our lives easier with Microsoft’s Cortana, Apple’s Siri, Amazon’s Alexa, and Google Now. IJCAI Homepage http://ijcai-16.org/index.php/welcome/view/home