HEURISTIC SEARCH

https://www.linkedin.com/in/neil27/ - NeilHarwani@NirmaUni.ac.in
MBA FT – ML & AI course – February 2021
 Agenda

SEARCH TECHNIQUES OF ADMISSIBILITY, HEURISTIC INTELLIGENT MULTI – AGENT

HEURISTIC MONOTONICITY & CLASSIFICATION AGENTS SYSTEMS
SEARCH INFORMEDNESS
Search
◦ Search – one of the basic operational tasks in AI
◦ Search – Problem Solving technique
◦ Mechanical fault detection
◦ Exhaustive search – searching the complete state space is computationally not possible
◦ Uninformed search – Apply operators, get new states till goal state is reached- time consoling
◦ Informed Search – explores a smaller state space

◦ Heuristic is a strategy of selectively searching a problem space

◦ It is not a fool proof strategy but controls exponential explosion of properties
◦ Employs knowledge of nature of problem to find a solutions
◦ Heuristic Function = cost from start state to current state + Estimated distance from goal
 Techniques of Heuristic Search
Hill Climbing Heuristic
Combines depth first and depth first in a
single method
Uses the local knowledge to reach the local
maximum
Problem with Hill climbing is – reaching
local maximum and missing the global
maximum, ridge problem and plateau
It does not backtrack and looks at current
state only
Best First Search
Aims to find low cost solutions
Informed Search technique
Looks at heuristic value for exploring the
best technique
It will give the good solution but may or
may not give the optimal solution
Admissibility, Monotonicity &
Informedness

Admissible heuristics are

Admissible – if capable of
optimistic – there is a way of
finding shortest path
solving the problem at lesser
whenever it exists
cost

Monotonicity - For all

Informedness is the process
admissible heuristics, the
of comparing 2 heuristics
cost of evaluation function
and determining the shortest
never decreases in any of the
path
paths from the root
Heuristic classification
◦ Simple Classification – selection from a set of known solutions. No construction of new one
◦ Data Abstraction – Definitional Abstraction, Qualitative Abstraction, Generalization
◦ Heuristic Association is a connection that relates commonly available data to the interpretation intended
◦ Abstraction helps relate new situations to previous interpretations
◦ System Oriented approach – organize & analyze a system
◦ Tools, methods and tasks
◦ Describe problem in sequence of operations
◦ Check if heuristic classification is applicable
◦ Check if there are many uncertain choices
◦ Identify & classify
◦ Knowledge Level Analysis – Heuristics classification model provides knowledge level analysis of programs
Intelligent Agents
◦ Characteristics
◦ Reactive
◦ Goal Directed
◦ Adaptable
◦ Socially capable
◦ Agents and Objects in Intelligent Systems
◦ Difference between objects and agents
◦ Autonomy – They cannot invoke actions of another agent, they can only make requests
◦ Intelligence is not mandatory for objects
◦ They persist in different ways
◦ There is no standard approach to implement agent-based systems like Object Oriented Languages
◦ Architecture of an agent
◦ Logic based architecture
◦ Emergent Behaviour architecture
◦ Knowledge level architecture
◦ Layered architecture
Multi – Agent Systems
◦ Also called agent oriented or agent-based systems
◦ Distributed artificial intelligence ( DAI) mimics humans working together – several interacting, intelligent agents pursue a set of individually set goals or perform set
of individual tasks
◦ Advantages of Multi – agent systems
◦ Inherently complex problems
◦ Inherently distributed problems
◦ More natural view of intelligence
◦ Greater speed and efficiency gains
◦ Robustness and reliability
◦ Scalability
◦ Granularity
◦ Ease of Development
◦ Cost
◦ Can be bottom up or top down
◦ Designed as computer models of human functional goals
◦ Communication between agents
◦ Agent communication languages
 THANK YOU
https://www.linkedin.com/in/neil27/ - NeilHarwani@NirmaUni.ac.in