Eliud Mark

MAC-1-8590-2/2018
KEMU main campus

AI assignment 1st trimester 2021

March 31, 2021

emark8590@stu.kemu.ac.ke

a) State any five properties of an intelligent agent (5mks)

They have a learning ability that enables them to learn even as tasks are carried out.
They can interact with other entities such as agents, humans, and systems.
New rules can be accommodated by intelligent agents incrementally.
They exhibit goal-oriented habits.
They are knowledge-based. They use knowledge regarding communications, processes, and entities.

b) State any four advantages of machine learning systems (4mks)

1. Identifies trends and patterns easily- Machine learning involves reviewing

large volumes of data to discover specific trends and patterns that would
most often not be apparent to humans. For example, machine learning will
be useful for an e-commerce website like Amazon, to understand purchase
histories and browsing behaviors of its users to cater to the right deals,
products, and reminders that are relevant to them.
2. Automation- Machine learning does not require human intervention. It
gives machines the ability to learn. It helps machines make predictions and
improve the algorithms by themselves. Anti-virus software is a common
example of this as they automatically filter new threats as & when they are
recognized.
3. Continuous improvement- Machine learning algorithms improve in
accuracy and efficiency as they gain experience. This helps them take better
decisions.
4. Machine Learning algorithms are good at handling data that are
multi-dimensional and multi-variety, and they can do this in dynamic or
uncertain environments.

c) Explain why psychology may be regarded as the foundation of artificial intelligence (4mks)
Psychology is one of the parent elements of artificial intelligence or we can also say that it
is the main source for artificial intelligence. Since psychology is the study of human brain and
its nature and AI is the branch which deals with the intelligence in machine, for
understanding the intelligence of a machine we compare with human intelligence because
AI means the intelligence shown by a machine like a human being.

d) Explain the following terms as used in search algorithm evaluation

i) Completeness (2mks)
ii) Optimality (2mks)
iii) Cost (2mks)

i)Completeness
If an algorithm is complete,
it means that if at least one solution exists then the algorithm is guaranteed find a solution
in a finite amount of time.
ii) Optimality
If a search algorithm is optimal, then when it finds a solution it finds the best solution.

iii) Cost
Its cost effective when the algorithm uses less computing power to find the best solution

e) Represent the following sentences in first order predicate calculus

iv) Jane likes only easy courses (2mks)
v) All courses in arts are easy (2mks)
vi) Science courses are hard (2mks)

f) Explain any five problems addressed by an expert system (5mks)

1.Don’t have human-like decision making power/Unable to make a creative response in
an extraordinary situation

2.Can’t possess human capabilities Lack of creative responses that human experts are
capable of

3.Can’t produce correct result from less amount of knowledge/Errors in the knowledge
base can lead to wrong decision

4.Requires excessive training/The maintenance cost of an expert system is too

expensive

5. There is no flexibility and ability to adapt to changing environments

G) Discuss the climbing hill algorithm as used in artificial

intelligence stating its advantages and disadvantages

Hill climbing search algorithm is simply a loop that continuously moves in the
direction of increasing value. It stops when it reaches a “peak” where no neighbour
has higher value. This algorithm is considered to be one of the simplest procedures
for implementing heuristic search. The hill climbing comes from that idea if you
are trying to find the top of the hill and you go up direction from where ever you
are. This heuristic combines the advantages of both depth first and breadth first
searches into a single method.
 
 
The name hill climbing is derived from simulating the situation of a person
climbing the hill. The person will try to move forward in the direction of at the top
of the hill. His movement stops when it reaches at the peak of hill and no peak has
higher value of heuristic function than this. Hill climbing uses knowledge about the
local terrain, providing a very useful and effective heuristic for eliminating much
of the unproductive search space. It is a branch by a local evaluation function. The
hill climbing is a variant of generate and test in which direction the search should
proceed. At each point in the search path, a successor node that appears to reach
for exploration.
 
Algorithm:
 
Step 1: Evaluate the starting state. If it is a goal state then stop and return success.
 
Step 2: Else, continue with the starting state as considering it as a current state.
 
Step 3: Continue step-4 until a solution is found i.e. until there are no new states
left to be applied in the current state.
 
Step 4:
 
a)    Select a state that has not been yet applied to the current state and apply it to
produce a new state.
 
b)    Procedure to evaluate a new state.
 
i.     If the current state is a goal state, then stop and return success.
 
ii.     If it is better than the current state, then make it current state and proceed
further.
 
iii.    If it is not better than the current state, then continue in the loop until a
solution is found.
 
Step 5: Exit.
 
 
 
Advantages:
 
Hill climbing technique is useful in job shop scheduling, automatic
programming, circuit designing, and vehicle routing and portfolio
management.
 
It is also helpful to solve pure optimization problems where the objective is to
find the best state according to the objective function.
 
It requires much less conditions than other search techniques.
 
Disadvantages:
 
The one challenge that remains on hill climbing search is whether this hill is the
highest hill possible. Unfortunately without further extensive exploration, this
question cannot be answered. This technique works but as it uses local information
that’s why it can be fooled. The algorithm doesn’t maintain a search tree, so the
current node data structure need only record the state and its objective function
value. It assumes that local improvement will lead to global improvement.