Artificial Intelligence 2011
Prabhas Chongstitvatana
email prabhas at chula dot ac dot th
Course Description
Foundations of artificial intelligence, solving problems by
searching, knowledge representation, first-order logic, inference
in first-order logic, planning, probabilistic reasoning systems,
learning, communication, image perception.
Announcement
11 Jan 2012 Midterm questions are
out (direct to you by G+) The package
for AI programming is tree search
Any questions related to questions please ask me (via G+).
Lecture
1) Structure of Intelligent Agents
Chinese Room
Argument Intro
(aima) Intelligent
Agent (aima)
Example: Video
of a biped robot walking using
Evolutionary Algorithm. from the paper: Chaisukkosol, C. and
Chongstitvatana, P., "Evolving control programs for a biped static
walker", IEEE Inter. Conf. on Humanoid Robots, Waseda, Tokyo,
November 22-24, 2001. full paper
Famous historical AI program : eliza
2) Solving Problems by Searching Blind search (aima)
3) Informed Search Methods Informed search (aima)
Local search (aima)
AI programming
tools introduction to library
source listing (pdf)
4) Representation, Reasoning, and
Logic: Constraint
Satisfaction Problems (pdf),
Game (ppt)
5) First-Order Logic
Logic (ppt)
6) Uncertainty uncertainty (pdf)
7) Speech Recognition
( pdf )
8) Learning Model learning from observations
(pdf)
9) Neural Networks
10) Image Perception
11) Computing by evolution
Final examination
Homework
20 Sept 2011 Read section 1.1 What is
AI and 1.2 Foundation of AI
Assessment
Final
exam 30 %
Midterm exam 20 %
Class
work 30 %
Assignments 20 %
Total 100 %
Reference Text
Stuart Russell, Peter
Norvig, "Artificial
Intelligence: A Modern Approach," Prentice Hall, 2010
link to textbook website http://aima.cs.berkeley.edu/
Additional materials
Programming by recursion
AI programming: List ailib.c
ailib.h ex1.c
tree search (complete updated)
update of library ailib.c ailib.h 17 Oct 2011
last update 11 January 2012