Control Engineering plays a fundamental role in modern technological systems. The aim of this course is to serve as an introduction to control system analysis and design. The objectives include equipping students with:
Lecture | Topic | Handouts | Slides |
---|---|---|---|
1 | Frequency Response | Handouts1 | Slides1 |
2 | Bode Plots for Simple Factors | Handouts2 | Slides2 |
3 | Bode Plots of Complex Transfer Function | Handouts3 | Slides3 |
4 | Frequency Domain Modelling | Handouts4 | Slides4 |
5&6 | Nyquist Stability Criterion & Nyquist Plots | Handouts5 | Slides5 |
7 | Relative Stability Analysis | Handouts6 | Slides6 |
8 | Loop Shaping, Lead Compensator | Handouts7 | Slides7 |
9 | Lag Compensator | Handouts8 | Slides8 |
10 | PID Tuning | Handouts9 | Slides9 |
11 | Examples on Controller Design | Handouts10 | Slides10 |
12 | Review | Handouts11 | Slides11 |
Networked control systems are spatially distributed systems for which the communication between sensors, actuators and controllers is supported by communication networks. Recent advances in sensing, communication technologies and computer architecture have led to the rapid growth of cost effective and low power devices, which dramatically increases the adaptability, efficiency and functionality of the control systems. However, networked control systems also introduce new challenges, as the information becomes local to each node and the information sharing between nodes may subject to network effects such as packet drop or delay.
In this course, we will review several recent advancements in networked control theory. We first consider a centralized control scheme, where the communication between the sensor, the controller and the actuator is unreliable. We then move to distributed control schemes and analyze the consensus algorithm, as it is key for many distributed control applications. Next, we study the performance of a consensus-based distributed inference algorithm. Finally, we discuss the consensus algorithm in adversarial environment.
Undergraduate linear algebra, probability and signal processing, understanding of modern (state space) control theory
Course | Topic | Reading |
---|---|---|
1 | Course Overview | Control in an Information Rich World, Notes |
2 | State Estimation, Kalman Filtering | Kalman Filtering, Notes |
3 | Functions of Symmetric Matrices | Notes |
4 | Estimation over Lossy Networks | Notes |
5 | Control Over Lossy Networks, Witsenhausen's counterexample | Witsenhausen's paper, Control over Lossy Networks, Notes |
6 | Sensor Selection | Convex opt, Submodularity, Notes |
7 | Event-based Estimation | Event-triggered Estimation, Event-based Control, Notes |
8 | Average Consensus | Good Topology, Notes |
9 | Variants of Average Consensus | Consensus with Switching Topology and Channel Noise, Finite Time Consensus, Finite Time Consensus(continuous time), Notes |
10 | Gossip Algorithm | Gossip paper, Products of Random Matrices, Notes |
11 | Large Deviation | Cramer's Theorem |
12 | Distributed Hypothesis Testing | Reference, Notes |
13 | Distributed Estimation | References, Constant Gain Strategy, Notes |
14 | Nonnegative Matrices and Distributed Control | Perron-Frobenius theorem, Control of Positive System, Notes |
15 | Generic Properties of Linear Structured Systems | A Survey Paper, Notes |
16 | Secure Control: Intrusion Detection and Identification | Secure Consensus, Fault Detection and Identification, Notes |