Stanford Root

Schedule

Stanford Root

Schedule

CS 238

Decision Making under Uncertainty (AA 228)

UNITS:3-4
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

This course is designed to increase awareness and appreciation for why uncertainty matters, particularly for aerospace applications. Introduces decision making under uncertainty from a computational perspective and provides an overview of the necessary tools for building autonomous and decision-support systems. Following an introduction to probabilistic models and decision theory, the course will cover computational methods for solving decision problems with stochastic dynamics, model uncertainty, and imperfect state information. Topics include: Bayesian networks, influence diagrams, dynamic programming, reinforcement learning, and partially observable Markov decision processes. Applications cover: air traffic control, aviation surveillance systems, autonomous vehicles, and robotic planetary exploration. Prerequisites: basic probability and fluency in a high-level programming language.

Syllabus for selected term:
View Autumn 2026 Syllabus

Sections

1 Term
Lecture 1Open
ID: 2062
0 / 500 enrolled
DAYS:Tuesday, Thursday
TIME:9 AM – 10:20 AM
LOCATION:Hewlett Teaching Center 200
INSTRUCTOR:
Kochenderfer, Mykel
units

CS 238: Decision Making under Uncertainty (AA 228)

3-4 units · Letter or Credit/No Credit

This course is designed to increase awareness and appreciation for why uncertainty matters, particularly for aerospace applications. Introduces decision making under uncertainty from a computational perspective and provides an overview of the necessary tools for building autonomous and decision-support systems. Following an introduction to probabilistic models and decision theory, the course will cover computational methods for solving decision problems with stochastic dynamics, model uncertainty, and imperfect state information. Topics include: Bayesian networks, influence diagrams, dynamic programming, reinforcement learning, and partially observable Markov decision processes. Applications cover: air traffic control, aviation surveillance systems, autonomous vehicles, and robotic planetary exploration. Prerequisites: basic probability and fluency in a high-level programming language.

Offered in Autumn 2026 at Stanford University.

Autumn 2026 sections

  • Lecture — Tuesday Thursday 9:00 AM – 10:20 AM — Hewlett Teaching Center 200 — Kochenderfer, Mykel (Graduate)

More CS courses

  • CS 233: Geometric and Topological Data Analysis (CME 251)
  • CS 234: Reinforcement Learning
  • CS 235: Computational Methods for Biomedical Image Analysis and Interpretation (BMDS 260, BMP 260, RAD 260)
  • CS 236G: Generative Adversarial Networks
  • CS 237A: Principles of Robot Autonomy I (AA 274A, EE 260A, ME 274A)
  • CS 237B: Principles of Robot Autonomy II (AA 174B, AA 274B, EE 260B, ME 274B)
  • CS 238V: Validation of Safety Critical Systems (AA 228V)
  • CS 239: Advanced Topics in Sequential Decision Making (AA 229)
  • CS 240: Advanced Topics in Operating Systems
  • CS 240LX: Advanced Systems Laboratory, Accelerated
  • CS 241: Embedded Systems Workshop (EE 285)
  • CS 242: Programming Languages

All CS courses · All departments