UNIT_1

If needed refer: https://youtube.com/playlist?list=PLrjkTql3jnm_yol-

ZK1QqPSn5YSg0NF9r&si=FjyqlOUCMmSDvfMT
1.Write a note on “Acting humanly, the Turing test approach”.
Acting humanly: The Turing Test approach
o Test proposed by Alan Turing in 1950
o The computer is asked questions by a human interrogator.
The computer passes the test if a human interrogator, after posing some written
questions,cannot tell whether the written responses come from a person or not.
Programming a computer to pass, the computer need to possess the following
capabilities:
● Natural language processing to enable it to communicate successfully in English.
● Knowledge representation to store what it knows or hears
● Automated reasoning to use the stored information to answer questions and to
draw new conclusions
● Machine learning to adapt to new circumstances and to detect and extrapolate
patterns
To pass the complete Turing Test, the computer will need
● Computer vision to perceive the objects
● Robotics to manipulate objects and move about.
6. Explain any six AI applications

7. Explain any six state of the art AI applications.

Autonomous control: The ALVINN computer vision system was trained to steer a car to
keep it following a lane. It was placed in CMU's NAVLAB computer-controlled minivan
and used to navigate across the United States
Game playing: IBM's Deep Blue became the first computer program to defeat the
world champion in a chess match when it bested Garry Kasparov by a score of 3.5 to
2.5 in an exhibition match (Goodman and Keene, 1997).
Diagnosis: Medical diagnosis programs based on probabilistic analysis have been able
to perform at the level of an expert physician in several areas of medicine.
Autonomous planning and scheduling: A hundred million miles from Earth, NASA's
Remote Agent program became the first on-board autonomous planning program to
control the scheduling of operations for a spacecraft (Jonsson et al., 2000). Remote
Agent generated plans from high-level goals specified from the ground, and it
monitored the operation of the spacecraft as the plans were executed-detecting,
diagnosing, and recovering from problems as they occurred.
Robotics: Many surgeons now use robot assistants in microsurgery. HipNav (DiGioia
et al.,1996) is a system that uses computer vision techniques to create a three
dimensional model of a patient's internal anatomy and then uses robotic control to
guide the insertion of a hip replacement prosthesis.Language understanding and
problem solving: PROVERB (Littman et al., 1999) is a computer program that solves
crossword puzzles better than most humans,using constraints on possible word
fillers, a large database of past puzzles, and a variety of information sources
including dictionaries and online databases such as a list of movies and the actors
that appearin them.

11.How do you specify a task environment using PEAS description? Explain

with an example.
We must think about task environments, which are essentially the "problems" to
which rational agents are the "solutions." Specifying the task environment The
rationality of the simple vacuum-cleaner agent, needs specification of
● the performance measure
● the environment
● the agent's actuators and sensors.
PEAS :All these are grouped together under the heading of the task environment. We
call this the PEAS (Performance, Environment, Actuators, Sensors) description. In
designing an agent, the first step must always be to specify the task environment as
fully as possible
15.Explain simple reflex agent with a neat diagram.
The simplest kind of agent is the simple reflex agent. These agents select actions on
the basis of the current percept, ignoring the rest of the percept history. For example,
the vacuum agent whose agent function is a simple reflex agent, because its decision
is based only on the current location and on whether that contains dirt.
● Select action on the basis of only the current percept. E.g. the vacuum-agent
● Large reduction in possible percept/action situations(next page).
● Implemented through condition-action rules. If dirty then suck

Characteristics
● Only works if the environment is fully observable.
● Lacking history, easily get stuck in infinite loops
● One solution is to randomize actions

16.Briefly explain model based reflex agent with a diagram.

