CMPT 310 Lecture Notes - Lecture 7: Search Algorithm, Lugoj, Eforie

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 310
• Professor: Jim Delgrande

Document Summary

Outline: problem-solving agents, problem formulation, example problems, basic search algorithms. In the simplest case, an agent will: formulate (or be given) a goal and a problem, search for a sequence of actions that solves the problem, then execute the actions. When done it may formulate another goal and start over: in this case the performance measure is simply whether or not the goal is attained. Function simple-problem-solving-agent(percept) returns an action persistent seq an action sequence, initially empty state some description of the current world state goal a goal, initially null problem a problem formulation. Problem-solving agents: this is o ine problem solving, executed eyes closed. , requires complete knowledge about the domain, online problem solving involves acting without necessarily having complete knowledge. 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.