2016
DOI: 10.1016/j.ins.2016.05.034
|View full text |Cite
|
Sign up to set email alerts
|

Data-based robust optimal control of continuous-time affine nonlinear systems with matched uncertainties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 62 publications
(16 citation statements)
references
References 51 publications
0
16
0
Order By: Relevance
“…Due to the existence of unknown attacks, it is difficult or even impossible to investigate the systems 3and 4directly. Inspired by the idea of classical works [23][24][25][26], we convert this robust control issue of the systems 3and 4into the optimal control problem of the nominal system (2). e main idea is that, with the system data and models, we can first attain the optimal control policy through ADP algorithms.…”
Section: Problem Statement For Power Systemmentioning
confidence: 99%
“…Due to the existence of unknown attacks, it is difficult or even impossible to investigate the systems 3and 4directly. Inspired by the idea of classical works [23][24][25][26], we convert this robust control issue of the systems 3and 4into the optimal control problem of the nominal system (2). e main idea is that, with the system data and models, we can first attain the optimal control policy through ADP algorithms.…”
Section: Problem Statement For Power Systemmentioning
confidence: 99%
“…In this subsection, the data of the PV power is measured by specific sensors and is stored in the control unit. Recently, intelligent algorithms have been developed for obtaining information from data [26][27][28][29][30][31]. Therefore, these data are available to design an observer to forecast the future PV power.…”
Section: Neural Network Observermentioning
confidence: 99%
“…The gradient descent method is used to update the weights of the neural network observer in the backpropagation [26][27][28]32]. Define the input-to-hidden weight vector w 1 t and the hidden-to-output weight vector w 2 t as…”
Section: Neural Network Observermentioning
confidence: 99%
“…In recent years, Lewis, Jagannathan, Murray, Powell and Liu have made great contribution to the development of the ADP algorithms. According to Werbos, ADP approaches were classified into several schemes including heuristic dynamic programming (HDP), action dependent HDP, dual heuristic programming (DHP), action dependent DHP, globalized DHP (GDHP), and ADGDHP.…”
Section: Introductionmentioning
confidence: 99%
“…There are some synonyms of ADP including approximate dynamic programming, 8,9 adaptive dynamic programming, [10][11][12] adaptive critic designs, 13,14 neural dynamic programming, 15,16 neurodynamic programming, 17 and reinforcement learning. 18,19 In recent years, Lewis,[20][21][22] Jagannathan, 23, 24 Murray, 25 Powell 26 and Liu [27][28][29][30] have made great contribution to the development of the ADP algorithms. According to Werbos,5 ADP approaches were classified into several schemes including heuristic dynamic programming (HDP), action dependent HDP, dual heuristic programming (DHP), action dependent DHP, globalized DHP (GDHP), and ADGDHP.…”
Section: Introductionmentioning
confidence: 99%