The most effective way to handle partial observability is for the agent to keep track of
the part of the world it can't see now. That is, the agent should maintain some sort of
internal state that depends on the percept history and thereby reflects at least some
of the unobserved aspects of the current state. Updating this internal state
information as time goes by requires two kinds of knowledge to be encoded in the
agent program. First, we need some information about how the world evolves
independently of the agent-for example, that an overtaking car generally will be closer
behind than it was a moment ago. Second, we need some information about how the
agent's own actions affect the world-for example, that when the agent turns the
steering wheel clockwise, the car turns to the right or that after driving for five
minutes northbound on the freeway one is usually about five miles north of where
one was five minutes ago. This knowledge about "how the world working - whether
implemented in simple Boolean circuits or in complete scientific theories-is called a
model of the world. An agent that uses such a MODEL-BASED model is called a
model-based agent.

17.Briefly explain goal based reflex agent with a diagram

Knowing about the current state of the environment is not always enough to decide
what to do. For example, at a road junction, the taxi can turn left, turn right, or go
straight on. The correct decision depends on where the taxi is trying to get to. In
other words, as well as a current state description, the agent needs some sort of goal
information that describes situations that are desirable-for example, being at the
passenger's destination. The agentprogram can combine this with information about
the results of possible actions (the same information as was used to update internal
state in the reflex agent) in order to choose actions that achieve the goal. Figure 1.14
shows the goal-based agent's structure.
 UNIT_2
[2m] 5. What is a fringe?
To represent the collection of nodes that have been generated but not yet FRINGE
expanded-this collection is called the fringe. Each element of the fringe is a leaf node.

5. Explain BFS algorithm with example

 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
 Breadth-first search can be implemented by calling TREE-SEARCH with an
empty fringe that is a first-in-first-out (FIFO) queue, assuring that the nodes
that are visited first will be expanded first
 The FIFO queue puts all newly generated successors at the end of the queue,
which means that shallow nodes are expanded before deeper nodes.


 

10.Explain Bidirectional search algorithm with example

Bidirectional search algorithm runs two simultaneous searches, one form initial state
called as forward-search and other from goal node called as backward-search, to find
the goal node. Bidirectional search replaces one single search graph with two small
subgraphs in which one starts the search from an initial vertex and other starts from
goal vertex. The search stops when these two graphs intersect each other.
12.Explain the vacuum world problem.
16.Explain Breadth First Search. Also discuss its performance.
Refer question5

20.Explain A* algorithm. Consider the map of Romania and the hSLD value
table given. Use A* algorithm to find a path from Arad to Bucharest.
 UNIT_3
[2m] 26. What are Universal quantifiers. Give example.
Universal quantifiers are logical symbols used in formal logic to indicate that a
particular property or predicate applies to all elements within a specified domain. The
universal quantifier is usually denoted by the symbol "∀" (an upside-down "A"), which
can be read as "for all" or "for every."
Example:
Consider the statement:
∀𝑥(𝑃(𝑥))
This statement reads as "For all x, P(x) is true," meaning that the property P holds for
every element x in the domain of discourse.

6. Consider given KB and using inference rule make the conclusion neither [1,2]
nor [2,1] contains pit.
8. Explain the various logical connectives used in propositional logic.
9. Explain entailment in wumpus world problem with example
10.Explain wumpus world game with diagram and agent program of it

 Initial Setup and Knowledge:

 The agent starts in square [1,1][1,1][1,1], which is known to be safe.

 The environment rules are known, including the conditions for breeze
(indicating a pit) and stench (indicating the Wumpus).

 First Percept:

 The first percept is [None,None,None,None,None][None, None, None, None,

None][None,None,None,None,None], indicating no stench, breeze, glitter, bump,
or scream.
 The agent concludes that the neighboring squares [1,2][1,2][1,2] and
[2,1][2,1][2,1] are safe and marks them as OK.

 Moving to [2,1][2,1][2,1]:

 The agent moves to [2,1][2,1][2,1] and detects a breeze.

  This indicates a pit in one of the adjacent squares: [2,2][2,2][2,2], [3,1][3,1][3,1],
