Lovely Professional University, Punjab

Course Code

Course Title

Course Planner

Lectures

ECE434

ARTIFICIAL INTELLIGENCE

16384::Pankaj Kumar Keshri

Course Orientation

1 :DISCIPLINE KNOWLEDGE, 2 :SKILL ENHANCEMENT, 4 :RESEARCH

Tutorials Practicals Credits

3.0

0.0

TextBooks
Sr No

Title

Author

Edition

Year

Publisher Name

T-1

Artificial Intelligence

SAROJ KAUSHIK

1st

2011

CENGAGE LEARNING

Edition

Year

Publisher Name

Reference Books
Sr No

Title

Author

R-1

ARTIFICIAL INTELLIGENCE

Kevin Knight, Elaine Rich, 3rd

B. Shivashankar Nair

2008

MCGRAW HILL EDUCATION

R-2

Artificial Intelligence: A Modern

Approach

Stuart Russell,Peter Norvig 3rd

2014

PEARSON

Other Reading
Sr No

Journals articles as Compulsary reading (specific articles, complete reference)

OR-1

Chang-Shing Lee, "A Fuzzy Expert System for Diabetes Decision Support Application", IEEE, 2011 ,

OR-2

http://www.computer.org/csdl/mags/ex/2009/01/mex2009010078-abs.html ,

Relevant Websites
Sr No

Web address (only if relevant to the course)

Salient Features

RW-1

http://www.cosmolearning.com/topics/artificial-intelligence/

Lecture notes on Artificial Intelligence

RW-2

http://www.cs.gsu.edu/~cscyqz/courses/ai/aiLectures.html

Lecture notes on Artificial Intelligence

RW-3

http://nptel.ac.in/courses/106105077/

NPTEL lecture notes and video lecture

RW-4

http://epub.uni-regensburg.de/13629/1/ubr06078_ocr.pdf

Lecture notes on Artificial Intelligence

Audio Visual Aids

Sr No

AV aids (only if relevant to the course)

Salient Features

AV-1

https://www.youtube.com/watch?v=BnIJ7Ba5Sr4

Video Lecture Notes on Artificial Intelligence by Peter Norvig

LTP week distribution: (LTP Weeks)

Weeks before MTE

Weeks After MTE

0.0

3.0

Spill Over

Detailed Plan For Lectures

Week
Lecture
Number Number

Broad Topic(Sub Topic)

Week 1

Introduction to AI
(Intelligent Systems)

T-1:1.1-1.3
R-2:1.1

Introduction to AI(Brief
History)

Lecture 1

Lecture 2

Lecture 3

Week 2

Lecture 4

Chapters/Sections of Other Readings,

Text/reference
Relevant Websites,
books
Audio Visual Aids,
software and Virtual
Labs

Lecture Description

Learning Outcomes Pedagogical Tool Live Examples

Demonstration/
Case Study /
Images /
animation / ppt
etc. Planned

RW-3
AV-1

L1:Zero Lecture
L2:Brief
History,Intelligent
Systems

A Student will come lecture discussion

to know What does followed by
AI mean and why
Question-Answer
they are studying.

T-1:1.1-1.3
R-1:1.1
R-2:1.1

RW-3

L1:Zero Lecture
L2:Brief
History,Intelligent
Systems

A Student will come lecture discussion

to know What does followed by
AI mean and why
Question-Answer
they are studying.

Introduction to AI(Brief
History)

T-1:1.1-1.3
R-1:1.1
R-2:1.1

RW-3

L1:Zero Lecture
L2:Brief
History,Intelligent
Systems

A Student will come lecture discussion

to know What does followed by
AI mean and why
Question-Answer
they are studying.

Introduction to AI
(Intelligent Systems)

T-1:1.1-1.3
R-2:1.1

RW-3
AV-1

L1:Zero Lecture
L2:Brief
History,Intelligent
Systems

A Student will come lecture discussion

to know What does followed by
AI mean and why
Question-Answer
they are studying.

Introduction to AI
(Foundations of AI)

T-1:1.4-1.5
R-2:1.2

RW-2

Foundations of AI,Sub- A Student will come lecture discussion

Areas of AI
to know about
followed by
various disciplines
Question-Answer
that lay the
foundation of AI

Introduction to AI(SubAreas of AI)

T-1:1.4-1.5
R-2:1.2

RW-2

Foundations of AI,Sub- A Student will come lecture discussion

Areas of AI
to know about
followed by
various disciplines
Question-Answer
that lay the
foundation of AI

Introduction to AI(Tic-TacToe Game Playing)

T-1:1.6 1.7

