Page 171 - DCAP310_INTRODUCTION_TO_ARTIFICIAL_INTELLIGENCE_AND_EXPERT_SYSTEMS

Anil Sharma, Lovely Professional University
Unit 9: Search and Control Strategies

Unit 9: Search and Control Strategies Notes

CONTENTS
Objectives
Introduction

9.1 Preliminary Concepts
9.2 Examples of Search Problems
9.2.1 Water Container Problem

9.2.2 Problem Characteristics
9.2.3 Means-End Analysis
9.3 Uninformed or Blind Search
9.3.1 Breadth-first Search
9.3.2 Depth-first Search

9.4 Informed Search
9.4.1 Hill Climbing Methods
9.4.2 Best-first Search

9.4.3 A* Algorithm
9.5 Problem Reduction (AND/OR-Tree Search)
9.5.1 Problem-Reduction and the Tower of Hanoi
9.5.2 Implementing Arbitrary AND/OR-Trees
Dinesh Kumar, Lovely Professional University
9.5.3 Implementing the AND/OR-Tree Search Function

9.5.4 Implementing Planning as AND/OR-Tree Search
9.5.5 Implementing Reasoning as AND/OR-Tree Search
9.6 Summary

9.7 Keywords
9.8 Review Questions
9.9 Further Readings

Objectives

After studying this unit, you will be able to:

Identify Preliminary Concepts
Discuss the examples of Search Problems
Explain the concept of Uninformed or Blind Search
Describe Informed Search
Discuss the Problem Reduction (AND/OR-Tree Search)

LOVELY PROFESSIONAL UNIVERSITY 165