or both.
 The agent marks [2,2][2,2][2,2] and [3,1][3,1][3,1] with P? (possible pit).

 Exploring [1,2][1,2][1,2]:

 The agent returns to [1,1][1,1][1,1] and moves to [1,2][1,2][1,2].

 In [1,2][1,2][1,2], it detects a stench, implying the Wumpus is nearby.
 Since the Wumpus cannot be in [1,1][1,1][1,1] or [2,2][2,2][2,2] (no stench
detected earlier), the agent infers the Wumpus is in [1,3][1,3][1,3].

 Further Inferences:

 The lack of a breeze in [1,2][1,2][1,2] means no pit in [2,2][2,2][2,2].

 Combining earlier knowledge, the agent concludes there is a pit in
[3,1][3,1][3,1].

 Safe Moves and Finding Gold:

 The agent determines [2,2][2,2][2,2] is safe and moves there, then to

[2,3][2,3][2,3].
 In [2,3][2,3][2,3], the agent detects glitter, indicating gold.
 The agent grabs the gold, ending the game.

Agent program:
The agent's program is a set of rules and inferences based on percepts and the
agent's current knowledge. Here is a simplified version in pseudocode:
# Initial Knowledge Base
kb = {(1, 1): 'OK'}
percepts = {(1, 1): [None, None, None, None, None]}

def mark_adjacent(location, status):

x, y = location
for adj in [(x-1, y), (x+1, y), (x, y-1), (x, y+1)]:
if adj not in kb: kb[adj] = status

def wumpus_world_agent(location, percept):

kb[location] = percept
if percept[0] is None: mark_adjacent(location, 'OK')
if percept[1] == 'Breeze': mark_adjacent(location, 'P?')
if percept[2] == 'Stench': mark_adjacent(location, 'W?')
if percept[3] == 'Glitter': return "Gold grabbed! Game over."
move_to = next(loc for loc, status in kb.items() if status == 'OK' and loc not in kb)
wumpus_world_agent(move_to, percepts.get(move_to, [None]*5))

# Initial agent move

print(wumpus_world_agent((1, 1), percepts[(1, 1)]))

24.Explain model for first order logic with example.

  Models for propositional logic consist of sets of truth values for proposition
symbols.
 Models for first-order logic contain objects known as domain elements, with the
domain being the set of objects in the model.
 An example model includes five objects: Richard the Lionheart, King John,
Richard's left leg, John's left leg, and a crown.
 Binary relations in the model involve pairs of objects, such as the brotherhood
relation, which includes the tuples (Richard, John) and (John, Richard), and
the "on head" relation, which includes the tuple (crown, John).
 Unary relations, or properties, include the "person" property, true for both
Richard and John, the "king" property, true only for John, and the "crown"
property, true only for the crown.
 The model also includes unary functions, such as the "left leg" function, which
maps each person to their left leg: Richard to Richard's left leg and John to
John's left leg.
 Models in first-order logic require total functions, meaning every input tuple
must have a value.
 A technical solution to ensure total functions involves an additional "invisible"
object that acts as the left leg for anything that does not have one.
 These technicalities are usually irrelevant unless assertions are made about
the left legs of objects that do not have them.

27.List and Explain the steps of knowledge engineering process in FOL.

Knowledge engineering projects vary widely in content, scope, and difficulty, but all
such projects include the following steps:
1. Identify the task.
 Define the range of questions the knowledge base will support and the kinds of
facts available for each problem instance.
 Determine if the knowledge base needs to choose actions or just answer
questions about the environment.
2. Assemble the relevant knowledge.

 Gather knowledge from domain experts or through knowledge acquisition.

 Understand the scope of the knowledge base and how the domain works.

3. Decide on a vocabulary of predicates, functions, and constants.

 Translate domain concepts into logical terms like predicates, functions, and
constants.
 Create the ontology, defining the types of things that exist but not their specific
properties.
4. Encode general /knowledge about the domain.
 Write axioms for all vocabulary terms to clarify their meanings.
 Iterate if misconceptions or gaps are found.
5. Encode a description of the specific problem instance
 Write atomic sentences about instances of concepts from the ontology.
 For logical agents, problem instances are provided by sensors.
