Problem solving agents

Problem solving agents

• 1.
  problem solving agents 9
• 3.
  Problem Solving  Animport application of Artificial Intelligence is Problem Solving.  Define problem statement first.  Generating the solution by keeping the different condition in mind.  Searching is the most commonly used technique of problem solving in artificial intelligence.
• 4.
  Problem Solving Agents: Aproblem-solving agent is a goal-driven agent and focuses on satisfying the goal. Goal formulation, based on the current situation and the agent’s performance measure. It organizes steps required to achieve that goal. Goal Formulation Problem Formulation Problem formulation is the process of deciding what actions should be taken to achieve the formulated goal. Components involved in Problem Formulation  Initial State  Actions  Transition model  Goal test  Path cost Steps performed by Problem-solving agent
• 5.
  Well Defined ProblemsAnd Solutions A problem can be defined formally by five components:  The initial state that the agent starts in.  A description of the possible actions available to the agent.  A description of what each action does; the formal name for this is the transition model.  The goal test, which determines whether a given state is a goal state. Sometimes there is an explicit set of possible goal states, and the test simply checks whether the given state is one of them.  A path cost function that assigns a numeric cost to each path. The problem-solving agent chooses a cost function that reflects its own performance measure. State Space
• 6.
  8 Puzzle Problem States: A state description specifies the location of each of the eight tiles and the blank in one of the nine squares.  Initial state: Any state can be designated as the initial state.  Actions: The simplest formulation defines the actions as movements of the blank space Left, Right, Up, or Down. Different subsets of these are possible depending on where the blank is. Goal State Initial State
• 7.
  Example: 8 PuzzleProblem  Transition model: Given a state and action, this returns the resulting state.  Goal test: This check whether the state matches the goal configuration. (Other goal configurations are possible.)  Path cost: Each step costs 1, so the path cost is the number of steps in the path. Goal State Initial State
• 8.
  8-Queens Problem  Thegoal of the 8-queens problem is to place eight queens on a chess-board such that no queen attacks any other.  • States: Any arrangement of 0 to 8 queens on the board is a state.  • Initial state: No queens on the board.  • Actions: Add a queen to any empty square.  • Transition model: Returns the board with a queen added to the specified square.  • Goal test: 8 queens are on the board, none attacked.
• 9.
  Thanks For Watching Reference: Artificial Intelligence AModern Approach Third Edition Peter Norvig and Stuart J. Russell Next Topic: Uninformed Search. Subscribe Like Share
• 10.
  OMega TechEd About theChannel This channel helps you to prepare for BSc IT and BSc computer science subjects. In this channel we will learn Business Intelligence ,Artificial Intelligence, Digital Electronics, Internet OF Things Python programming , Data-Structure etc. Which is useful for upcoming university exams. Gmail: omega.teched@gmail.com Social Media Handles: omega.teched megha_with Subscribe