2017
DOI: 10.1016/j.automatica.2017.06.015
|View full text |Cite
|
Sign up to set email alerts
|

Drift counteraction optimal control for deterministic systems and enhancing convergence of value iteration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Finally, according to the sequence of identification states s ∅ , s brand , s model, s all and seq, the corresponding actions in the sequence seq of each state are selected in turn and repeatedly, and the optimal multi-protocol probe sequence of a type-known IoT device is obtained. According to the related works [25,26], it can be proved that the algorithm has convergence, that is, the optimal protocol probe sequence obtained is unique. Due to space limitation, the proof process is not given here.…”
Section: Value Iteration Algorithmmentioning
confidence: 99%
“…Finally, according to the sequence of identification states s ∅ , s brand , s model, s all and seq, the corresponding actions in the sequence seq of each state are selected in turn and repeatedly, and the optimal multi-protocol probe sequence of a type-known IoT device is obtained. According to the related works [25,26], it can be proved that the algorithm has convergence, that is, the optimal protocol probe sequence obtained is unique. Due to space limitation, the proof process is not given here.…”
Section: Value Iteration Algorithmmentioning
confidence: 99%
“…However, it is generally difficult to solve an HJB equation either analytically or numerically, especially considering that it may not admit a smooth solution. As a result, recent advances in DCOC have been in a discrete-time setting [7][8][9][10][11][12][13][14][15], which is more computationally tractable. Apart from computational benefits, a discrete-time formulation also leads to control solutions that are easily implementable with digital micro-controllers.…”
Section: Introductionmentioning
confidence: 99%
“…Apart from computational benefits, a discrete-time formulation also leads to control solutions that are easily implementable with digital micro-controllers. For discrete-time systems, DCOC approaches based on dynamic programming (DP) [7][8][9][10][11][12] and mixed-integer programming (MIP) [13][14][15] have been developed. However, both DP-based and MIP-based approaches are faced with computational challenges: The former can treat DCOC problems with general yield functional [7] but suffer from the curse of dimensionality [16];…”
Section: Introductionmentioning
confidence: 99%
“…In [10], problem (5) was solved using dynamic programming techniques. Due to the curse of dimensionality, this approach is limited to lower-dimensional problems.…”
mentioning
confidence: 99%