6. Pose queries to the inference procedure and get answers.

 Use the inference procedure to derive facts of interest from axioms and
problem-specific facts.
7. Debug the knowledge base.
 Fix errors by identifying missing, weak, or incorrect axioms.
 Correct statements that do not match real-world facts and ensure logical
consistency.

31.Explain Unification algorithm.

 o Unification is a process of making two different logical atomic expressions
identical by finding a substitution. Unification depends on the substitution
process.
o It takes two literals as input and makes them identical using substitution.
o Let Ψ1 and Ψ2 be two atomic sentences and 𝜎 be a unifier such that, Ψ1𝜎 = Ψ2𝜎,
then it can be expressed as UNIFY(Ψ1, Ψ2).
o Example: Find the MGU for Unify{King(x), King(John)}

Let Ψ1 = King(x), Ψ2 = King(John),

Substitution θ = {John/x} is a unifier for these atoms and applying this substitution,
and both expressions will be identical.

o The UNIFY algorithm is used for unification, which takes two atomic sentences
and returns a unifier for those sentences (If any exist).
o Unification is a key component of all first-order inference algorithms.
o It returns fail if the expressions do not match with each other.
o The substitution variables are called Most General Unifier or MGU.

E.g. Let's say there are two different expressions, P(x, y), and P(a, f(z)).

In this example, we need to make both above statements identical to each other. For
this, we will perform the substitution.

P(x, y)......... (i)

P(a, f(z))......... (ii)

o Substitute x with a, and y with f(z) in the first expression, and it will be
represented as a/x and f(z)/y.
o With both the substitutions, the first expression will be identical to the second
expression and the substitution set will be: [a/x, f(z)/y].

Conditions for Unification:

Following are some basic conditions for unification:

o Predicate symbol must be same, atoms or expression with different predicate

symbol can never be unified.
 o Number of Arguments in both expressions must be identical.
o Unification will fail if there are two similar variables present in the same
expression.

32.Explain forward chaining algorithm in FOL.

Forward chaining is a data-driven reasoning method used in artificial
intelligence,particularly in rule-based systems, for inferring new facts from known
facts and rules. In first-order logic (FOL), forward chaining uses a set of inference
rules to derive conclusions from given premises.

Example Facts:
1. American(West)American(West)American(West)
2. Missile(M1)Missile(M_1)Missile(M1)
3. Owns(Nono,M1)Owns(Nono, M_1)Owns(Nono,M1)
4. Sells(West,M1,Nono)Sells(West, M_1, Nono)Sells(West,M1,Nono)
5. Enemy(Nono,America)Enemy(Nono, America)Enemy(Nono,America)
Example Rules:
1. American(x)∧Weapon(y)∧Sells(x,y,z)∧Hostile(z)→Criminal(x)
2. Missile(x)→Weapon(x)
3. Enemy(x,America)→Hostile(x)
Query:
● Is Criminal(West)Criminal(West)Criminal(West) true?
Diagram:
Pseudocode:
def forward_chaining(facts, rules, goal):
working_memory = set(facts)
while True:
new_facts = set()
for rule in rules:
if rule.premise_matches(working_memory):
inferred_fact = rule.apply()
if inferred_fact == goal:
return True
new_facts.add(inferred_fact)
if not new_facts:
return False
working_memory.update(new_facts)

Algorithm Steps Applied to Example:

1. Initialization:
○ Facts in KB:
{American(West),Missile(M1),Owns(Nono,M1),Sells(West,M1,Nono),Enemy
(Nono,America)}
2. First Iteration:
○ Apply Rule 2: Missile(M1)→Weapon(M1)
○ New fact inferred: Weapon(M1)
3. Second Iteration:
○ Apply Rule 3: Enemy(Nono,America)→Hostile(Nono)
○ New fact inferred: Hostile(Nono)
4. Third Iteration:
○ Apply Rule 1:
American(West)∧Weapon(M1)∧Sells(West,M1,Nono)∧Hostile(Nono)→Criminal(West)
○ All premises match known facts.
○ New fact inferred: Criminal(West)
Result:
● The query Criminal(West) is true as it has been inferred through forward chaining.
Summary
Forward chaining in FOL involves initialising with known facts, matching rules with
these facts, applying rules to infer new facts, and iterating this process until the
query is confirmed or no new facts are generated. In the given example, forward
chaining successfully infers Criminal(West) based on the initial facts and rules in the
knowledge base.

