Chapter 3 This chapter talks about various problems that an agent faces and various ways to formulate the problem. It explains different problems based on different scenarios and explains effective ways to come up with a search strategy to solve the problem. It explains the formulate, search, execute design. There are four essentially different types of problems — single state problems, multiple-state problems, contingency problems, and exploration problems. The initial state, operator set, goal test, and path cost function define a problem. The process of removing detail from a representation is called abstraction. Explains various toy problems and how to solve them. A state is arc-consistent j if every variable has a value in its domain that is consistent with each of the constraints on that I variable. Chapter 4 This chapter takes the problems from the previous chapter and explains various ways of solving them. It explains various algorithms and ...
Chapter 7 7.1 The agent maintains a knowledge base, KB, which may initially contain some background knowledge. Then we can expect it to cross the Golden Gate Bridge because it knows that that will achieve its goal. Notice that this analysis is independent of how the taxi works at the implementation level. This is called the declarative approach to system building. In contrast, the procedural approach encodes desired behaviors directly as program code. 7.2 The wumpus world is a cave consisting of rooms connected by passageways. Lurking somewhere in the cave is the terrible wumpus, a beast that eats anyone who enters its room. Chapter 8 Propositional logic has a third property that is desirable in representation languages, namely, compositionality. For nondeductive tasks such as learning from experience, outcomes are necessarily dependent on the form of the representations used. The language of first-order logic, whose syntax and semantics we define ...
Chapter 21 In the absence of feedback from a teacher, an agent can learn a transition model for its own moves and can perhaps learn to predict the opponent’s moves, but without some feedback about what is good and what is bad, the agent will have no grounds for deciding which move to make. This kind of feedback is called a reward, or reinforcement. Clearly, the passive learning task is similar to the policy evaluation task, part of the policy iteration algorithm described in Section 17.3. The main difference is that the passive learning agent does not know the transition model P(s | s, a), which specifies the probability of reaching state s from state s after doing action a; nor does it know the reward function R(s), which specifies the reward for each state. A simple method for direct utility estimation was invented in the late 1950s in the area of adaptive control theory by Widrow and Hoff (1960). The utility of each state equals its own reward plus the expected utili...
Comments
Post a Comment