Applications of AI,
Tic-Tac-Toe Game
Playing

A Student will come lecture discussion

to know how to
followed by
formulate Tic Tac
Question-Answer
Toe game using
different approaches
practical applications
of AI

Introduction to AI
(Applications of AI)

T-1:1.6 1.7

Applications of AI,
Tic-Tac-Toe Game
Playing

A Student will come

to realize the
practical applications
of AI

Computer game

Slide Show by
ETeacher, Video
Commerce,Digit
Demonstration for al Doctor
various
applications of AI

Week 2

Lecture 5

Lecture 6

Week 3

Lecture 7

Lecture 8

Introduction to AI
(Developments of AI
Languages)

T-1:1.8-1.9

Developments of AI
Languages,Current
Trends in AI

A Student will come lecture discussion

to know various AI followed by
languages like LISP, Question-Answer
Prolog, C, etc by
which we can do
programming of AI
Systems

Introduction to AI(Current
Trends in AI)

T-1:1.8-1.9

Developments of AI
Languages,Current
Trends in AI

Student will learn

lecture discussion
about development of followed by
AI
Question-Answer

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Introduction)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will learn

about how to solve
the AI problems

lecture discussion
followed by
Question-Answer

Problem Solving: StateSpace Search Techniques

and Control Strategies
(General Problem Solving)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will learn

about how to solve
the AI problems

lecture discussion
followed by
Question-Answer

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Characteristics of the
Problem)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will
understand how to
characterize any AI
problem

Slide Show by
Teacher

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Characteristics of the
Problem)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will
understand how to
characterize any AI
problem

Slide Show by
Teacher

Problem Solving: StateSpace Search Techniques

and Control Strategies
(General Problem Solving)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will learn

about how to solve
the AI problems

lecture discussion
followed by
Question-Answer

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Introduction)

T-1:2.1-2.3

RW-4

Introduction,General
Problem
Solving,Characteristics
of the Problem

A Student will learn

about how to solve
the AI problems

lecture discussion
followed by
Question-Answer

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Exhaustive Searches)

T-1:2.4

RW-2
RW-3

Breadth First Search,

Depth First Search,
Depth First Iterative
Deepening,
Bidirectional Search,
Analysis of Search
Methods

A Student will
understand
algorithms of Blind
Searches in AI

Demonstration of
searching
algorithms by AI
Space Graphical
tool

Journalism,Tran
sportation,Entert
ainment,

Week 3

Lecture 9

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Heuristic Search
Techniques)

T-1:2.5

General purpose
A Student will realize
Heuristics, Brand and
various heuristic
Bound Search, Hill
searching techniques
Climbing, Beam
Search,best first search,
A Star Algorithm,
Optimal Solution by A
Star Algorithm,
Monotonic Solution

Slide Show by
Teacher,
Demonstration of
searching
algorithms by AI
Space Graphical
tool

Week 4

Lecture 10 Problem Solving: StateSpace Search Techniques

and Control Strategies
(Heuristic Search
Techniques)

T-1:2.5

General purpose
A Student will realize
Heuristics, Brand and
various heuristic
Bound Search, Hill
searching techniques
Climbing, Beam
Search,best first search,
A Star Algorithm,
Optimal Solution by A
Star Algorithm,
Monotonic Solution

Slide Show by
Teacher,
Demonstration of
searching
algorithms by AI
Space Graphical
tool

Lecture 11 Problem Solving: StateSpace Search Techniques

and Control Strategies
(Iterative Deepening A*)

T-1:2.6-2.7

OR-1
RW-1

Iterative Deepening
A*,Constraint
Satisfaction

A Student will realize

the algorithm of
Iterative Deeping A
Star Algorithm

Slide Show by
Teacher,
Demonstration of
searching
algorithms by AI
Space Graphical
tool

Problem Solving: StateSpace Search Techniques

and Control Strategies
(Constraint Satisfaction)

T-1:2.6-2.7

OR-1
RW-1

Iterative Deepening
A*,Constraint
Satisfaction

A Student will come

to know how to solve
constraint satisfaction
problems

Slide Show by
Teacher,
Demonstration of
searching
algorithms by AI
Space Graphical
tool

Lecture 12
Week 5

Term Paper,Test1

Lecture 13 Reduction of Problem and

Game Playing(Introduction)

Reduction of Problem and

Game Playing(Problem
Reduction)

Lecture 14 Reduction of Problem and

Game Playing(Game
Playing)

T-1:3.1-3.2

OR-2
RW-3

Introduction to Problem A Student will come Slide Show by

