Error-Correcting Codes for Automatic Control
Speaker: Leonard Schulman , California Institute of Technology
Date: April 25 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Host: Ronitt Rubinfeld, Massachusetts Institute of Technology
Contact: Kevin Matulef, 3-5883, matulef@mit.edu
Relevant URL: http://theory.csail.mit.edu/toc-seminars/THIS COLLOQUIUM IS JOINT WITH LIDS (there will also be refreshments after the talk in the Dreyfoos 6th floor lounge)
In many control-theory applications one can classify all possible states of the device by an infinite state graph with polynomial growth rate. In order for a controller to control or estimate the state of such a device, it must receive reliable communications from its sensors; if there is channel noise, the encoding task is subject to a stringent real-time constraint. We provide a constructive on-line error correcting code that works for this class of applications. Our code is computationally efficient and enables on-line estimation and control in the presence of channel noise. It establishes a constructive (and optimal-within-constants) analog, for control applications, of the Shannon coding theorem.
Joint work with
Rafail Ostrovsky, UCLA
Yuval Rabani, Technion
See other events that are part of Theory Colloquium Spring 2006
See other events happening in April 2006
