Introduction

ARTIFICIAL INTELLIGENCE
Unit-1
Course Outcomes
 CO1: Define the basics of Artificial Intelligence as a discipline.
 CO2: Understand search techniques and gaming theory.
 CO3: Apply knowledge representation techniques and problem-solving strategies to
common AI applications.
 CO4: Explain the use case of AI in real world societal problems and Software agents.
 CO5: Discuss the applicability of Artificial Intelligence Approaches to develop sustainable
solutions using professional ethics.
Artificial Intelligence
AI is one of the fascinating and universal fields of Computer science which has a great scope
in future.
AI holds a tendency to cause a machine to work as a human.
Artificial Intelligence is composed of two words Artificial and Intelligence, where Artificial
defines "man-made," and intelligence defines "thinking power", hence AI means "a man-
made thinking power.“
Replicate human intelligence
Solve Knowledge-intensive tasks
History of AI
Motivation of Artificial Intelligence
Motivation of Artificial Intelligence –
Cont.
Role of Artificial Intelligence
Subareas of AI
 Perception: vision, speech understanding, etc.
 Machine Learning, Neural networks
 Robotics
 Natural language processing
 Reasoning and decision making
 Knowledge representation
 Reasoning (logical, probabilistic)
 Decision making (search, planning, decision theory)
Applications of AI
 Chatbots
 Astronomy
 Gaming
 Finance
 Data Security
 Travel and Transport
 Marketing
 Entertainment
 Military
 Healthcare
 GPS and Navigations
 Automobiles
 Agriculture
 Human Resource
 Lifestyle
Types of AI
 Artificial Intelligence can be divided in various types, there are mainly two types of main
categorization which are based on capabilities and based on functionally of AI.
Following is flow diagram which explain the types of AI.
Weak AI or Narrow AI
 Narrow AI is a type of AI which is able to perform a dedicated task with intelligence. The
most common and currently available AI is Narrow AI in the world of Artificial Intelligence.
 Narrow AI cannot perform beyond its field or limitations, as it is only trained for one
specific task. Hence it is also termed as weak AI. Narrow AI can fail in unpredictable ways if
it goes beyond its limits.
 Apple Siriis a good example of Narrow AI, but it operates with a limited pre-defined range
of functions.
 IBM's Watson supercomputer also comes under Narrow AI, as it uses an Expert system
approach combined with Machine learning and natural language processing.
 Some Examples of Narrow AI are playing chess, purchasing suggestions on e-commerce
site, self-driving cars, speech recognition, and image recognition.
General AI or Strong AI
 General AI is a type of intelligence which could perform any intellectual task with efficiency
like a human.
 The idea behind the general AI to make such a system which could be smarter and think
like a human by its own.
The worldwide researchers are now focused on developing machines with General AI.
 As systems with general AI are still under research, and it will take lots of efforts and time
to develop such systems.
Super AI
 Super AI is a level of Intelligence of Systems at which machines could surpass human
intelligence, and can perform any task better than human with cognitive properties. It is an
outcome of general AI.
 Some key characteristics of strong AI include capability include the ability to think, to
reason, solve the puzzle, make judgments, plan, learn, and communicate by its own.
 Super AI is still a hypothetical concept of Artificial Intelligence. Development of such
systems in real is still world changing task.
Artificial Intelligence type-2: Based on
functionality
1. Reactive Machines
Such AI systems do not store memories or past experiences for future actions. These
machines only focus on current scenarios and react on it as per possible best action.
IBM's Deep Blue system is an example of reactive machines. Google's AlphaGo is also an
example of reactive machines.
2. Limited Memory
Limited memory machines can store past experiences or some data for a short period of
time. These machines can use stored data for a limited time period only.
Self-driving cars are one of the best examples of Limited Memory systems. These cars can
store recent speed of nearby cars, the distance of other cars, speed limit, and other
information to navigate the road.
Artificial Intelligence type-2 – Cont.
3. Theory of Mind
Theory of Mind AI should understand the human emotions, people, beliefs, and be able to
interact socially like humans.
Researchers are making lots of efforts and improvement for developing such AI machines.
4. Self-Awareness
Self-awareness AI is the future of Artificial Intelligence. These machines will be super
intelligent, and will have their own consciousness, sentiments, and self-awareness. These
machines will be smarter than human mind.
Self-Awareness AI does not exist in reality still and it is a hypothetical concept.
Artificial Intelligence- cont.
 Machine Learning
