COMP.4200/5430 Artificial Intelligence, Fall 2016
MWF 11:50p, Olsen 102
Prof. Fred Martin
Office hours: M 3-4p Olsen 208; R 2-3p Olney 524; F 2-3p Olsen 306
TA: Pengfei Zhang
Office hours: R 2:30-4:30p Olsen 307
Topics include: search techniques and their properties, including A*; game-playing, including adversarial and stochastic search; probabilistic reasoning, including Markov Decision Processes and Hidden Markov Models; and reinforcement learning, including value iteration and q-learning. Topics are developed theoretically and with programming assignments. The course includes a student-directed final project and paper. Co-Requisites: COMP 3010 Organization of Programming Languages and MATH 3860 Probability and Statistics I.
academic year 2016–2017, for the undergrad version
What is AI?
There are few areas in computer science as broad as artificial intelligence. AI encompasses algorithm design, agents and robots, natural language understanding, expert systems, music and sound, as well as philosophical questions about the nature of consciousness!
One organizing principle across the field is the formalization of real-world problems based on utility functions, and then the use of various techniques to maximize expected utility. Based on this unifying theme, we will study:
Ideas will be developed theoretically and with practical programming challenges using the U.C. Berkeley Pac-Man projects, in which you program a progressively complex series of challenges inspired by the original Pac-Man arcade game.
These problem sets teach foundational AI concepts, such as informed state-space search, probabilistic inference, and reinforcement learning. These concepts underlie real-world application areas such as natural language processing, computer vision, and robotics (see http://ai.berkeley.edu/project_overview.html).
Coding will be done in Python, which you must teach yourself during the class if you don't know it yet.
A big part of AI is not just knowing a collection of approaches, but understanding which approach is right for which problem. To encourage the development of these skills, there will be a significant semester project where you will apply ideas from the course to a problem of your own choosing.
The textbook, as shown above, is Artificial Intelligence: A Modern Approach, by Russell and Norvig. The book is comprehensive, is well-written in the most exemplary manner, and has detailed bibliographies for each chapter. It is by far the most popular book used to teach AI, and it is also the best.
The recommended book is the third edition. New and used copies are available at the UML bookstore, or from online sources (3rd edition: alibris; amazon; bookfinder). It would be acceptable to get a used second edition (alibris; amazon; bookfinder). Do not use the first edition.
There are five categories of work that will be assessed. These are:
You will apply the ideas developed in the class in an original software implementation. You may thus connect the ideas of the class with your own interestsmusic, robotics, art, databases, the web, networking, gaming, etc. The learning goal of the project is to have you find some real-world relevance of the ideas in the class.
This is required to be a team project. Supports will be put in place to make sure that all members of each team are fairly graded on their respective contributions. Teams must consist of two or three persons.
Undergraduate Project Sequence
For undergraduates, COMP.4200 Artificial Intelligence can be grouped with COMP.4210 Machine Learning or COMP.4500 Robotics I to form a course pair.
For graduate students, COMP.5430 is in Group III, Human-Computer Interaction, Visualization, Robotics and AI.
Collaboration and Academic Integrity Policy
You are welcome to discuss ideas in the class with your peers. However, pair programming or other side-by-side work that involves sharing of code is not allowed. By turning in an assignment, you attest that you have written the new code that it includes. Please be familiar with the university's academic integrity policies: for undergraduates for graduate students
Copying others' code or writing is not allowed.
Your coding assignments will be verified as being your own work using Stanford's Measure of Software Similarity (MOSS), as well as inspection by the TAs/graders and course professor.
If your code is found to substantively include the work of others, you will receive a grade of zero for that entire assignment. If there is a second offense, you will fail the course.
For the written assignments, you will be given instruction on how to properly cite others' work. Your written assignments will be verified using TurnItIn.
Plagiarism is a significant academic offense. Plagiarism on the final paper will result in receiving a grade of F for the course.
No Posting of Solution Code Policy
UMass Lowell’s policy on academic integrity states that assisting students in their own acts of academic dishonesty is itself an a violation of academic integrity. See Academic Misconduct Subject to Disciplinary Action, 1(f).
Consistent with this, you are not allowed to post solution code to problem sets assigned in this class in public places (e.g. Github). This includes your own solutions as well as solutions that may be provided by the instructors.
Please note that this is typical policy at premier computer science departments. E.g.:
Thus: Do not publish your solutions to problem sets. Doing so will be considered an act of academic dishonesty and you will receive a grade of F for the course.
You may save your work to private repositories that cannot be retrieved by others. I encourage you to sign up for Github's Student Developer Pack, which allows you to create private repositories (among other benefits). It's free to students.
Students are responsible for all material covered in class. Attendance will not be taken.
Exams will be announced at least one week before they are administered. In-person participation of final project presentations is required.
Make-up opportunities will be made only in the case of emergencies, not scheduled conflicts (e.g., work).
Discussion Group / E-Mail List
We will use Google Groups for announcements and discussion of material outside of class.
To join the group, create a Google account (or log into your existing one) and go to:
Then request a membership.
Important: Set your “Email delivery preference” to ”Notify me for every new message.” Otherwise, you won't get announcements and discussions on a timely basis.