33.Explain backward chaining algorithm in FOL.

Backward chaining in First-Order Logic (FOL), also known as backward reasoning, is
a method used for automated theorem proving and reasoning in artificial intelligence
and logic programming.
Figure 9.6 shows a simple backward-chaining algorithm, FOL-BC-ASK. It is called
with a list of goals containing a single element, the original query, and returns the set
of all substitutions satisfying the query. The list of goals can be thought of as a
"stack" waiting to be worked on; if all of them can be satisfied, then the current
branch of the proof succeeds. The algorithm takes the first goal in the list and finds
every clause in the knowledge base whose positive literal, or head, unifies with the
goal. Each such clause creates a new recursive call in which the premise, or body, of
the clause is added to the goal stack. Remember that facts are clauses with a head
but no body, so when a goal unifies with a known fact, no new subgoals are added to
the stack and the goal is solved. Figure 9.7 is the proof tree for deriving Criminal(
West) from sentences (9.3) through (9.10).
In the algorithm, the current variable bindings, which are stored in 8, are composed
with the bindings resulting from unifying the goal with the clause head, giving a new
set of current bindings for the recursive call.

UNIT_4
[2m] 25.List the different types of layers in Convolution Neural Network.
CNN consists of four main types of layers: input layer, convolution
layer, pooling layer, fully connected layer.
[2m] 26.List the components of LSTM.
• Input gate layer
• Forget gate layer
• Output gate layer
• Memory cell state vector

1. List and explain the different components of Machine learning.

1. Data storage
Facilities for storing and retrieving huge amounts of data are an important
component of the learning process. Humans and computers alike utilize data storage
as a foundation for advanced reasoning.
• In a human being, the data is stored in the brain and data is retrieved using
electrochemical signals.
• Computers use hard disk drives, flash memory, random access memory and similar
devices to store data and use cables and other technology to retrieve data.
2. Abstraction
The second component of the learning process is known as abstraction. Abstraction
is the process of extracting knowledge about stored data. This involves creating
general concepts about the data as a whole. The creation of knowledge involves
application of known models and creation of new models.
The process of fitting a model to a dataset is known as training. When the model has
been trained, the data is transformed into an abstract form that summarizes the
original information.
3. Generalization
The third component of the learning process is known as generalisation. The term
generalization describes the process of turning the knowledge about stored data into
a form that can be utilized for future action. These actions are to be carried out on
tasks that are similar, but not identical, to those what have been seen before. In
generalization, the goal is to discover those properties of the data that will be most
relevant to future tasks.
4. Evaluation
Evaluation is the last component of the learning process. It is the process of giving
feedback to the user to measure the utility of the learned knowledge. This feedback is
then utilized to effect improvements in the whole learning process.

10.Briefly explain Linear Regression.

• Linear regression is a statistical regression method which is used for predictive
analysis.
• It is one of the very simple and easy algorithms which works on regression and
shows the relationship between the continuous variables.
• It is used for solving the regression problem in machine learning.
• Linear regression shows the linear relationship between the independent variable
(X-axis) and the dependent variable (Yaxis), hence called linear regression.
• If there is only one input variable (x), then such linear regression is called simple
linear regression. And if there is more than one input variable, then such linear
regression is called multiple linear regression.
• The relationship between variables in the linear regression model can be explained
using the below image. Here we are predicting the salary of an employee on the basis
of the year of experience.

Below is the mathematical equation for Linear regression:

