CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3 - Search.

Slides:



Advertisements
Similar presentations
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 2 - Search.
Advertisements

CS344: Principles of Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 7, 8, 9: Monotonicity 16, 17 and 19 th Jan, 2012.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16: Perceptrons and their computing power 6 th and.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture– 4, 5, 6: A* properties 9 th,10 th and 12 th January,
Artificial Intelligence Chapter 9 Heuristic Search Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
1 Heuristic Search Chapter 4. 2 Outline Heuristic function Greedy Best-first search Admissible heuristic and A* Properties of A* Algorithm IDA*
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16, 17- Completeness Proof; Self References and.
Branch and Bound Searching Strategies
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–2,3: A* 3 rd and 5 th January, 2012.
1 Branch and Bound Searching Strategies 2 Branch-and-bound strategy 2 mechanisms: A mechanism to generate branches A mechanism to generate a bound so.
Class of 28 th August. Announcements Lisp assignment deadline extended (will take it until 6 th September (Thursday). In class. Rao away on 11 th and.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 1 - Introduction.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Monotonicity 13 th Jan, 2011.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 36-37: Foundation of Machine Learning.
Informed State Space Search Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 15/Jan/2007.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
Informed Search Methods. Informed Search  Uninformed searches  easy  but very inefficient in most cases of huge search tree  Informed searches  uses.
Informed Search Strategies Lecture # 8 & 9. Outline 2 Best-first search Greedy best-first search A * search Heuristics.
For Friday Finish reading chapter 4 Homework: –Lisp handout 4.
For Monday Read chapter 4, section 1 No homework..
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
1 Branch and Bound Searching Strategies Updated: 12/27/2010.
CSC3203: AI for Games Informed search (1) Patrick Olivier
Artificial Intelligence Problem solving by searching.
Intelligent Control Methods Lecture 4: Searching in State Space Slovak University of Technology Faculty of Material Science and Technology in Trnava.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3 - Search.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 5: Power of Heuristic; non- conventional search.
Informed Search CSE 473 University of Washington.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 2 - Search.
Searching for Solutions
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search 17 th August, 2010.
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
3.5 Informed (Heuristic) Searches This section show how an informed search strategy can find solution more efficiently than uninformed strategy. Best-first.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 17– Theorems in A* (admissibility, Better performance.
Branch and Bound Searching Strategies
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lectures 18, 19, 20– A* Monotonicity 2 nd, 6 th and 7 th September, 2010.
CS344: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 1 to 8– Introduction, Search, A* (has the associated lab course: CS386)
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3: Search, A*
Solving problems by searching Uninformed search algorithms Discussion Class CS 171 Friday, October, 2nd (Please read lecture topic material before and.
For Monday Read chapter 4 exercise 1 No homework.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20: Neural Net Basics: Perceptron.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Artificial Intelligence Problem solving by searching CSC 361
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Discussion on Greedy Search and A*
Discussion on Greedy Search and A*
CSE 4705 Artificial Intelligence
CS 4100 Artificial Intelligence
CS344: Artificial Intelligence
CSE 4705 Artificial Intelligence
EA C461 – Artificial Intelligence
Informed search algorithms
Informed search algorithms
Artificial Intelligence
CS621: Artificial Intelligence
CS621: Artificial Intelligence
Artificial Intelligence Chapter 9 Heuristic Search
Branch and Bound Searching Strategies
CSE 473 University of Washington
Chap 4: Searching Techniques
CS621 : Artificial Intelligence
CS621: Artificial Intelligence
Artificial Intelligence
“If I Only had a Brain” Search
Presentation transcript:

CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3 - Search

Common Dimensions in Search Methods How does a solution correspond to a search tree? – Solutions can be any nodes – Solutions must be terminal nodes – Solutions are paths through the tree When does a search method stop? – Satisficing: when its finds one solution – Exhaustive: when it has considered all possible solutions – Optimizing: when it has found the best solution – Resource limited: when it has exhausted its computational resources – Due process: when it has searched with a method that has proven adequate for most cases

Common Dimensions in Search Methods (contd.) How is the search directed? – Blind: systematic search through possibilities – Directed: heuristics used to guide the search – Hierarchical: abstract solutions used to organize the search How thorough is the search – Complete: If there is a solution in the search space, the system will find it – Incomplete: the system may miss some solutions

AI search is always backed up by knowledge Ontological knowledge: a hierarchy of concepts

The Hierarchical Assembly in an automobile system Motor System Breaking System Engine System Transmission System Electrical SystemCooling System Cooling hoseRadiator Charging System Starter System Voltage Regulator Generator Battery Solenoid Starter Motor Ignition System Spark PlugsCoil Motor System

Informed Search Avoid useless subtrees Important for Web

Intelligent Search on Web Root of the Web LiteraturePoetryDramaNovelEconomicsMacroMicroSportsRacketStick Give “Shakespeare's Hamlet”. No point going to Economics subtree. Document clustering and classification needed.

Two Cardinal Theorems for A* Admissibility – A* always terminates finding the optimal path. Informedness – More informed heuristic is “better”, i.e., a less informed heuristic will expand at least as many times as a more informed one.

Proof of Admissibility S N1N1 N2N2 N i = N G Start Node N is the node on optimal path on open list, All its ancestors are in closed list Goal Node

Proof of Admissibility (contd.) If A* does not terminate f values of nodes on open list become unbounded. f(N) = g(N) + h(N) and g(N)>= e.Σarcs e=least cost on the arcs (+ve).

Proof of Admissibility (cont.) N is on optimal path. N’s ancestors are all in CL g(N) = g*(N) ; optimal path to N found h(N) <= h*(N), by defn of A* Hence, f(N) <= f*(N) = f*(S) Since for each N on optimal path f* values are equal and equal to the cost of the optimal path from S to G.

Proof of Admissibility (cont.) Fact 1: If A* does not terminate f values of nodes on OL become unbounded. Fact 2: Any time before A* terminates there exists on OL a node N with f(N) < f*(S) These two can be reconciled iff A* terminates

Intuition of Termination A* keeps wavering and straying. But is brought back to the correct path.