ARTIFICIAL INTELLIGENCE AND ROBOTICS LAB

Course Code: BTM 823 Credit Units: 01

Course Contents:

S. NO. NAME OF EXPERIMENTS

1 Robot Arm (Model 1055)
2 Write a prolog program to define a relations knowledge base as follows : Assume the following
in the kbase :
Male (person), female (person), husband (person, person0, wife(person, person), father (person,
person), mother (person, person). Define the predicates for
Parent
Brother
Sister
Grandfather
Ancestor
3 Write a prolog program to simulate a non deterministic finite automation (NFA)
4 A computer system accepts a users name and password which are stored as facts in the kbase.
Validate this information through a predicate login. If not valid, display a suitable message.
5 Write prolog predicates to perform list manipulation as follows :
List membership relation
Length of a list
Concatenate 2 list to produce a third list
Reverse a list
Subset of a list
Appending an element to a list
Summing the element of a list
6 Write a prolog program to implement Depth first search algorithm.
7 Write a prolog program to simulate the Towers of Hanoi problem.
8 There is a gold treasure hidden inside a cave. The cave is a maze of galleries connecting
different rooms in which there are dangerous beings like monsters and robbers. The gold
treasure is all in one room. Determine a route by which a person can get to the treasure and
escape with it unhurt. Enclosed is a photocopy of the cave lay out. Write the corresponding
prolog program.
9 Write a prolog program to simulate the xor logic circuit. In this program make use of the
predicate definitions for AND, NOT and OR gate.
10 A hungry monkey finds himself in a room in which a bunch of bananas is hanging from the
ceiling. The monkey cannot reach the bananas. In the room there is a chair and a stick. The
ceiling is just the right height so that a monkey standing on a chair could knock the bananas
down with the stick. The monkey knows how to move around, carry other things around, reach
for the bananas and wave a stick in the air. Write prolog predicate that define the monkeys
legal moves, the different legal states and enable the monkey to got to the bananas.
11 In the block world problem, assure a sequence of 3 blocks a, b, c on a table. Write prolog
predicates to define valid states in the blocks world domain and also to define valid legal moves
in the system.

Examination Scheme:

IA EE
A PR LR V PR V
5 10 10 5 35 35
Note: IA Internal Assessment, EE- External Exam, PR- Performance, LR Lab Record, V Viva