Reduction and Game
to know how to
Teacher
Playing
reduce the
complexity of the
problem

T-1:3.1-3.2

OR-2
RW-3

Introduction to Problem A Student will come Slide Show by

Reduction and Game
to know how to
Teacher
Playing
reduce the
complexity of the
problem

T-1:3.3

Game problem vs State

Space problem, Status
Labelling procedure in
Game Tree, Nim Game
Problem

A Student will
understand the
concept of Game
Playing

Slide Show by
Teacher

Week 5

Lecture 15 Reduction of Problem and

Game Playing(Game
Playing)

T-1:3.3

Game problem vs State

Space problem, Status
Labelling procedure in
Game Tree, Nim Game
Problem

A Student will
understand the
concept of Game
Playing

Week 6

Lecture 16 Reduction of Problem and

Game Playing(Bounder
Look Ahead Strategy)

T-1:3.4

Bounded Look Ahead

Strategy using
Evaluation functions,
MiniMax Procedure

A Student will realize Slide Show by

the MiniMax
Teacher
algorithm for Game
Playing

Lecture 17 Reduction of Problem and

Game Playing(Alpha-Beta
Pruning)

T-1:3.5

Refinement of Alpha
Beta Pruning,
Alternative to Alpha
Beta pruning Minimax
procedure, Iterative
Deepening

A Student will realize Slide Show by

the Alpha Beta
Teacher
Pruning algorithm for
game playing

Lecture 18 Reduction of Problem and

Game Playing(Alpha-Beta
Pruning)

T-1:3.5

Refinement of Alpha
Beta Pruning,
Alternative to Alpha
Beta pruning Minimax
procedure, Iterative
Deepening

A Student will realize Slide Show by

the Alpha Beta
Teacher
Pruning algorithm for
game playing

Lecture 19 Reduction of Problem and

Game Playing(Two-Player
Perfect Information Games)

T-1:3.5

Two Player Perfect

Information Games

A Student will come Slide Show by

to know how to
Teacher
formulate AI
problems having two
opponents in any
game

Week 7

Slide Show by
Teacher

SPILL OVER
Week 7

Lecture 20

Spill Over

Lecture 21

Spill Over

MID-TERM
Week 8

Lecture 22 Logic Concept and

Programming(Introduction)

T-1:4.1-4.2

Introduction to Logic
Concept and Logic
Programming

A Student will
Slide Show by
understand why there Teacher
is the need of logic
programming in AI

Logic Concept and

Programming(Propositional
Calculus)

T-1:4.1-4.2

Propositional Calculus,
Truth Table,
Equivalence Laws

A Student will come Slide Show by

to know about
Teacher
propositional calculus
and its role in AI
Systems

Lecture 23 Logic Concept and

Programming(Propositional
Logic)

T-1:4.3-4.4

Propositional Logic

A Student will come Slide Show by

to understand about Teacher
propositional logic

T-1:4.3-4.4

Natural Deduction
System

A Student will come Slide Show by

to understand about Teacher
propositional logic

Logic Concept and

Programming(Natural
Deduction System)

Week 8

Lecture 24 Logic Concept and

Programming(Axiomatic
System)
Logic Concept and
Programming(Semantic
Tableau System in
Propositional Logic)

Week 9

T-1:4.5-4.6

Axiomatic System

A Student will
Slide Show by
understand the
Teacher
concept of Axiomatic
Systems

T-1:4.5-4.6

Semantic Tableau
A Student will
Slide Show by
Rules, Satisfiability and understand the
Teacher
Unsatisfiability
concept of Semantic
Tableau system in PL

Lecture 25 Logic Concept and

Programming(Resolution
Refutation in Propositional
Logic)

T-1:4.7

Resolution Refutation in
Propositional logic,
Conversion of a
Formula into a Set of
Clauses, Conversion of
Formula to it CNF,
Resolution of Clauses

Lecture 26 Logic Concept and

Programming(Predicate
Logic)

T-1:4.8

Predicate Calculus, First A Student will come Slide Show by

Order Predicate
to know about
Teacher
Calculus, Interpretations predicate logic
of Formulae in FOL,
Satisfiability and
Unsatisfiability in
FOL,Transformation of
a formula into prenex
normal form,
Conversion of PNF to
its Standard Form,
Clauses in FOL,
Resolution Refutation
method in FOL

Lecture 27 Logic Concept and

Programming(Predicate
Logic)

T-1:4.8

Predicate Calculus, First A Student will come Slide Show by

