Structures and Strategies For Space State Search

Slides:



Advertisements
Similar presentations
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Advertisements

CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
Part2 AI as Representation and Search
CS 480 Lec 3 Sept 11, 09 Goals: Chapter 3 (uninformed search) project # 1 and # 2 Chapter 4 (heuristic search)
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)
Lecture 3 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
HEURISTIC SEARCH ARTIFICIAL INTELLIGENCE 5th edition George F Luger
Artificial Intelligence
Cooperating Intelligent Systems Course review AIMA.
Structures and Strategies for State Space Search
Structures and Strategies for State Space Search
Artificial Intelligence Chapter 3: Solving Problems by Searching
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
Control and Implementation of State Space Search
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 Tree Searching Strategies. 2 The procedure of solving many problems may be represented by trees. Therefore the solving of these problems becomes a tree.
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.
Structures and Strategies For Space State Search
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
Automated Reasoning ARTIFICIAL INTELLIGENCE 6th edition George F Luger
HEURISTIC SEARCH. Luger: Artificial Intelligence, 5 th edition. © Pearson Education Limited, 2005 Portion of the state space for tic-tac-toe.
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
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 Control and Implementation of State Space Search 5 5.0Introduction 5.1Recursion-Based Search 5.2Pattern-directed Search 5.3Production Systems 5.4The.
Artificial Intelligence Course outline Introduction Problem solving Generic algorithms Knowledge Representation and Reasoning Expert Systems Uncertainty.
Strong Method Problem Solving.
Knowledge Representation
Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Artificial Intelligence: Its Roots and Scope
Formal Description of a Problem In AI, we will formally define a problem as –a space of all possible configurations where each configuration is called.
The Predicate Calculus
KU NLP Structures and Strategies for State Space Search Depth-First and Breadth-First Search q A search algorithm must determine the order in which.
Understanding Natural Language
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
Building Control Algorithms For State Space Search.
1 CS 385 Fall 2006 Chapter 3 Structures and Strategies for State Space Search.
Artificial Intelligence Tarik Booker. What we will cover… History Artificial Intelligence as Representation and Search Languages used in Artificial Intelligence.
Reasoning in Uncertain Situations
Lectures on Artificial Intelligence – CS435 Conceptual Graphs
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.
Structures and Strategies For Space State Search
Lecture on Introduction to Artificial Intelligence Chapter#10 Sec 10.1 and 10.3 (before Heuristics)
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Machine Learning: Social and Emergent Luger: Artificial.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving Artificial Intelligence as Empirical Enquiry Luger:
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving STOCHASTIC METHODS Luger: Artificial Intelligence,
Formal Description of a Problem In AI, we will formally define a problem as –a space of all possible configurations where each configuration is called.
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving Machine Learning: Symbol-Based Luger: Artificial.
Part II: Artificial Intelligence as Representation and Search
Lecture 3: Uninformed Search
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving Machine Learning: Probabilistic Luger: Artificial.
1 Solving problems by searching Chapter 3. Depth First Search Expand deepest unexpanded node The root is examined first; then the left child of the root;
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Structures and Strategies For Space State Search.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
HEURISTIC SEARCH 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games 4.4Complexity.
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.
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.
Artificial Intelligence Midterm 고려대학교 컴퓨터학과 자연어처리 연구실 임 해 창.
Building Control Algorithms for State Space Search. Luger: Artificial Intelligence, 5 th edition. © Pearson Education Limited, 2005.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving STOCHASTIC METHODS Luger: Artificial Intelligence,
Spanning Trees Alyce Brady CS 510: Computer Algorithms.
Artificial Intelligence
Machine Learning: Symbol-Based
AI Classnotes #5, John Shieh, 2012
Machine Learning: Symbol-Based
The function of knowledge representation scheme is
Luger: Artificial Intelligence, 5th edition
Search Exercise Search Tree? Solution (Breadth First Search)?
Presentation transcript:

Structures and Strategies For Space State Search 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for Space State Search 3.3 Using Space State to Represent Reasoning with the Predicate Calculus 3.4 Epilogue and References 3.5 Exercises George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 1

Fig 3. 16. Graph of Fig 3. 15 at iteration 6 of breadth-first search Fig 3.16 Graph of Fig 3.15 at iteration 6 of breadth-first search. States on open and closed are highlighted. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 2

Function depth_first_search algorithm Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 3

A trace of depth_first_search on the graph of Figure 3.13 Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 4

Fig 3.17 Breadth-first search of the 8-puzzle, showing order in which states were removed from open. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 5

Fig 3. 18. Graph of fig 3. 15 at iteration 6 of depth-first search Fig 3.18 Graph of fig 3.15 at iteration 6 of depth-first search. States on open and closed are highlighted. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 6

Fig 3.19 Depth-first search of the 8-puzzle with a depth bound of 5. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 7

Fig 3.20 State space graph of a set of implications in the propositional calculus. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 8

Fig 3.21 And/or graph of the expression q Λ r → p. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 9

Luger: Artificial Intelligence, 5th edition Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 10

Fig 3.22 And/or graph of the expression q v r → p Insert fig 3.22 Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 11

Fig 3.23 And/or graph of a set of propositional calculus expressions. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 12

Fig 3.24 And/or graph of part of the state space for integrating a function, from Nilsson (1971). Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 13

The facts and rules of this example are given as English sentences followed by their predicate calculus equivalents: Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 14

Fig 3.25 The solution subgraph showing that Fred is at the museum. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 15

Five rules for a simple subset of English grammar are: Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 16

Fig 3.26 And/or graph searched by the financial advisor. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 17

Fig 3.27 And/or graph for the grammar of Example 3.3.6. Some of the nodes (np, art, etc) have been written more than once to simplify drawing the graph. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 18

Fig 3. 28. Parse tree for the sentence “The dog bites the man Fig 3.28 Parse tree for the sentence “The dog bites the man.” Note this is a subtree of the graph of fig 3.27. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 19

Fig 3.29 A graph to be searched. Luger: Artificial Intelligence, 5th edition. © Pearson Education Limited, 2005 20