Y= aX+b
Here,
Y = dependent variables (target variables), X= Independent variables (predictor
variables), a and b are the linear coefficients
Some popular applications of linear regression are:
• Analyzing trends and sales estimates
• Salary forecasting
• Real estate prediction
• Arriving at ETAs in traffic.
In non-linear regression, the data can‘t be modelled to fit a straight line i.e. modelled
to fit a curve as shown in below figure.

For example the equation can have the form: XTheta

Here are some examples of real-world regression problems.
• Predict tomorrow‘s stock market price given current market conditions and other
possible side information.
• Predict the age of a viewer watching a given video on YouTube. .

15.List and explain the types of Artificial Neural Network.

There are various types of Artificial Neural Networks (ANN) depending upon the
human brain neuron and network functions, an artificial neural network similarly
performs tasks. The majority of the artificial neural networks will have some
similarities with a more complex biological partner and are very effective at their
expected tasks. For example, segmentation or classification.
• Feedback ANN: In this type of ANN, the output returns into the network to
accomplish the best-evolved results internally.As per the University of
Massachusetts, Lowell Centre for Atmospheric Research. The feedback networks
feedinformation back into itself and are well suited to solve optimization issues. The
Internal system error correctionsutilize feedback ANNs.
• Feed-Forward ANN: A feed-forward network is a basic neural network comprising of
an input layer, an output layer, and at leastone layer of a neuron. Through
assessment of its output by reviewing its input, the intensity of the network can
benoticed based on group behavior of the associated neurons, and the output is
decided. The primary advantage of this network is that it figures out how to evaluate
and recognize input patterns.
• Prerequisite
No specific expertise is needed as a prerequisite before starting this tutorial.
• Audience
Our Artificial Neural Network Tutorial is developed for beginners as well as
professionals, to help them understand the basic concept of ANNs.

22.Explain the phases of NLP.

There are the following five phases of NLP:
1. Lexical Analysis and Morphological: The first phase of NLP is the Lexical Analysis.
This phase scans the source code as a stream of characters and converts it into
meaningful lexemes. It divides the whole text into paragraphs, sentences, and words.
2. Syntactic Analysis (Parsing): Syntactic Analysis is used to check grammar, word
arrangements, and shows the relationship among the words.
Example: Agra goes to the PoonamIn the real world, Agra goes to the Poonam, does
not make any sense, so this sentence is rejected by the Syntactic analyzer.
3. Semantic Analysis: Semantic analysis is concerned with the meaning
representation. It mainly focuses on the literal meaning of words, phrases, and
sentences.
4. Discourse Integration: Discourse Integration depends upon the sentences that
proceeds it and also invokes the meaning of the sentences that follow it.
5. Pragmatic Analysis: Pragmatic is the fifth and last phase of NLP. It helps you to
discover the intended effect by applying a set of rules that characterize cooperative
dialogues.
For Example: "Open the door" is interpreted as a request instead of an order.

28.Explain the elements of Image processing.

AI image processing works through a combination of advanced algorithms, neural
networks, and data processing to analyze, interpret, and manipulate digital images.
Here's a simplified overview of how AI image processing works:

Acquisition of image: The initial level begins with image preprocessing which uses a
sensor to capture the image andtransform it into a usable format.
Enhancement of image: Image enhancement is the technique of bringing out and
emphasising specific interesting characteristics which are hidden in an image.
Restoration of image: Image restoration is the process of enhancing an image's look.
Picture restoration, as opposed to image augmentation, is carried out utilising
specific mathematical or probabilistic models.
Colour image processing: A variety of digital colour modelling approaches such as HSI
(Hue-Saturation-Intensity), CMY (CyanMagenta-Yellow) and RGB (Red-Green-Blue)
etc. are used in colour picture processing.
Compression and decompression of image:This enables adjustments to image
resolution and size, whether for image reduction or restoration depending on the
situation, without lowering image quality below a desirable level. Lossy and lossless
compression techniques are the two main types of image file compression which are
being employed in this stage.
Morphological processing:Digital images are processed depending on their shapes
using an image processing technique known as morphological operations. The
operations depend on the pixel values rather than their numerical values, and well
suited for the processing of binary images. It aids in removing imperfections for
structure of the image.
Segmentation, representation and description: The segmentation process divides a
picture into segments, and each segment is represented and described in such a way
that it can be processed further by a computer. The image's quality and regional
characteristics are covered by representation. The description's job is to extract
quantitative data that helps distinguish one class of items from another.
Recognition of image: A label is given to an object through recognition based on its
description. Some of the often-employed algorithms in the process of recognizing
images include the Scale invariant Feature Transform (SIFT), the Speeded Up Robust
Features (SURF), and the PCA (Principal Component Analysis)

