This shows you the differences between two versions of the page.
— |
en:group:seminars:20050730 [2016/06/23 11:26] (current) |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | |||
+ | ---- dataentry seminar ---- | ||
+ | date_dt : 2005-07-30 | ||
+ | title : Error-Correcting Codes for Automatic Control | ||
+ | speaker : Leonard J. Schulman | ||
+ | affiliation : California Institute of Technology | ||
+ | time : | ||
+ | room : | ||
+ | table : seminars | ||
+ | =================== | ||
+ | template:datatemplates:seminar | ||
+ | ----------------------- | ||
+ | |||
+ | |||
+ | ==== abstract ==== | ||
+ | In many control-theory applications one can classify all possible states of the device by an infinite state graph with polynomially-growing expansion. 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 show a constructive on-line error correcting code that works for this class of applications. Our code is asymptotically optimal subject to the channel capacity constraint, is computationally efficient, and enables on-line estimation and control in the presence of channel noise. Our construction establishes a constructive and asymptotically-optimal analog of Shannon coding theorem for control applications. Joint work with Rafail Ostrovsky and Yuval Rabani. | ||