usafrance ocean. control and communication: an overview jean-charles delvenne cmi, caltech may 5,...
Post on 21-Dec-2015
215 views
TRANSCRIPT
What is a dynamical system ?(Piece of Nature evolving in time)
State xInput u Output y
noise) u,g(x,:y
noise) x,of past value f(u,:x
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
x0
yu
If everything is smooth…
Linearization around a fixed point
Easier to analyze than nonlinear.
MwCx:y
:x NvBuAx
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
The lower bound is tight
If digital noiseless channel, then
is sufficient
Proof: cut and paste, volume preserved
Nair and Evans, Tatikonda, Liberzon, 2002
Tools for lower bound
Entropy
Entropy power inequalityIf 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
u y
EncoderEstimatorxest
Controller
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 >
Time, rate, contraction
System From [-1,1] to [-] Average time T 2R symbols over noiseless channel Trade-offs Bound:
Achieved by zooming strategy (Tatikonda)
Memoryless strategies
Fixed partition of [-1,1]
2R=number of intervals
Intervals ~ Separation principle
The logarithmic strategy
Medium rate, medium time Optimal Lyapunov quadratic function Elia-Mitter (2001)
0 1-1 r-r r2r3r4-r4-r3-r2
Chaotic strategy
1-1 0
Low rate, high time Almost all points stabilized Nested Fagnani-Zampieri (2001)