Stanford Root

Schedule

Stanford Root

Schedule

CS 237B

Principles of Robot Autonomy II (AA 174B, AA 274B, EE 260B, ME 274B)

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

This course teaches advanced principles for endowing mobile autonomous robots with capabilities to autonomously learn new skills and to physically interact with the environment and with humans. It also provides an overview of different robot system architectures. Concepts that will be covered in the course are: Reinforcement Learning and its relationship to optimal control, contact and dynamics models for prehensile and non-prehensile robot manipulation, imitation learning and human intent inference, as well as different system architectures and their verification. Students will earn the theoretical foundations for these concepts and implement them on mobile manipulation platforms. In homeworks, the Robot Operating System (ROS) will be used extensively for demonstrations and hands-on activities. Prerequisites: CS 106A or equivalent, CME 100 or equivalent (for linear algebra), CME 106 or equivalent (for probability theory), and AA 171/CS 274.

Syllabus for selected term:
View Winter 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 26218
0 / 999 enrolled
DAYS:TBD
TIME:TBD
LOCATION:TBD
units

CS 237B: Principles of Robot Autonomy II (AA 174B, AA 274B, EE 260B, ME 274B)

3-4 units · Letter or Credit/No Credit

This course teaches advanced principles for endowing mobile autonomous robots with capabilities to autonomously learn new skills and to physically interact with the environment and with humans. It also provides an overview of different robot system architectures. Concepts that will be covered in the course are: Reinforcement Learning and its relationship to optimal control, contact and dynamics models for prehensile and non-prehensile robot manipulation, imitation learning and human intent inference, as well as different system architectures and their verification. Students will earn the theoretical foundations for these concepts and implement them on mobile manipulation platforms. In homeworks, the Robot Operating System (ROS) will be used extensively for demonstrations and hands-on activities. Prerequisites: CS106A or equivalent, CME 100 or equivalent (for linear algebra), CME 106 or equivalent (for probability theory), and AA 171/274.

Offered in Winter 2027 at Stanford University.

Winter 2027 sections

  • Lecture — TBA TBA (Graduate)

More CS courses

  • CS 231N: Deep Learning for Computer Vision
  • 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 238: Decision Making under Uncertainty (AA 228)
  • 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)

All CS courses · All departments