53rd IEEE Conference on Decision and Control 2014
DOI: 10.1109/cdc.2014.7040465
|View full text |Cite
|
Sign up to set email alerts
|

A down-sampled controller to reduce network usage with guaranteed closed-loop performance

Abstract: A down-sampled controller to reduce network usage with guaranteed closed-loop performance.In: 53rd IEEE Conference on Abstract-We propose and evaluate a down-sampled controller which reduces the network usage while providing a guaranteed desired linear quadratic control performance. This method is based on fast and slow sampling intervals, as the closed-system benefits by being brought quickly to steady-state conditions while behaving satisfactorily when being actuated at a slow rate once at those conditions.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 26 publications
0
12
0
Order By: Relevance
“…andȲ (i) ≤Ȳ (i + 1), i ∈ N 0 , by induction (which implies Y (i) ≤ Y (i + 1), i ∈ N): it holds for i = 0 due to (5) and assumingȲ (i) ≤Ȳ (i + 1) holds for a given i pre and postmultiplying this inequality by A and A T , respectively, adding W to both sides and using ( 18) we conclude that it holds for i + 1. The proof that g(i) ≤ g(j), if i < j follows then from the fact that g…”
Section: Appendix Proof Of Theoremmentioning
confidence: 97%
See 3 more Smart Citations
“…andȲ (i) ≤Ȳ (i + 1), i ∈ N 0 , by induction (which implies Y (i) ≤ Y (i + 1), i ∈ N): it holds for i = 0 due to (5) and assumingȲ (i) ≤Ȳ (i + 1) holds for a given i pre and postmultiplying this inequality by A and A T , respectively, adding W to both sides and using ( 18) we conclude that it holds for i + 1. The proof that g(i) ≤ g(j), if i < j follows then from the fact that g…”
Section: Appendix Proof Of Theoremmentioning
confidence: 97%
“…Most of the statements follow from optimal control results [20]. Here we only prove the properties of g. We start by noticing that Y (1) ≥ 0 due to (5) and, if we letȲ (0) := Θ, Y (i) := Y (i) + Θ, for i ∈ N, we havē…”
Section: Appendix Proof Of Theoremmentioning
confidence: 99%
See 2 more Smart Citations
“…However, each time we sample we incur a fixed cost ρ, and this is the trade-off our sampling policy should optimize. From (8) we see that the constant γ 0 can be disregarded in the objective 2, and we are now ready to formally define the optimal sampling problem: OSP ρ : Consider the closed-loop system in Fig. 2, with a Kalman-Bucy filter governed by (4) and an LQR controller based on a simulated plant according to (5).…”
Section: The Optimal Sampling Problemmentioning
confidence: 99%