Problem solving. Chapter 3, Sections 1 3

Size: px

Start display at page:

Download "Problem solving. Chapter 3, Sections 1 3"

Horace Richard
6 years ago
Views:

1 Problem solving Chapter 3, ections 1 3 Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 1

2 Problem types Deterministic, fully observable = single-state problem Agent knows exactly which state it will be in; solution is a sequence Non-observable = conformant problem Agent may have no idea where it is; solution (if any) is a sequence Nondeterministic and/or partially observable = contingency problem percepts provide new information about current state solution is a contingent plan or a policy often interleave search, execution Unknown state space = exploration problem ( online ) Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 2

3 Example: omania We are on holiday in omania; currently in Arad Our 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, ibiu, Fagaras, Bucharest Problem type: deterministic, fully observable = single-state problem Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 3

4 71 Oradea Example: omania Neamt Zerind 75 Arad Timisoara Dobreta 151 ibiu 99 Fagaras 80 imnicu Vilcea ugoj Mehadia 120 Pitesti Bucharest Craiova 90 Giurgiu 87 Iasi Urziceni Vaslui Hirsova 86 Eforie Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 4

5 ingle-state problem formulation A problem is defined by five components: initial state, e.g., In(Arad) actions Actions(s) = set of actions for state s e.g., Actions(In(Arad)) = {Go(ibiu), Go(T imisoara), Go(Zerind)} transitions esult(s, a) = the successor state e.g., esult(in(arad), Go(Zerind)) = In(Zerind) goal test, can be an explicit set of states, e.g., {In(Bucharest)} or an implicit property, e.g., checkmate in chess path cost is the sum of the step costs c(s,a,s ) e.g., sum of distances, number of actions executed, etc. in this chapter we assume c to be positive A solution is a sequence of actions leading from the initial state to a goal state Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 5

6 electing a state space eal 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., esult(in(arad), Go(Zerind)) represents a complex set of possible routes, detours, rest stops, etc. (Abstract) solution = set of real paths that are solutions in the real world Each abstract action should be easier than the original problem! Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 6

7 Example: vacuum world state space graph states??: integer dirt and robot locations (ignore dirt amounts etc.) initial state??: any state actions??: eft, ight, uck, N oop goal test??: no dirt in any location path cost??: 1 per action (0 for NoOp) Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 7

8 Example: The 8-puzzle states??: a 3 3 matrix of integers 0 n 8 initial state??: any state actions??: move the blank space: left, right, up, down goal test??: equal to goal state (given above) path cost??: 1 per move Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 8

9 Example: The 8-queens problem states??: any arrangement of 0 to 8 queens on the board initial state??: no queens on the board actions??: add a queen to any empty square goal test??: 8 queens on the board, none attacked path cost??: 1 per move Using this formulation, there are possible sequences to explore! Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections 1 3 9

10 Example: The 8-queens problem (alternative) states??: one queen per column in the leftmost columns, none attacked initial state??: no queens on the board actions??: add a queen to any square in the leftmost empty column, making sure that no queen is attacked goal test??: 8 queens on the board, none attacked path cost??: 1 per move Using this formulation, we have only 2,057 sequences! Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections

11 Example: robotic assembly P 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 of the object path cost??: time to execute Artificial Intelligence, spring 2013, Peter junglöf; based on AIMA lides c tuart ussel and Peter Norvig, 2004 Chapter 3, ections

Lecture 2: Problem Formulation

1. Problem Solving What is a problem? Lecture 2: Problem Formulation A goal and a means for achieving the goal The goal specifies the state of affairs we want to bring about The means specifies the operations