33.Explain the different types of Robots

1. Androids
Androids are robots that resemble humans. They are often mobile, moving around on
wheels or a track drive. According to the American Society of Mechanical Engineers,
these humanoid robots are used in areas such as caregiving and personal assistance,
search and rescue, space exploration and research, entertainment and education,
public relations and healthcare, and manufacturing.
2. Telechir
A telechir is a complex robot that is remotely controlled by a human operator for a
telepresence system. It gives that individual the sense of being on location in a
remote, dangerous or alien environment, and enables them to interact with it since
the telechir continuously provides sensory feedback.
3. Telepresence robot
A telepresence robot simulates the experience -- and some capabilities -- of being
physically present at a location. It combines remote monitoring and control via
telemetry sent over radio, wires or optical fibers, and enables remote business
consultations, healthcare, home monitoring, childcare and more.
4. Industrial robot
The IFR (International Federation of Robotics) defines an industrial robot as an
"automatically controlled, reprogrammable multipurpose manipulator programmable
in three or more axes." Users can adapt these robots to different applications as well.
Combining these robots with AI has helped businesses move them beyond simple
automation to higher-level and more complex tasks.
5.Swarm robot
Swarm robots (aka insect robots) work in fleets ranging from a few to thousands, all
under the supervision of a single controller. These robots are analogous to insect
colonies, in that they exhibit simple behaviors individually, but demonstrate
behaviors that are more sophisticated with an ability to carry out complex tasks in
total.
6. Smart robot
This is the most advanced kind of robot. The smart robot has a built-in AI system
that learns from its environment and experiences to build knowledge and enhance
capabilities to continuously improve. A smart robot can collaborate with humans and
help solve problems in areas like the following:
• agricultural labor shortages;
• food waste;
• study of marine ecosystems;

17.Write a note on the following:

a. CNN
b. RNN
c. LSTM
Convolution Neural Network (CNN)
CNN’s are similar to ordinary neural networks, except that it explicitly assumes that
the inputs are images, which allows us to encode certain properties into the
architecture. These then make the forward function efficient to implement and
reduces the parameters in the network. The neurons are arranged in three
dimensions: width, height, and depth
Recurrent Neural Network (RNN)
The MLP (feedforward network) is not known to do well on sequential events models
such as the probabilistic language model of predicting the next word based on the
previous word at every given point. RNN architecture addresses this issue. It is
similar to MLP except that they have a feedback loop, which means they feed
previous time steps into the current step. This type of architecture generates
sequences to simulate situation and create synthetic data, making them the ideal
modeling choice to work on sequence data such as speech text mining, image
captioning, time series prediction, robot control, language modeling, etc.
Long Short-Term Memory (LSTM)
LSTM is an implementation of improved RNN architecture to address the issues of
general RNN, and it enables long-range dependencies. It is designed to have better
memory through linear memory cells surrounded by a set of gate units used to
control the flow of information, when information should enter the memory, when to
forget, and when to output. It uses no activation function within its recurrent
components, thus the gradient term does not vanish with back propagation.
LSTM components are:
• Input gate layer: This decides which values to store in the cell state
• Forget gate layer: As the name suggested this decides what information to throw
away from the cell state
• Output gate layer: Create a vector of values that can be added to the cell state.
• Memory cell state vector