Pay as you go
- Maximum flexibility to learn at your own pace.
- Cancel anytime.
At 12-15 hrs/week
Get access to classroom immediately on enrollment
This program requires experience with linear algebra, statistics, and Python (including object-oriented programming).
In this course, you'll learn about the foundations of AI. You'll configure your programming environment to work on AI problems with Python. At the end of the course you'll build a Sudoku solver and solve constraint satisfaction problems.
In this course you’ll learn classical graph search algorithms--including uninformed search techniques like breadth-first and depth-first search and informed search with heuristics including A*. These algorithms are at the heart of many classical AI techniques, and have been used for planning, optimization, problem solving, and more. Complete the lesson by teaching PacMan to search with these techniques to solve increasingly complex domains.
In this course you’ll learn to represent general problem domains with symbolic logic and use 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 course you’ll learn about iterative improvement optimization problems and classical algorithms emphasizing gradient-free methods for solving them. These techniques can often be used on intractable problems to find solutions that are "good enough" for practical purposes, and have been used extensively in fields like Operations Research & logistics. You’ll finish the lesson by completing a classroom exercise comparing the different algorithms' performance on a variety of problems.
In this course you’ll learn how to search in multi-agent environments (including decision making in competitive environments) using the minimax theorem from game theory. Then build an agent that can play games better than any humans.
In this course you’ll learn to use Bayes Nets to represent complex probability distributions, and algorithms for sampling from those distributions. Then learn the algorithms used to train, predict, and evaluate Hidden Markov Models for pattern recognition. HMMs have been used for gesture recognition in computer vision, gene sequence identification in bioinformatics, speech generation & part of speech tagging in natural language processing, and more.
Research Director, Google
Peter Norvig is a Director of Research at Google and is co-author of Artificial Intelligence: A Modern Approach, the leading textbook in the field.
As the founder and president of Udacity, Sebastian’s mission is to democratize education. He is also the founder of Google X, where he led projects including the Self-Driving Car, Google Glass, and more.
Professor of Computer Science, Georgia Tech
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.
Pay as you go