The School of Artificial Intelligence
The School of Artificial Intelligence
Artificial Intelligence
NANODEGREE SYLLABUS
Overview
Artificial Intelligence
INTERESTED IN THIS
NANODEGREE?
Contact us at
enterpriseNDs@udacity.
com.
REAL-WORLD PROJECTS
Learners build new skills through industry-relevant
projects and receive personalized feedback from our
network of 900+ project reviewers. Our simple user
interface makes it easy to submit projects as often as
needed and receive unlimited feedback.
KNOWLEDGE
Answers to most questions can be found with
Knowledge, our proprietary wiki. Learners can search
questions asked by others and discover in real-time
how to solve challenges.
WORKSPACES
Learners can check the output and quality of their
code by testing it on interactive workspaces that are
integrated into the classroom.
QUIZZES
Understanding concepts learned during lessons is
made simple with auto-graded quizzes. Learners can
easily go back and brush up on concepts at anytime
during the course.
PROGRESS TRACKER
Personalized milestone reminders help learners stay
on track and focused as they work to complete their
Nanodegree program.
Thad Starner
PRO FESSOR OF COMPUTER
SCIENCE
Thad Starner is the director of the
Contextual Computing Group (CCG) at
Georgia Tech and is also the longest-
serving Technical Lead/Manager on
Google’s Glass project.
Humans use reason to solve problems by decomposing the problem statement and incorporating domain
knowledge to limit the possible solution space. In this project you’ll use a technique called constraint
propagation together with backtracking search to make an agent that only considers reasonable solution
candidates and efficiently solves any Sudoku puzzle. This approach appears in many classical AI problems, and
the solution techniques have been extended and applied to diverse problems in bioinformatics, logistics, and
operations research. In this project you will demonstrate some basic algorithms knowledge, and learn to use
constraint satisfaction to solve general problems.
WELCOME TO
ARTIFICIAL • Learn about the resources available to help you succeed
INTELLIGENCE
SETTING UP YOUR
• Use Conda to configure and manage Python packages and dependencies
ENVIRONMENT
CLASSROOM EXERCISE:
• Implement informed & uninformed search for Pacman
SEARCH
ADDITIONAL TOPICS:
• List of external resources for you to continue learning about search
SEARCH
Intelligent agents are expected to act in complex domains where their goals and objectives may not be
immediately achievable. They must reason about their goals and make rational choices of actions to achieve
them. In this project you will build a system using symbolic logic to represent general problem domains and
use classical search to find optimal plans for achieving your agent’s goals. Planning & scheduling systems
power modern automation & logistics operations, and aerospace applications like the Hubble telescope &
NASA Mars rovers.
In this project you will demonstrate an understanding of classical optimization & search algorithms, symbolic
logic, and domain-independent planning.
INTRODUCTION TO
• Learn to define planning problems
AUTOMATED PLANNING
ADDITIONAL TOPICS IN
• List of external resources for you to continue learning about planning
PLANNING
HILL CLIMBING • Learn Random Hill Climbing for local search optimization problems
SIMULATED ANNEALING • Learn to use Simulated Annealing for global optimization problems
CLASSROOM EXERCISE:
• Compare optimization techniques on a variety of problems
OPTIMIZATION PROBLEMS
AI agents acting in the real world have to “hope for the best, but prepare for the worst.” In this project you
will write an agent that uses that idea to make rational choices to achieve super-human performance in
games competing against adversarial agents. The principles of adversarial search provide a foundation for
autonomous agents acting in the real world, and for understanding modern advances in AI like DeepMind’s
AlphaGo Zero.
In this project you will demonstrate advanced algorithms knowledge, including minimax with alpha-beta
pruning for adversarial search.
Probabilistic models allow your agents to better handle the uncertainty of the real world by explicitly modeling
their belief state as a distribution over all possible states. In this project you’ll use a Hidden Markov Model
(HMM) to perform part of speech tagging, a common pre-processing step in Natural Language Processing.
HMMs have been used extensively in NLP, speech recognition, bioinformatics, and computer vision tasks.
DYNAMIC TIME WARPING • Learn the dynamic time warping algorithm for time-series analysis