Machine learning is a method of data analysis that
automates analytical model building. It is a branch of
artificial intelligence based on the idea that systems can
learn from data, identify patterns and make decisions
with minimal human intervention.
Machine learning is data driven technology. Large
amount of data generated by organizations on daily
bases. So, by notable relationships in data, organizations
makes better decisions.
Machine can learn itself from past data and
automatically improve.
From the given dataset it detects various patterns on
data.
For the big organizations branding is important and it
will become more easy to target relatable customer base.
Deep Learning
Deep Learning is a subfield of Machine Learning that involves the use of neural networks to
model and solve complex problems.
Neural networks are modeled after the structure and function of the human brain and
consist of layers of interconnected nodes that process and transform data.
The key characteristic of Deep Learning is the use of deep neural networks, which have
multiple layers of interconnected nodes.
These networks can learn complex representations of data by discovering hierarchical
patterns and features in the data.
Deep Learning algorithms can automatically learn and improve from data without the need
for manual feature engineering.
Definition of Artificial Intelligence
"It is a branch of computer science by which we can create intelligent machines which can
behave like a human, think like humans, and able to make decisions."
General Definition
“The exciting new effort to make computers think.. Machine with minds, in the full literal
sense ”
Haugeland, 1985
“The study of how to make computers do things at which, at the moment, people are better.”
Rich & Knight, 1991
Future of Artificial Intelligence
Problem Solving Approach to
Typical AI problems
Problem Solving
Problem solving is a process of generating solutions from observed data.
 a Problem is characterized by a set of goals,
 a set of objects, and
 a set of operations.
Problem
Problem Solving –cont.
To solve the problem of building a system you should take the following steps:
1. Define the problem accurately including detailed specifications and what constitutes a
suitable solution.
2. Scrutinize the problem carefully, for some features may have a central affect on the
chosen method of solution.
3. Segregate and represent the background knowledge needed in the solution of the
problem.
4. Choose the best solving techniques for the problem to solve a solution.
Steps require to solve a problem
These are the following steps which require to solve a problem :
 Problem definition: Detailed specification of inputs and acceptable system solutions.
 Problem analysis: Analyse the problem thoroughly.
 Knowledge Representation: collect detailed information about the problem and define all
possible techniques.
 Problem-solving: Selection of best techniques.
Problem Solving –cont.
Components to formulate the
associated problem
 Initial State: This state requires an initial state for the problem which starts the AI agent
towards a specified goal. In this state new methods also initialize problem domain solving
by a specific class.
 Action: This stage of problem formulation works with function with a specific class taken
from the initial state and all possible actions done in this stage.
 Transition: This stage of problem formulation integrates the actual action done by the
previous action stage and collects the final stage to forward it to their next stage.
 Goal test: This stage determines that the specified goal achieved by the integrated
transition model or not, whenever the goal achieves stop the action and forward into the
next stage to determines the cost to achieve the goal.
 Path costing: This component of problem-solving numerical assigned what will be the cost
to achieve the goal. It requires all hardware software and human working cost.
Heuristic Search Techniques
To find a solution in proper time rather than a complete solution in unlimited time we use
heuristics.
 ‘A heuristic function is a function that maps from problem state descriptions to measures of
desirability, usually represented as numbers’.
 Heuristic search methods use knowledge about the problem domain and choose promising
operators first.
 These heuristic search methods use heuristic functions to evaluate the next state towards
the goal state. The algorithms that use heuristic functions are called heuristic algorithms.
 Heuristic algorithms are not really intelligent; they appear to be intelligent because they
achieve better performance.
 Heuristic algorithms are more efficient because they take advantage of feedback from the
data to direct the search path.
Search Algorithm
 Uninformed search algorithms or Brute-force algorithms
 Informed search algorithms
Uninformed search algorithms or
Brute-force algorithms
 Uninformed search, also known as blind search, is a search algorithm that explores a problem space
without any specific knowledge or information about the problem other than the initial state and
the possible actions to take.
 It lacks domain-specific heuristics or prior knowledge about the problem.
 Uninformed search algorithms, such as breadth-first search and depth-first search, systematically
