Difference between revisions of "CDS 101/110  State Feedback"
Line 4:  Line 4:  
== Overview ==  == Overview ==  
−  '''Monday:''' Reachability and State Feedback ({{cds101 handoutsL51_reachability_h.pdfSlides}}, MP3)  +  '''Monday:''' Reachability and State Feedback ({{cds101 handoutsL51_reachability_h.pdfSlides}}, [[Media:23Oct06.mp3MP3]]) 
This lecture introduces the concept of reachability and explores the use of state space feedback for control of linear systems. Reachability is defined as the ability to move the system from one condition to another over finite time. The reachability matrix test is given to check if a linear system is reachable, and the test is applied to several examples. The concept of (linear) state space feedback is introduced and the ability to place eigenvalues of the closed loop system arbitrarily is related to reachability. A cart and pendulum system and the predator prey problem are used as examples.  This lecture introduces the concept of reachability and explores the use of state space feedback for control of linear systems. Reachability is defined as the ability to move the system from one condition to another over finite time. The reachability matrix test is given to check if a linear system is reachable, and the test is applied to several examples. The concept of (linear) state space feedback is introduced and the ability to place eigenvalues of the closed loop system arbitrarily is related to reachability. A cart and pendulum system and the predator prey problem are used as examples.  
Line 12:  Line 12:  
This lecture will describe how to design state feedback controllers via eigenvalue placement. The performance of the system as a function of the placement of the closed loop eigenvalues will be described. The use of integral action and a brief introduction to LQR control will also be given.  This lecture will describe how to design state feedback controllers via eigenvalue placement. The performance of the system as a function of the placement of the closed loop eigenvalues will be described. The use of integral action and a brief introduction to LQR control will also be given.  
−  '''Friday:''' Midterm review  +  '''Friday:''' Midterm review 
== Handouts ==  == Handouts == 
Revision as of 23:04, 23 October 2006
See current course homepage to find most recent page available. 
CDS 101/110a  Schedule  Recitations  FAQ  AM06 (errata) 
Overview
Monday: Reachability and State Feedback (Slides, MP3)
This lecture introduces the concept of reachability and explores the use of state space feedback for control of linear systems. Reachability is defined as the ability to move the system from one condition to another over finite time. The reachability matrix test is given to check if a linear system is reachable, and the test is applied to several examples. The concept of (linear) state space feedback is introduced and the ability to place eigenvalues of the closed loop system arbitrarily is related to reachability. A cart and pendulum system and the predator prey problem are used as examples.
Wednesday: State Feedback Design (Notes, MP3)
This lecture will describe how to design state feedback controllers via eigenvalue placement. The performance of the system as a function of the placement of the closed loop eigenvalues will be described. The use of integral action and a brief introduction to LQR control will also be given.
Friday: Midterm review
Handouts
Monday

Wednesday (CDS 110)

Friday 
Reading
 K. J. Åström and R. M. Murray, Feedback Systems: An Introduction for Scientists and Engineers, Preprint, 2006. Chapter 6  State Feedback.
Midterm
The exam will consist of 35 problems, covering the material in the first five weeks of the course (including reachability and state feedback). The exam will be open book. You may use the course notes, any of the optional texts (Friedland, FranklinPowell and EmamiNaeni, Leonard and Levin, Strogatz, or Kuo), course handouts, lecture notes, course problem sets and solutions, and your own handwritten notes. No other books are allowed.
You may use a computer or calculator for carrying out numerical computations. MATLAB may be used but is not required. You are not allowed to use the Internet during the exam (except for accessing local computing resources, such as MATLAB/SIMULINK), but you may download or print out copies of presentations, notes, FAQs, or other material posted on the course web site (CDS 101 or 110). You are not allowed to print out contents of other sites for use while taking the exam (although you can take handwritten notes on the sites and use your own notes in the exam).
The exam will be due by 5 p.m. Tuesday, 31 October, in the box outside 102 Steele. Please write your solutions in a fresh exam book (blue book). We have to grade a large collections of exams in a short time and it makes things much simpler to manage if everyone uses a bluebook.
FAQ
Monday <ncl>CDS 101/110 FAQ  Lecture 51</ncl> Wednesday <ncl>CDS 101/110 FAQ  Lecture 52</ncl> Friday <ncl>CDS 101/110 FAQ  Lecture 53</ncl> Homework <ncl>CDS 101/110 FAQ  Midterm</ncl>