Order Predicate
to know about
Teacher
Calculus, Interpretations predicate logic
of Formulae in FOL,
Satisfiability and
Unsatisfiability in
FOL,Transformation of
a formula into prenex
normal form,
Conversion of PNF to
its Standard Form,
Clauses in FOL,
Resolution Refutation
method in FOL

T-1:4.9

Conversion of a Clause
into Clausal Notation,
Resolution Methods

Week 10 Lecture 28 Logic Concept and

Programming(Logic
Programming)

A Student will
Slide Show by
understand the
Teacher
concept of Resolution
and its role in AI
Systems

A Student will
understand the need
of Logic
Programming

Slide Show by
Teacher

Week 10 Lecture 29 Uncertainty Measurement:

Probability Theory and
Fuzzy Logic(Introduction)

T-1:9.1-9.2

Introduction of
Probability
Theory, Joint
Probability, Conditional
Probability, Bayes
Theorem, Extension to
Bayes
Theorem,probabilities in
rules and facts of rule
based system,
Cumulative
Probabilities, rule based
system using probability
example, Bayesian
method its advantages
and disadvantages

A Student will learn Slide Show by

how probability helps Teacher
in overcoming
uncertainty in ES

Uncertainty Measurement:
Probability Theory and
Fuzzy Logic(Probability
Theory)

T-1:9.1-9.2

Introduction of
Probability
Theory, Joint
Probability, Conditional
Probability, Bayes
Theorem, Extension to
Bayes
Theorem,probabilities in
rules and facts of rule
based system,
Cumulative
Probabilities, rule based
system using probability
example, Bayesian
method its advantages
and disadvantages

A Student will learn Slide Show by

how probability helps Teacher
in overcoming
uncertainty in ES

Lecture 30 Uncertainty Measurement:

Probability Theory and
Fuzzy Logic(Probability
Theory)

T-1:9.1-9.2

Introduction of
Probability
Theory, Joint
Probability, Conditional
Probability, Bayes
Theorem, Extension to
Bayes
Theorem,probabilities in
rules and facts of rule
based system,
Cumulative
Probabilities, rule based
system using probability
example, Bayesian
method its advantages
and disadvantages

A Student will learn Slide Show by

how probability helps Teacher
in overcoming
uncertainty in ES

Week 10 Lecture 30 Uncertainty Measurement:

Probability Theory and
Fuzzy Logic(Introduction)

T-1:9.1-9.2

Introduction of
Probability
Theory, Joint
Probability, Conditional
Probability, Bayes
Theorem, Extension to
Bayes
Theorem,probabilities in
rules and facts of rule
based system,
Cumulative
Probabilities, rule based
system using probability
example, Bayesian
method its advantages
and disadvantages

A Student will learn Slide Show by

how probability helps Teacher
in overcoming
uncertainty in ES

Week 11 Lecture 31 Uncertainty Measurement:

Probability Theory and
Fuzzy Logic(Fuzzy Sets)

T-1:10.1-10.3

Introduction to Fuzzy
Sets, Membership
functions, Fuzzy Truth
values vs Probabilities

A Student will learn

how Fuzzy Logic
helps in overcoming
uncertainty in ES

Slide Show by
Teacher

Uncertainty Measurement:
Probability Theory and
Fuzzy Logic(Fuzzy Set
Operations)

T-1:10.1-10.3

Fuzzy Set Operations,

Additional Operations,
Basic Reshaping
operations, properties of
fuzzy sets
functions, Fuzzy Truth
values vs Probabilities

A Student will learn

how Fuzzy Logic
helps in overcoming
uncertainty in ES

Slide Show by
Teacher

Lecture 32 Uncertainty Measurement:

Probability Theory and
Fuzzy Logic(Types of
Membership Functions)

T-1:10.4 10.6

Types of membership
functions, method of
determining
membership functions,
alpha cut, representation
of fuzzy set

A Student will learn

how Fuzzy Logic
helps in overcoming
uncertainty in ES

Slide Show by
Teacher

Uncertainty Measurement:
Probability Theory and
Fuzzy Logic(Fuzzy Logic)

T-1:10.4 10.6

Fuzzy predicate and

A Student will learn
fuzzy truth values,fuzzy how Fuzzy Logic
quantifiers
helps in overcoming
uncertainty in ES

Slide Show by
Teacher

Lecture 33

Term Paper,Test3

Week 12 Lecture 34 Machine Learning,

Evolutionary Computation
(Introduction)

Machine Learning,
Evolutionary Computation
(Machine Learning Systems)

T-1:11.1-11.2

Introduction and
meaning of Machine
Learning

A Student will come Slide Show by

to know about the
Teacher
meaning of Machine
learning and its role
in AI Systems

