CS 8520: Artificial Intelligence
description
Transcript of CS 8520: Artificial Intelligence
![Page 1: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/1.jpg)
CS 8520: Artificial Intelligence
Solving Problems by Searching
Paula Matuszek
Fall, 2008
Slides based on Hwee Tou Ng, aima.eecs.berkeley.edu/slides-ppt, which are in turn based on Russell, aima.eecs.berkeley.edu/slides-pdf.
![Page 2: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/2.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
2
Outline• Problem-solving agents
• Problem formulation
• Example problems
![Page 3: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/3.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
3
Problem-solving agents
![Page 4: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/4.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
4
Example: Romania• On holiday in Romania; currently in Arad.• Flight leaves tomorrow from Bucharest• Formulate goal:
– be in Bucharest
• Formulate problem:– states: various cities– actions: drive between cities
• Find solution:– sequence of cities, e.g., Arad, Sibiu, Fagaras, Bucharest
![Page 5: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/5.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
5
Example: Romania
![Page 6: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/6.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
6
Problem types• Deterministic, fully observable single-state problem
– Agent knows exactly which state it will be in; solution is a sequence
• Non-observable sensorless problem (conformant problem)– Agent may have no idea where it is; solution is a sequence
• Nondeterministic and/or partially observable contingency problem– percepts provide new information about current state– often interleave: search, execution
• Unknown state space exploration problem
![Page 7: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/7.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
7
Example: vacuum world• Single-state, start in #5.
Solution?
![Page 8: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/8.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
8
Example: vacuum world• Single-state, start in #5.
Solution? [Right, Suck]
• Sensorless, start in {1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution?
![Page 9: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/9.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
9
Example: vacuum world• Sensorless, start in
{1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution? [Right,Suck,Left,Suck]
• Contingency – Nondeterministic: Suck may
dirty a clean carpet
– Partially observable: location, dirt at current location.
– Percept: [L, Clean], i.e., start in #5 or #7
Solution?
![Page 10: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/10.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
10
Example: vacuum world• Sensorless, start in
{1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution? [Right,Suck,Left,Suck]
• Contingency – Nondeterministic: Suck may
dirty a clean carpet
– Partially observable: location, dirt at current location.
– Percept: [L, Clean], i.e., start in #5 or #7
Solution? [Right, if dirt then Suck]
![Page 11: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/11.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
11
Single-state problem formulationA problem is defined by four items:
1. initial state e.g., "at Arad"2. actions or successor function S(x) = set of action–state
pairs • e.g., S(Arad) = {<Arad Zerind, Zerind>, … }
3. goal test, can be• explicit, e.g., x = "at Bucharest"• implicit, e.g., Checkmate(x)
4. path cost (additive)• e.g., sum of distances, number of actions executed, etc.• c(x,a,y) is the step cost, assumed to be ≥ 0
• A solution is a sequence of actions leading from the initial state to a goal state
![Page 12: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/12.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
12
Selecting a state space• Real world is absurdly complex
state space must be abstracted for problem solving
• (Abstract) state = set of real states• (Abstract) action = complex combination of real actions
– e.g., "Arad Zerind" represents a complex set of possible routes, detours, rest stops, etc.
• For guaranteed realizability, any real state "in Arad“ must get to some real state "in Zerind"
• (Abstract) solution = – set of real paths that are solutions in the real world
• Each abstract action should be "easier" than the original problem
![Page 13: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/13.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
13
Vacuum world state space graph
• States? Actions? Goal Test? Path Cost?
![Page 14: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/14.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
14
Vacuum world state space graph
• states? integer dirt and robot location • actions? Left, Right, Suck• goal test? no dirt at all locations• path cost? 1 per action
![Page 15: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/15.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
15
Example: The 8-puzzle
• states?• actions?• goal test?• path cost?
![Page 16: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/16.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
16
Example: The 8-puzzle
• states? locations of tiles • actions? move blank left, right, up, down • goal test? = goal state (given)• path cost? 1 per move
[Note: optimal solution of n-Puzzle family is NP-hard]
![Page 17: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/17.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
17
Example: robotic assembly
• states? • actions?• goal test?• path cost?
![Page 18: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/18.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
18
Example: robotic assembly
• states?: real-valued coordinates of robot joint angles parts of the object to be assembled
• actions?: continuous motions of robot joints• goal test?: complete assembly• path cost?: time to execute
![Page 19: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/19.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
19
Tree search algorithms• Basic idea:
– offline, simulated exploration of state space by generating successors of already-explored states (a.k.a.~expanding states)
![Page 20: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/20.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
20
Tree search example
![Page 21: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/21.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
21
Tree search example
![Page 22: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/22.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
22
Tree search example
![Page 23: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/23.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
23
Implementation: general tree search
![Page 24: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/24.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
24
Implementation: states vs. nodes• A state is a (representation of) a physical configuration• A node is a data structure constituting part of a search tree
includes state, parent node, action, path cost g(x), depth
• The Expand function creates new nodes, filling in the various fields and using the SuccessorFn of the problem to create the corresponding states.
![Page 25: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/25.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
25
Search strategies• A search strategy is defined by picking the order of
node expansion. (e.g., breadth-first, depth-first) • Strategies are evaluated along the following
dimensions:– completeness: does it always find a solution if one exists?– time complexity: number of nodes generated– space complexity: maximum number of nodes in memory– optimality: does it always find a least-cost solution?
• Time and space complexity are measured in terms of – b: maximum branching factor of the search tree– d: depth of the least-cost solution– m: maximum depth of the state space (may be infinite)
![Page 26: CS 8520: Artificial Intelligence](https://reader036.fdocuments.in/reader036/viewer/2022062409/5681513c550346895dbf5648/html5/thumbnails/26.jpg)
Paula Matuszek, CSC 8520, Fall 2008. Based on aima.eecs.berkeley.edu/slides-ppt/m2-agents.ppt
26
Summary• Problem-solving agents search through a problem or state
space for an acceptable solution.• A state space can be specified by
1. An initial state 2. Actions or successor function S(x) = set of action–state pairs 3. A goal test or goal state4. A path cost
• A solution is a sequence of actions leading from the initial state to a goal state
• The formalization of a good state space is hard, and critical to success. It must abstract the essence of the problem so that
– It is easier than the real-world problem.– A solution can be found.– The solution maps back to the real-world problem and solves it.