explore the search space by applying predefined rules to generate successor states until a goal state
is found or the search is exhausted.
 These algorithms are typically less efficient than informed search algorithms but can be useful in
certain scenarios or as a basis for more advanced search techniques.
Search Algorithm
 Breadth First Search
 Breadth-first search is a simple strategy in which the root node is expanded first, then all the successors of
the root node are expanded next, then their successors, and so on.
 In general, all the nodes are expanded at a given depth in the search tree before any nodes at the next level
are expanded.
 In this strategy, no viable solutions are omitted and therefore it is guaranteed that an optimal solution is
found.
 This strategy is often not feasible when the search space is large.
Advantages
 Guaranteed to find an optimal solution (in terms of shortest number of steps to reach the goal).
 Can always find a goal node if one exists (complete).
Disadvantages
 High storage requirement: exponential with tree depth.
Breadth First Search
Breadth First Search
Breadth First Search
Breadth First Search
Breadth First Search
Breadth First Search - complexity
Time Complexity: Time Complexity of BFS algorithm can be obtained by the number of
nodes traversed in BFS until the shallowest Node. Where the d= depth of shallowest solution
and b is a node at every state.
T (b) = 1+b2+b3+.......+ bd= O (bd)
Space Complexity: Space complexity of BFS algorithm is given by the Memory size of
frontier which is O(bd).
Completeness: BFS is complete, which means if the shallowest goal node is at some finite
depth, then BFS will find a solution.
Optimality: BFS is optimal if path cost is a non-decreasing function of the depth of the node.
Depth First Search
 A search strategy that extends the current path as far as possible before backtracking to the last
choice point and trying the next alternative path is called Depth-first search (DFS).
 This strategy does not guarantee that the optimal solution has been found.
 In this strategy, search reaches a satisfactory solution more rapidly than breadth first, an
advantage when the search space is large.
Advantages
 Low storage requirement: linear with tree depth.
 Easily programmed: function call stack does most of the work of maintaining state of the search.
Disadvantages
 May find a sub-optimal solution (one that is deeper or more costly than the best solution).
 Incomplete: without a depth bound, may not find a solution even if one exists.
Depth First Search
Depth First Search
Completeness: DFS search algorithm is complete within finite state space as it will expand
every node within a limited search tree.
Time Complexity: Time complexity of DFS will be equivalent to the node traversed by the
algorithm. It is given by:
T(n)= 1+ n2+ n3 +.........+ nm=O(nm)
Where, m= maximum depth of any node and this can be much larger than d
(Shallowest solution depth)
Space Complexity: DFS algorithm needs to store only single path from the root node, hence
space complexity of DFS is equivalent to the size of the fringe set, which is O(bm).
Where b is the branching factor and m is the maximum depth of tree.
Variant of DFS called backtracking search uses even less memory.
Dijkstra’s Algorithm (Uniform Cost
Search)
 Dijkstra’s algorithm is a popular algorithms for solving many single-source shortest path
problems having non-negative edge weight in the graphs i.e., it is to find the shortest
distance between two vertices on a graph.
 It was conceived by Dutch computer scientist Edsger W. Dijkstra in 1956.
 When actions have different costs, an obvious choice is to use best-first search where the
evaluation function is the cost of the path from the root to the current node. This is called
Dijkstra’s algorithm by CS community and uniform cost search by the AI community.
 Uniform cost search is complete and is cost optimal. Because the first solution it finds will
have a cost that is at least as low as the cost of any other node in the frontier (queue).
Dijkstra’s Algorithm
 Uniform-cost search is guided by path costs rather than depths, so its complexity is not
easily characterized in terms of b and d.
 Instead, let C* be the cost of the optimal solution, and assume that every action costs at
least e.
 Then the algorithm's worst-case time and space complexity is O(b1 + [C*/ε]) which can be
much greater than b d .
When all step costs are equal, O(b1 + [C*/ε]) just O (bd). When all step costs are the same,
uniform-cost search is similar to breadth-first search.
 C* is Cost of the optimal solution. ε is each step to get closer to the goal node. Then the
number of steps is = C*/ε+1, Here we have taken +1, as we start from state 0 and end to
C*/ε.
Dijkstra’s Algorithm
Advantage
 One of the main advantages of it is its little complexity which is almost linear.
Disadvantages:
 It does an obscured exploration that consumes a lot of time while processing,
 It is unable to handle negative edges,