Introduction to Autonomous Systems
PhD Course
Enrollment
Please use the following link to enroll.
Registration formGoal
A 10-hour PhD-level course on modeling, decision-making, and coordination in autonomous and multi-agent systems. Students develop a systems-and-control perspective on autonomy: how agents use information to make decisions under uncertainty, interact over networks, and achieve collective objectives.
Schedule
- Lecture I: April 5, 2027
- Lecture II: April 7, 2027
- Lecture III: April 9, 2027
- Lecture IV: April 12, 2027
- Exam: April 19, 2027
Syllabus
Topics include:
- Graph-theoretic models of multi-agent systems: directed and undirected graphs, connectivity, Laplacians, centrality, and time-varying networks.
- Stochastic dynamics and Markov decision processes: Markov chains, transition models, stationary behavior, policies, dynamic programming, and Bellman equations.
- Autonomous decision-making under partial observation: observation models, Bayesian belief updates, POMDPs, information structures, and the value of information.
- Consensus and agreement dynamics: continuous- and discrete-time consensus, leader–follower coordination, directed and switching graphs, gossip algorithms, and communication imperfections.
- Distributed coordination: rendezvous, formation control, coverage control, and task allocation.
Exam
The final exam is optional and consists of a multiple-choice test covering the material presented in class.
References
- Mesbahi, M., & Egerstedt, M. (2010). Graph theoretic methods in multiagent networks (Vol. 33). Princeton University Press.
- Puterman, M. L. (2014). Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons.
- Krishnamurthy, V. (2016). Partially observed Markov decision processes. Cambridge University Press.
- Cortés, J., Bullo, F., & Martínez, S. Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (Princeton Series in Applied Mathematics). Princeton University Press.