USAFrance OCEAN. Control and Communication: an overview Jean-Charles Delvenne CMI, Caltech May 5, 2006.

Slides:



Advertisements
Similar presentations
1+eps-Approximate Sparse Recovery Eric Price MIT David Woodruff IBM Almaden.
Advertisements

Another question consider a message (sequence of characters) from {a, b, c, d} encoded using the code shown what is the probability that a randomly chosen.
Ulams Game and Universal Communications Using Feedback Ofer Shayevitz June 2006.
A journey through data rate theorems for communication and control Massimo Franceschetti.
NONLINEAR HYBRID CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois.
CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign.
TOWARDS a UNIFIED FRAMEWORK for NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer.
1 of 13 STABILIZING a SWITCHED LINEAR SYSTEM by SAMPLED - DATA QUANTIZED FEEDBACK 50 th CDC-ECC, Orlando, FL, Dec 2011, last talk in the program! Daniel.
Sampling and Pulse Code Modulation
Information Theory EE322 Al-Sanie.
Properties of State Variables
How to do control theory and discrete maths at the same time?
CELLULAR COMMUNICATIONS 5. Speech Coding. Low Bit-rate Voice Coding  Voice is an analogue signal  Needed to be transformed in a digital form (bits)
Chapter 6 Information Theory
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Fundamental limits in Information Theory Chapter 10 :
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
Review Rong Jin. Comparison of Different Classification Models  The goal of all classifiers Predicating class label y for an input x Estimate p(y|x)
Noise, Information Theory, and Entropy
CONTROL with LIMITED INFORMATION ; SWITCHING ADAPTIVE CONTROL Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ.
Channel Polarization and Polar Codes
DSP (digital signal processing) (DSP) deals with commonly signals such as speech, music, video, EKG or ECG (heart), and EEG (brain).
QUANTIZED CONTROL and GEOMETRIC OPTIMIZATION Francesco Bullo and Daniel Liberzon Coordinated Science Laboratory Univ. of Illinois at Urbana-Champaign U.S.A.
CONTROL of NONLINEAR SYSTEMS with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
STABILIZING a NONLINEAR SYSTEM with LIMITED INFORMATION FEEDBACK Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
CONTROL of NONLINEAR SYSTEMS under COMMUNICATION CONSTRAINTS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ.
MEETING THE NEED FOR ROBUSTIFIED NONLINEAR SYSTEM THEORY CONCEPTS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
The Complex Braid of Communication and Control Massimo Franceschetti.
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
TUTORIAL on LOGIC-BASED CONTROL Part I: SWITCHED CONTROL SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
Mathematical Preliminaries. 37 Matrix Theory Vectors nth element of vector u : u(n) Matrix mth row and nth column of A : a(m,n) column vector.
Channel Capacity.
Toward a Secure Data-Rate Theorem Paul Cuff. Control Setting Controller Encoder System (Plant) Sensors Rate R UiUi XiXi YiYi.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
§2 Discrete memoryless channels and their capacity function
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Coding Theory Efficient and Reliable Transfer of Information
Transmission over composite channels with combined source-channel outage: Reza Mirghaderi and Andrea Goldsmith Work Summary STATUS QUO A subset Vo (with.
Introduction to Digital Signals
BCS547 Neural Decoding. Population Code Tuning CurvesPattern of activity (r) Direction (deg) Activity
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
1 Source Coding and Compression Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204, Lecture 10 Rate-Distortion.
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
STABILIZATION by QUANTIZED FEEDBACK : HYBRID CONTROL APPROACH Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ.
CS294-9 :: Fall 2003 Joint Source/Channel Coding Ketan Mayer-Patel.
NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
Raptor Codes Amin Shokrollahi EPFL. BEC(p 1 ) BEC(p 2 ) BEC(p 3 ) BEC(p 4 ) BEC(p 5 ) BEC(p 6 ) Communication on Multiple Unknown Channels.
Using Feedback in MANETs: a Control Perspective Todd P. Coleman University of Illinois DARPA ITMANET TexPoint fonts used.
Source Encoder Channel Encoder Noisy channel Source Decoder Channel Decoder Figure 1.1. A communication system: source and channel coding.
CDC 2006, San Diego 1 Control of Discrete-Time Partially- Observed Jump Linear Systems Over Causal Communication Systems C. D. Charalambous Depart. of.
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
TOWARDS a UNIFIED FRAMEWORK for NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer.
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
UNIT I. Entropy and Uncertainty Entropy is the irreducible complexity below which a signal cannot be compressed. Entropy is the irreducible complexity.
Chapter 4: Information Theory. Learning Objectives LO 4.1 – Understand discrete and continuous messages, message sources, amount of information and its.
The Johns Hopkins University
General Strong Polarization
Synaptic Dynamics: Unsupervised Learning
Tim Holliday Peter Glynn Andrea Goldsmith Stanford University
General Strong Polarization
Sampling Theorems- Nyquist Theorem and Shannon-Hartley Theorem
Estimation from Quantized Signals
Guosong Yang1, A. James Schmidt2, and Daniel Liberzon2
Lecture 11 The Noiseless Coding Theorem (Section 3.4)
On Topological Entropy and Stability of Switched Linear Systems
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

USAFrance OCEAN

Control and Communication: an overview Jean-Charles Delvenne CMI, Caltech May 5, 2006

Treasure map Poincaréville Shannon City

Motivation=Remote Control Telesurgery Robot on Mars Alice project USAFranceDigital channel

What is a dynamical system ? (Piece of Nature evolving in time) State x Input u Output y Input u = effect of the environment Output y = effect on the environment

What is control ? (Human vs Nature) Simple controllers preferred: Memoryless: u:=k(y) Controller x 0 y u

If everything is smooth… Linearization around a fixed point Easier to analyze than nonlinear.

If information is limited... Bottleneck for circulation of information Channel u y Encoder Decoder

A first observation Delchamps (1991) Linear system, memoryless strategy x:= x+u, | |>1 Solution: u=- x … with noiseless digital channel Finitely many values for u Convergence to zero impossible We settle for ‘practical stability’: neighborhood of zero

What kind of channel? Noiseless digital Noisy digital Analog Gaussian Packet drop (digital or analog)

What kind of system? Discrete-time or continuous-time Deterministic or stochastic Linear versus non-linear

What kind of objective? State converges to 0 State goes to/remains in a neighborhood of 0 Nth moment of the state bounded Time needed to reach a neighborhood of 0

Summary Many models, many results Lower bounds : what we can’t hope Strategies : what we can hope Stability and performance

Stability

The fundamental lower bound We want to (practically) stabilize We need a channel rate

The lower bound is tight If digital noiseless channel, then is sufficient Proof: cut and paste, volume preserved Nair and Evans, Tatikonda, Liberzon, 2002

With noise If additive noise: Practical stability impossible in general Second moment stability iff

Tools for lower bound Entropy Entropy power inequality If x,y independent then Entropy-variance relation: If u discrete with N values then

Idea for strategy Separation principle Does not apply in general State x Channel uy Encoder Estimator x est Controller

Nonlinear systems Practical stability on L k =Number of possible k-sequences u a …u b u1u1 u2u2 u3u3 u4u4 S

Topological feedback entropy Set S is not stabilizable if Set S is stabilizable with noiseless channel if

Topological feedback entropy If S small neighborhood of differentiable fixed point, then Similarity with topological entropy for dynamical systems Nair, Evans, Mareels and Moran (2004)

What do we mean by rate? Ok if noiseless If noisy: Shannon capacity Justified by Shannon channel coding theorem Relies on block coding Unsuitable for control: cannot afford delay More refined: Anytime Capacity (Sahai) Moment-stabilizable iff AnytimeCapacity >

Performance

Time, rate, contraction System From [-1,1] to [-  ] Average time T 2 R symbols over noiseless channel Trade-offs Bound: Achieved by zooming strategy (Tatikonda)

Memoryless strategies Fixed partition of [-1,1] 2 R =number of intervals Intervals ~ Separation principle

Lower bounds Fagnani, Zampieri (2001)

The logarithmic strategy Medium rate, medium time Optimal Lyapunov quadratic function Elia-Mitter (2001) 01 r -rr2r2 r3r3 r4r4 -r 4 -r 3 -r 2 

Uniform quantizer High rate, low time Optimal Nested 0 1 

Chaotic strategy   1 0 Low rate, high time Almost all points stabilized Nested Fagnani-Zampieri (2001)

Conclusions

Broad rather than deep Control, dynamical systems, information theory Stability vs performance Steady state vs transient What if quantization subsets are not intervals? No separation principle Simpler theory Next week!