T-1:11.1-11.2

Components of a
A Student will learn
Learning Systems, Rote about various
Learning, Learning by learning systems
taking advice, Learning
by parameter
adjustment, Learning by
Macrooperators,
Learning by Analogy

Slide Show by
Teacher

Week 12 Lecture 35 Machine Learning,

Evolutionary Computation
(Supervised and
Unsupervised Learnings)

T-1:11.3

Difference bw
Supervised,
Unsupervised and
Reinforced learning, NN
based Learning,
Supervised concept
learning, probability
approximating, correct
learning, Unsupervised
learning, reinforcement
learning

A Student will learn

about the different
between supervised,
unsupervised and
reinforcement
learning

Slide Show by
Teacher

T-1:12.2
R-2:20.5

Introduction to ANN,
The neuron model,
Activation functions,
NN architectures

A Student will learn

about what ANN
means and how it
helps in processing
and learning

Slide Show by
Teacher

Week 13 Lecture 37 Machine Learning,

Evolutionary Computation
(Single Layer & Multi-Layer
Feed-Forward Networks)

T-1:12.3-12.4

Perceptron A neuron
model, learning
algorithm for
perceptron, perceptron
for OR function,
limitations of
perceptron, Back
propagation training
algorithm for FFNN,
Weight update rule,
LMS for Error

A Student will learn

about the Single
Layer and Multi
Layer NN

Slide Show by
Teacher

Lecture 38 Machine Learning,

Evolutionary Computation
(Single Layer & Multi-Layer
Feed-Forward Networks)

T-1:12.3-12.4

Perceptron A neuron
model, learning
algorithm for
perceptron, perceptron
for OR function,
limitations of
perceptron, Back
propagation training
algorithm for FFNN,
Weight update rule,
LMS for Error

A Student will learn

about the Single
Layer and Multi
Layer NN

Slide Show by
Teacher

Lecture 39 Machine Learning,

Evolutionary Computation
(Introduction to Soft
Computing)

T-1:13.1-13.2

Soft computing

A Student will learn Slide Show by

about soft computing Teacher

Evolutionary
programming methods

Student will learn

about evolutionary
programming
methods

Lecture 36 Machine Learning,

Evolutionary Computation
(Artificial Neural Networks)

Week 14 Lecture 40 Machine Learning,

Evolutionary Computation
(Evolutionary Programming)

T-1:13.5

Slide Show by
Teacher

Process
modeling and
control,
Machine diagno
sis, Medical
diagnosis, Voice
Recognition,
Financial
forecasting,
Fraud detection

SPILL OVER
Week 14 Lecture 41

Spill Over

Lecture 42

Spill Over

Week 15 Lecture 43

Spill Over

Lecture 44

Spill Over

Lecture 45

Spill Over

Scheme for CA:

Component

Frequency

Term Paper,Test

Out Of
2

Each Marks Total Marks

3

Total :-

10

20

10

20

Details of Academic Task(s)

AT No.

Objective

Topic of the Academic Task

Introduction to AI,Problem Solving: State-Space Search

Techniques and Control Strategies

Nature of Academic Task

(group/individuals/field
work

Evaluation Mode

Allottment /
submission Week

Individual

The test will be of

30 marks.Each
question will be of 5
or multiple of 5.

3/4

Test1

To test the student

learning capability
in class

Term Paper1

To realize the
The Term Paper Topics Can be Chosen from the List Attached
practical
implementation of
Concepts studied by
Students in Real life
applications

Individual

Term Paper
Submission by
Students & Viva on
the basis of Term
Paper Report

4 / 12

Test2

To test the student

learning capability
in class

Individual

The test will be of

30 marks.Each
question will be of 5
or multiple of 5.

10 / 11

Logic Concept and Programming,Uncertainty Measurement:

Probability Theory and Fuzzy Logic

List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)
Sr. No.

Topic
1 Intelligent mobile robot navigation technique using RFID Technology
2 Path Finding Robots(PFRs)
3 Advanced motors
4 Networked Robotic Cameras

5 Image-based Robot Control

6 Collective robotics and Mobile Computing
7 Robots that can recognize human emotions
8 Robots In Radioactive Environments
9 Human-Robot Interfaces for Large Robot Teams
10 Autonomous Mobile Manipulation for the Motor Impaired
11 Sensor Fusion for Mobile Robot Localization and Navigation
12 Smarter Robots to Inspect Aging Nukes
13 Forward and inverse kinematic models
14 Tele operated intelligent mobile robot
15 Intelligent Way Searching Pick and Place Robot