Brief notes and exercises on non- classical search These notes are not intended to make sense on their own. Please read them in conjunction with the textbook.

Slides:



Advertisements
Similar presentations
Solving problems by searching Chapter 3. Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms.
Advertisements

Additional Topics ARTIFICIAL INTELLIGENCE
Solving problems by searching
Planning with Non-Deterministic Uncertainty (Where failure is not an option) R&N: Chap. 12, Sect (+ Chap. 10, Sect 10.7)
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Solving Problem by Searching Chapter 3. Outline Problem-solving agents Problem formulation Example problems Basic search algorithms – blind search Heuristic.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
Cooperating Intelligent Systems Intelligent Agents Chapter 2, AIMA.
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
CHAPTER 3 CMPT Blind Search 1 Search and Sequential Action.
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
CS 380: Artificial Intelligence Lecture #3 William Regli.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
Search: Representation and General Search Procedure CPSC 322 – Search 1 January 12, 2011 Textbook § 3.0 –
Problem Solving What is AI way of solving problem?
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2004.
Cooperating Intelligent Systems Intelligent Agents Chapter 2, AIMA.
Beyond Classical Search
Planning & Acting Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 12 Scheduling (12.1), Planning and Acting in nondetermininistic domains (12.3),
CPSC 322, Lecture 8Slide 1 Heuristic Search: BestFS and A * Computer Science cpsc322, Lecture 8 (Textbook Chpt 3.5) January, 21, 2009.
Solving problems by searching
Planning & Acting Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 12 Scheduling (12.1), Planning and Acting in nondetermininistic domains (12.3),
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
Solving problems by searching This Lecture Read Chapters 3.1 to 3.4 Next Lecture Read Chapter 3.5 to 3.7 (Please read lecture topic material before and.
1 Problem Solving and Searching CS 171/271 (Chapter 3) Some text and images in these slides were drawn from Russel & Norvig’s published material.

Planning with Non-Deterministic Uncertainty. Recap Uncertainty is inherent in systems that act in the real world Last lecture: reacting to unmodeled disturbances.
1 Beyond Classical Search Chapter 3 covered problems that considered the whole search space and produced a sequence of actions leading to a goal. Chapter.
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.
Basic concepts of Searching
Agents CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Chapter 2 Hande AKA. Outline Agents and Environments Rationality The Nature of Environments Agent Types.
Lecture 3: 18/4/1435 Searching for solutions. Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
An Introduction to Artificial Intelligence Lecture 3: Solving Problems by Sorting Ramin Halavati In which we look at how an agent.
SOLVING PROBLEMS BY SEARCHING Chapter 3 August 2008 Blind Search 1.
A General Introduction to Artificial Intelligence.
Artificial Intelligence
Problem Solving Agents
CPSC 420 – Artificial Intelligence Texas A & M University Lecture 3 Lecturer: Laurie webster II, M.S.S.E., M.S.E.e., M.S.BME, Ph.D., P.E.
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 12, 2012.
CPSC 7373: Artificial Intelligence Lecture 9: Planning Jiang Bian, Fall 2012 University of Arkansas at Little Rock.
Tree Diagrams A tree is a connected graph in which every edge is a bridge. There can NEVER be a circuit in a tree diagram!
Announcements  Upcoming due dates  M 11:59 pm HW 2  Homework 2  Submit via gradescope.com -- Course code: 9NXNZ9  No slip days for homeworks!  Project.
Announcements  Project 1: Search  Due Wednesday 9/24  Solo or in group of two. For group of two: both of you need to submit your code into edX!  Note:
1 Solving problems by searching Chapter 3. 2 Outline Problem types Example problems Assumptions in Basic Search State Implementation Tree search Example.
WEEK 5 LECTURE -A- 23/02/2012 lec 5a CSC 102 by Asma Tabouk Introduction 1 CSC AI Basic Search Strategies.
Solving problems by searching
More with Ch. 2 Ch. 3 Problem Solving Agents
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EA C461 – Artificial Intelligence Intelligent Agents
ECE 448 Lecture 4: Search Intro
Problem Solving by Searching
Problem Solving as Search
Solving problems by searching
هوش مصنوعي فصل دوم عاملهاي هوشمند.
Problem Solving and Searching
Problem Solving and Searching
L2. Problem Solving Using Search
EA C461 – Artificial Intelligence Intelligent Agents
Solving problems by searching
Some Graph Algorithms.
Solving problems by searching
Presentation transcript:

Brief notes and exercises on non- classical search These notes are not intended to make sense on their own. Please read them in conjunction with the textbook.

The eight possible states in the vacuum world

Nondeterministic Examples: Erratic vacuum world o Suck on a dirty square might clean adjacent one too o Suck on a clean square might deposit dirt there Slippery vacuum world Right or Left can fail Partial observations Examples: No sensors whatsoever (“sensorless”) Local-only sensor (tells us our location and dirtiness of current location) Nondeterministic and Partial observations Examples: Erratic, sensorless vacuum world Slippery vacuum world with local-only sensor Types of non-classical search

Exercise: assume we are in the slippery world. Complete the and-or tree below and indicate a strategy for reaching a goal state. Hint: this need not technically be a tree. You can have edges that loop back to previous states.

Exercises for understanding belief states Exercise A: 1.Draw the complete state-space graph for the belief states in a deterministic, sensorless vacuum world 2.Describe a strategy for reaching a goal state Exercise B: 1.Draw the complete state-space graph for the belief states in a deterministic vacuum world with a local-only sensor. Assume initially we detect that the location is the left square, and it is dirty. 2.Describe a strategy for reaching a goal state. Exercise C: 1.Draw part of the state-space graph for the belief states in a slippery vacuum world with a local-only sensor. Assume initially we detect that the location is the left square, and it is dirty. 2.Describe a strategy for reaching a goal state.