Sparse Representations for Packetized Predictive Networked Control
-
Upload
masaaki-nagahara -
Category
Technology
-
view
321 -
download
3
description
Transcript of Sparse Representations for Packetized Predictive Networked Control
![Page 1: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/1.jpg)
Sparse Representations for Packetized Predictive Networked Control
Masaaki Nagahara (Kyoto Univ.)Daniel E. Quevedo (The Univ. of Newcastle)
![Page 2: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/2.jpg)
Networked Control in Sparse Land
โข In networked control, one has to transmit control signals through unreliable networks.
โข Packetized Predictive Control (PPC) can make the system robust against packet dropouts.
โข Sparse Representation can effectively compress signals without much distortion.
โข This work is
PPC + Sparse Representation
![Page 3: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/3.jpg)
Table of Contents
โข How does Packetized Predictive Control work?โ PPC in networked control systems with packet
dropoutโข How can one obtain sparse vectors?
โ -norm regularizationโ Fast iterative-shrinkage algorithm
โข PPC + Sparse Representationโ Is the feedback system stable? YES.
โข Examples
![Page 4: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/4.jpg)
Table of Contents
โข How does Packetized Predictive Control work?โ PPC in networked control systems with packet
dropoutโข How can one obtain sparse vectors?
โ -norm regularizationโ Fast iterative-shrinkage algorithm
โข PPC + Sparse Representationโ Is the feedback system stable? YES.
โข Examples
![Page 5: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/5.jpg)
Packetized Predictive Control
โข Compute a tentative control sequence for a finite horizon of future time instants.
โข Transmit the sequence as a packet to a buffer.โข If a packet is dropped out, use the control
stored in the buffer[Bemporad(1998), Casavola et al.(2006), Tang-Silva(2009), Quevedo(2007,2011)]
Controller Buffer Plant๐ฅ (๐) ๐ (๐) ๐ข(๐) ๐ฅ (๐)
![Page 6: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/6.jpg)
Packetized Predictive Control
Controller Buffer Plant๐ฅ (0) ๐ (0) ๐ฅ (0)
๐ข0(0)๐ข1(0)
๐ข2(0)๐ข3(0)
๐ (0 )=[๐ข0 (0 ) ,๐ข1 (0 ) ,๐ข2 (0 ) ,๐ข3 (0 ) ]๐
๐ฝ (๐ )=โ๐ฅ (3|0 )โ๐2+โ๐=0
3
โ๐ฅ (๐|0 )โ๐2+๐โ๐โ๐
2
โ๐ฃโ๐2 โ๐ฃ๐ ๐๐ฃ
minimizing the cost function:
![Page 7: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/7.jpg)
Packetized Predictive Control
Controller Buffer Plant
Assumption: The first packet is successfully transmitted to the buffer.
๐ฅ (0) ๐ (0) ๐ฅ (0)
๐ข0(0)๐ข1(0)
๐ข2(0)๐ข3(0)
![Page 8: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/8.jpg)
Packetized Predictive Control
Controller Buffer Plant
Assumption: The first packet is successfully transmitted to the buffer. the 4 values are stored in the buffer.
๐ข0(0)๐ข1(0)
๐ข2(0)๐ข3(0)
๐ฅ (0) ๐ (0) ๐ฅ (0)
![Page 9: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/9.jpg)
Packetized Predictive Control
Controller Buffer Plant
Assumption: The first packet is successfully transmitted to the buffer. the 4 values are stored in the buffer.
๐ข0(0)๐ข1(0)
๐ข2(0)๐ข3(0)
๐ข (0 )=๐ข0 (0)๐ฅ (0) ๐ (0) ๐ฅ (0)
![Page 10: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/10.jpg)
Packetized Predictive Control
Controller Buffer Plant
๐ข0(1)๐ข1(1)
๐ข2(1)๐ข3(1)
๐ฅ (1) ๐ (1) ๐ฅ (1)
๐ (1 )=[๐ข0 (1 ) ,๐ข1 (1 ) ,๐ข2 (1 ) ,๐ข3 (1 ) ]๐
๐ฝ (๐ )=โ๐ฅ (3|1 )โ๐2+โ๐=0
3
โ๐ฅ (๐|1 )โ๐2+๐โ๐โ๐
2
![Page 11: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/11.jpg)
Packetized Predictive Control
Controller Buffer Plant
๐ข0(1)๐ข1(1)
๐ข2(1)๐ข3(1)
๐ฅ (1) ๐ (1) ๐ฅ (1)
![Page 12: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/12.jpg)
Packetized Predictive Control
Controller Buffer Plant
Packet-dropout occurs!๐ข0(1)๐ข1(1)
๐ข2(1)๐ข3(1)
๐ฅ (1) ๐ (1) ๐ฅ (1)
![Page 13: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/13.jpg)
Packetized Predictive Control
Controller Buffer Plant
Use in the bufferas the control ๐ข0(0)
๐ข1(0)๐ข2(0)
๐ข3(0)
๐ข (1 )=๐ข1(0)๐ฅ (1) ๐ (1) ๐ฅ (1)
![Page 14: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/14.jpg)
Design of control packetsโข At each step, we solve the following optimization
for the packet :
โข The solution is given by linear transformation of the state :
๐ฝ (๐ )=โ๐ฅ (๐|๐ )โ๐2+โ๐=0
๐
โ๐ฅ (๐|๐ )โ๐2+๐โ๐โ2
2
ยฟโ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ2
2+โ๐ฅ (๐)โ๐2
![Page 15: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/15.jpg)
Table of Contents
โข How does Packetized Predictive Control work?โ PPC in networked control systems with packet
dropoutโข How can one obtain sparse vectors?
โ -norm regularizationโ Fast iterative-shrinkage algorithm
โข PPC + Sparse Representationโ Is the feedback system stable? YES.
โข Examples
![Page 16: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/16.jpg)
Sparsity-Promoting Optimization
โข Energy-limiting optimization (-norm regularization):
โข Sparsity-promoting optimization (-norm regularization, optimization):
๐โ (๐ )=min๐
โ๐บ๐โ๐ป๐ฅ (๐ )โ22+๐โ๐โ2
2
๐โ (๐ )=min๐
โ๐บ๐โ๐ป๐ฅ (๐ )โ22+๐โ๐โ1
โ
![Page 17: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/17.jpg)
Sparsity-Promoting Optimization
โข -norm regularization produces a dense vector like
โข -norm regularization (or optimization) produces a sparse vector like
โข Sparse vectors can be compressed more effectively than a dense vector.โ c.f. JPEG image compression
๐โ=[โ2.6 ,โ0.1 ,โ1.8 ,0.1 ,โ0.6 ]๐
๐โ=[โ2.6 ,0.09 ,โ2.2 ,0 ,0 ]๐
![Page 18: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/18.jpg)
Why does promote sparsity?
โข By using the Lagrange dual, we obtain
for some .
{Uโ๐ 2 :โ๐โ1=const }
0
๐โ (๐ )=argmin๐
โ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ1
โ
ยฟargmin๐
โ๐โ1โs . t .โ๐บ๐โ๐ป๐ฅ (๐ )โ2
2โค๐
{Uโ๐ 2 :โ๐บ๐โ๐ป๐ฅโ22โค๐ }
Feasible set
ball
![Page 19: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/19.jpg)
Why does promote sparsity?
โข By using the Lagrange dual, we obtain
for some .
๐โ (๐ )=argmin๐
โ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ1
โ
ยฟargmin๐
โ๐โ1โs . t .โ๐บ๐โ๐ป๐ฅ (๐ )โ2
2โค๐
{Uโ๐ 2 :โ๐โ1=const }
{Uโ๐ 2 :โ๐บ๐โ๐ป๐ฅโ22โค๐ }๐โ
0Sparse!
Feasible set
ball
![Page 20: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/20.jpg)
Comparison with energy-limiting optimization
{Uโ๐ 2 :โ๐โ2=const }
{Uโ๐ 2 :โ๐บ๐โ๐ป๐ฅโ22โค๐ }๐โ
0Not sparse
ยฟargmin๐
โ๐โ22s . t .โ๐บ๐โ๐ป๐ฅ (๐ )โ2
2โค๐
๐โ (๐ )=argmin๐
โ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ2
2
Feasible set
ball
![Page 21: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/21.jpg)
Iterative-Shrinkage Algorithm
โข The solution of
can be effectively obtained via a fast algorithm.
๐โ (๐ )=argmin๐
โ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ1
โ
๐ ๐+1=๐2๐ /๐ ( 1๐ ๐บ๐ (๐ป๐ฅ (๐)โ๐บ๐ ๐ )+๐ ๐) , ๐=0,1,2,โฆ
[Beck-Teboulle, SIAM J. Imag. Sci., 2009][Zibulevsky-Elad, IEEE SP Mag., 2010]
![Page 22: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/22.jpg)
Iterative-Shrinkage Algorithm
โข The solution of
can be effectively obtained via a fast algorithm.๐ ๐+1=๐2๐ /๐ ( 1๐ ๐บ๐ (๐ป๐ฅ (๐)โ๐บ๐ ๐ )+๐ ๐) , ๐=0,1,2,โฆ
๐2๐/ ๐ (๐ข)
๐ข2๐ /๐
โ2๐ /๐ ๐>๐max (๐บ๐๐บ)
๐โ (๐ )=argmin๐
โ๐บ๐ โ๐ป๐ฅ (๐ )โ22+๐โ๐โ1
โ
[Beck-Teboulle, SIAM J. Imag. Sci., 2009][Zibulevsky-Elad, IEEE SP Mag., 2010]
![Page 23: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/23.jpg)
Table of Contents
โข How does Packetized Predictive Control work?โ PPC in networked control systems with packet
dropoutโข How can one obtain sparse vectors?
โ -norm regularizationโ Fast iterative-shrinkage algorithm
โข PPC + Sparse Representationโ Is the feedback system stable? YES.
โข Examples
![Page 24: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/24.jpg)
Stability Analysisโข The controlled plant: โข The control packet:
โข If then โข This implies that asymptotic stability will not be
achieved if is unstable even if there is no packet-dropout.
{๐ฅโโ 2:โ๐บ๐ ๐ป๐ฅโโโค2๐}
0๐ฅ (๐)
![Page 25: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/25.jpg)
Practical Stabilityโข Assumption: The number of consecutive packet-
dropouts is always less than the prediction horizon (the size of the buffer)
[Theorem]Let and choose to satisfy
where Then for we have (practical stability)
where are constants.
๐ฝ (๐ )=โ๐ฅ (๐|๐ )โ๐2+โ๐=0
๐
โ๐ฅ (๐|๐ )โ๐2+๐โ๐โ1
โ
Terminal condition
![Page 26: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/26.jpg)
Table of Contents
โข How does Packetized Predictive Control work?โ PPC in networked control systems with packet
dropoutโข How can one obtain sparse vectors?
โ -norm regularizationโ Fast iterative-shrinkage algorithm
โข PPC + Sparse Representationโ Is the feedback system stable? YES.
โข Examples
![Page 27: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/27.jpg)
Examples
โข Controlled plant
the elements in and are generated by random sampling from . has 3 unstable eigenvalues.
โข The horizon length is .โข Two designs:
โ Sparsity-promoting design ()โ Energy-limiting design (regularization)
![Page 28: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/28.jpg)
Transmitted Control Packets
![Page 29: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/29.jpg)
Histogram of Quantized Transmitted Values
Proposed
Conventional
![Page 30: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/30.jpg)
-norm of the state
Sparsity-promoting (proposed)
Energy-limiting (Conventional)
![Page 31: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/31.jpg)
-norm of the state
Sparsity-promoting (proposed)
Energy-limiting (Conventional)
Proposed method leads to more effective compression than the conventional method without much distortion.
![Page 32: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/32.jpg)
Parameter vs sparsity and performance
๐ฝ (๐ )=โ๐ฅ (๐|๐ )โ๐2+โ๐=0
๐
โ๐ฅ (๐|๐ )โ๐2+๐โ๐โ1
โ
Sparsityโ5โโ๐โ0=5โ1100
โ๐=1
100
โ๐ (๐ )โ0
Performanceโโ๐ฅโ2
![Page 33: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/33.jpg)
Conclusionโข Sparsity-promoting optimization () for packetized
predictive control.โข Sparse representation of packets leads to efficient
compression of transmitted signals.โข The feedback system can be practically stable.โข Examples show the effectiveness of our method.โข Future work may include
โ Bit-rate analysis of optimized controlโ Robustness against disturbances in the plant
![Page 34: Sparse Representations for Packetized Predictive Networked Control](https://reader036.fdocuments.us/reader036/viewer/2022062320/55900b4c1a28abd53d8b4591/html5/thumbnails/34.jpg)
Conclusionโข Sparsity-promoting optimization () for packetized
predictive control.โข Sparse representation of packets leads to efficient
compression of transmitted signals.โข The feedback system can be practically stable.โข Examples show the effectiveness of our method.โข Future work may include
โ Bit-rate analysis of optimized controlโ Robustness against disturbances in the plant
Grazie!