1 / 15

MH0023 INTELLIGENT CONTROLLERS

Understand how goal-directed agents achieve desired goals by selecting action sequences in state-space search problems. Learn problem formulation, search processes, and illustration of search problems like N-queen, 8-puzzle, and Tic-tac-toe.

bbaca
Download Presentation

MH0023 INTELLIGENT CONTROLLERS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MH0023 INTELLIGENT CONTROLLERS LECTURE 5 STATE SPACE SEARCH

  2. GOAL BASED AGENT • A GOAL DIRECTED AGENT NEEDS TO ACHIEVE CERTAIN GOALS. • MANY PROBLEMS CAN BE REPRESENTED AS SET OF STATES AND SET OF RULES OF HOW ONE STATE IS TRANSFORMED TO ANOTHER. • THE AGENT MUST CHOOSE A SEQUENCE OF ACTIONS TO ACHIEVE THE DESIRED GOAL.

  3. GOAL BASED AGENT • INITIAL STATE- STARTING CONFIGURATION OF THE AGENT. • ACTION/OPERATOR-TAKES THE AGENT FROM ONE STATE TO ANOTHER.A STATE HAVE A NUMBER OF SUCCESSOR STATES. • PLAN-SEQUENCE OF ACTIONS. • GOAL-DESCRIPTION OF A SET OF DESIRABLE STATES OF THE WORLD. • PATH COST- FUNCTIONS THAT ASSIGNS A COST TO A PATH. • PROBLEM FORMULATION- CHOOSING A RELEVANT SET OF STATES TO CONSIDER AND A FEASIBLE SET OF OPERATORS MOVING FROM ONE STATE TO ANOTHER. • SEARCH-PROCESS OF IMAGINING SEQUENCES OF OPERATORS APPLIED TO THE INITIAL STATE AND CHECKING WHICH SEQUENCES REACHES A GOAL STATE.

  4. SEARCH PROBLEM

  5. REPRESENTING A SEARCH PROBLEM • A SEARCH PROBLEM IS REPRESENTED USING A DIRECTED GRAPH. • THE STATES ARE REPRESENTED AS NODES. • THE ALLOWED ACTIONS ARE REPRESENTED AS ARCS.

  6. ILLUSTRATION OF A SEARCH PROCESS

  7. PEGS AND DISK PROBLEM INITIAL STATE GOAL STATE

  8. 8 QUEENS PROBLEM

  9. N QUEEN PROBLEM FORMULATION

  10. N QUEENS PROBLEM FORMULATION 2

  11. N QUEEN PROBLEM FORMULATION 3

  12. PROBLEM DEFINITION-8 PUZZLE

  13. 8 PUZZLE PARTIAL STATE SPACE

  14. TIC-TAC-TOE

  15. EXPLICIT Vs IMPLICIT STATE SPACE • The state space may be explicitly represented by a graph. • The state space can be implicitly represented and generated when required. To generate the state space implicitly, the agent needs to know • The initial state. • The operators and a description of the effects of the operators.

More Related