INTRODUCTION
CHAPTER1INTRODUCTIONCHAPTER2INTELLIGENT AGENTSfunctionTABLE-DRIVEN-AGENT(percept )returnsan actionpersistent:percepts, a sequence, initially emptytable, a table of actions, indexed by percept sequences, initially fully specifiedappendperceptto the end ofperceptsaction LOOKUP(percepts,table)returnactionFigure TABLE-DRIVEN-AGENTprogram is invoked for each new percept and re-turns an action each time. It retains the complete percept sequence in ([location,status])returnsan actionifstatus=Dirtythen returnSuckelse iflocation=Athen returnRightelse iflocation=Bthen returnLeftFigure agent program for a simple reflex agent in the two-location vacuum environ-ment.
CHAPTER 3 SOLVING PROBLEMS BY SEARCHING function BEST-FIRST-SEARCH(problem,f) returns a solution node or failure node ←NODE(STATE=problem.INITIAL) frontier ←a priority queue orderedby f, with node as an element reached ←a lookup table, with one entry with key problem.INITIAL and value node while not IS-EMPTY(frontier) do node ←POP(frontier) if …
Download INTRODUCTION
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: