Finite-Approximation-Error-Based Optimal Control Approach for Discrete-Time Nonlinear Systems

In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that mak...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on cybernetics Ročník 43; číslo 2; s. 779 - 789
Hlavní autoři: Liu, Derong, Wei, Qinglai
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States IEEE 01.04.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2168-2267, 2168-2275, 2168-2275
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that makes the iterative performance index function reach the optimum. When the iterative control law and the iterative performance index function in each iteration cannot be accurately obtained, the convergence conditions of the iterative ADP algorithm are obtained. When convergence conditions are satisfied, it is shown that the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some mild assumptions. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
AbstractList In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that makes the iterative performance index function reach the optimum. When the iterative control law and the iterative performance index function in each iteration cannot be accurately obtained, the convergence conditions of the iterative ADP algorithm are obtained. When convergence conditions are satisfied, it is shown that the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some mild assumptions. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that makes the iterative performance index function reach the optimum. When the iterative control law and the iterative performance index function in each iteration cannot be accurately obtained, the convergence conditions of the iterative ADP algorithm are obtained. When convergence conditions are satisfied, it is shown that the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some mild assumptions. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time nonlinear systems with finite approximation errors. The idea is to use an iterative ADP algorithm to obtain the iterative control law that makes the iterative performance index function reach the optimum. When the iterative control law and the iterative performance index function in each iteration cannot be accurately obtained, the convergence conditions of the iterative ADP algorithm are obtained. When convergence conditions are satisfied, it is shown that the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some mild assumptions. Neural networks are used to approximate the performance index function and compute the optimal control policy, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
Author Wei, Qinglai
Liu, Derong
Author_xml – sequence: 1
  givenname: Derong
  surname: Liu
  fullname: Liu, Derong
  email: derong.liu@ia.ac.cn
  organization: State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China
– sequence: 2
  givenname: Qinglai
  surname: Wei
  fullname: Wei, Qinglai
  email: qinglai.wei@ia.ac.cn
  organization: State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing, China
BackLink https://www.ncbi.nlm.nih.gov/pubmed/23070311$$D View this record in MEDLINE/PubMed
BookMark eNqFkUFPGzEQha2KCmjgD7RStRKXXja1x95d-wgptJVoORCOyHLWs6rRrp3ajlT-fU0SOHBoffFo9L3RzHvvyIEPHgl5z-icMao-L29_LC7mQBnMAVjbAH9Djksha4CuOXip2-6InKb0QMuTpaXkITkCTjvKGTsm91fOu4z1-Xodwx83meyCry9jDLG-MAltdbPOpT1Wi-BzDGO1JU3_qxpCrL641Ecs-qWbsPoZ_Og8mljdPqaMUzohbwczJjzd_zNyd3W5XHyrr2--fl-cX9c9lyLXaFsQAxglVtAht0wZzhkfVNvIpkfaDVRBJ0Eoi7S30jb9yjBjBrRiEFbxGfm0m1tW-73BlPVUFsNxNB7DJmnWgeJCcQr_Rwsn2oaypqBnr9CHsIm-HFIoEKKTbXFxRj7uqc1qQqvXsdgVH_WzxwWQO6CPIaWIg-5d3vqco3GjZlQ_Jaq3ieqnRPU-0SKFV9Ln6f8UfdiJHCK-CFoOEqTkfwGEoKq-
CODEN ITCEB8
CitedBy_id crossref_primary_10_1016_j_neucom_2015_03_006
crossref_primary_10_1109_TCYB_2016_2586082
crossref_primary_10_1016_j_jfranklin_2017_04_015
crossref_primary_10_1016_j_neunet_2021_08_025
crossref_primary_10_1016_j_asoc_2019_105629
crossref_primary_10_1109_TSMC_2016_2623766
crossref_primary_10_1016_j_automatica_2014_05_011
crossref_primary_10_1109_TCYB_2018_2859801
crossref_primary_10_1007_s11424_018_7277_7
crossref_primary_10_1016_j_neucom_2017_12_045
crossref_primary_10_1109_TIE_2014_2300068
crossref_primary_10_1109_TCYB_2022_3233593
crossref_primary_10_1109_TSMC_2020_3003224
crossref_primary_10_1155_2016_3460492
crossref_primary_10_1109_TNNLS_2017_2702566
crossref_primary_10_1016_j_neunet_2021_08_012
crossref_primary_10_1109_TSMC_2025_3554219
crossref_primary_10_1088_1674_1056_24_3_030502
crossref_primary_10_1109_TMECH_2023_3336070
crossref_primary_10_1109_TCYB_2022_3158898
crossref_primary_10_1109_TNNLS_2021_3112457
crossref_primary_10_1016_j_neucom_2013_12_038
crossref_primary_10_1109_TNNLS_2014_2358227
crossref_primary_10_1016_j_neunet_2022_04_013
crossref_primary_10_1109_TCYB_2015_2494007
crossref_primary_10_1016_j_neucom_2017_02_051
crossref_primary_10_1016_j_neucom_2023_127048
crossref_primary_10_1109_TCYB_2021_3050619
crossref_primary_10_1109_ACCESS_2019_2920867
crossref_primary_10_1016_j_neucom_2018_07_095
crossref_primary_10_1016_j_neucom_2015_05_087
crossref_primary_10_1080_00207179_2015_1060362
crossref_primary_10_1109_TNNLS_2022_3143527
crossref_primary_10_1007_s00521_015_1954_4
crossref_primary_10_1016_j_neucom_2014_07_082
crossref_primary_10_1109_TCYB_2025_3533139
crossref_primary_10_1155_2017_6157292
crossref_primary_10_1016_j_neucom_2022_01_034
crossref_primary_10_1109_TCYB_2014_2354377
crossref_primary_10_1109_TIE_2014_2361485
crossref_primary_10_1007_s00500_014_1533_0
crossref_primary_10_1016_j_ins_2016_07_065
crossref_primary_10_1016_j_neucom_2014_08_046
crossref_primary_10_1109_TNNLS_2025_3570716
crossref_primary_10_1007_s10589_019_00070_4
crossref_primary_10_1109_TFUZZ_2015_2418000
crossref_primary_10_1109_TNNLS_2015_2402203
crossref_primary_10_1109_TCYB_2014_2319577
crossref_primary_10_1016_j_neucom_2015_02_069
crossref_primary_10_1109_TNNLS_2015_2451535
crossref_primary_10_1109_TSMC_2013_2295351
crossref_primary_10_1109_TAC_2018_2790260
crossref_primary_10_1002_rnc_5687
crossref_primary_10_1002_rnc_7622
crossref_primary_10_1109_TNNLS_2015_2499757
crossref_primary_10_2514_1_G001154
crossref_primary_10_1109_TCYB_2014_2329495
crossref_primary_10_1109_TNNLS_2015_2399020
crossref_primary_10_1109_TSMC_2020_3042876
crossref_primary_10_1109_TNNLS_2014_2360724
crossref_primary_10_1109_TNNLS_2015_2506738
crossref_primary_10_1016_j_jestch_2014_12_004
crossref_primary_10_1109_TASE_2013_2284545
crossref_primary_10_1109_TCYB_2014_2357896
crossref_primary_10_1016_j_neucom_2019_05_026
crossref_primary_10_1109_TNNLS_2015_2503980
crossref_primary_10_1109_TCYB_2015_2492242
crossref_primary_10_1016_j_neucom_2013_12_014
crossref_primary_10_1109_TSMC_2025_3573738
crossref_primary_10_1109_TCYB_2019_2925143
crossref_primary_10_1109_TNNLS_2015_2424971
crossref_primary_10_1016_j_neucom_2022_09_119
crossref_primary_10_1049_iet_cta_2014_1325
crossref_primary_10_1109_TNNLS_2023_3245980
crossref_primary_10_1016_j_engappai_2024_108284
crossref_primary_10_1080_00207179_2024_2309194
crossref_primary_10_1016_j_neunet_2022_10_025
crossref_primary_10_1016_j_ifacol_2017_08_735
crossref_primary_10_1109_TNNLS_2014_2371046
crossref_primary_10_1016_j_engappai_2023_106242
crossref_primary_10_1109_JAS_2022_105692
crossref_primary_10_1109_TNNLS_2014_2306201
crossref_primary_10_1016_j_neucom_2020_01_082
crossref_primary_10_1109_TCYB_2021_3108034
crossref_primary_10_1109_TNNLS_2014_2329942
crossref_primary_10_3390_math13060952
crossref_primary_10_1109_TNNLS_2015_2508926
crossref_primary_10_1109_TCYB_2014_2314612
crossref_primary_10_1007_s00500_013_1170_z
crossref_primary_10_1007_s10489_013_0493_x
crossref_primary_10_1109_TCYB_2016_2519445
crossref_primary_10_1049_iet_cta_2014_0186
crossref_primary_10_1109_TCYB_2015_2421338
crossref_primary_10_1016_j_ejcon_2019_02_003
crossref_primary_10_1007_s00500_023_07817_6
crossref_primary_10_1109_TCSI_2023_3346029
crossref_primary_10_1109_TIE_2014_2388198
crossref_primary_10_1109_TNNLS_2017_2751018
crossref_primary_10_1109_TSMC_2015_2492941
crossref_primary_10_1109_TNNLS_2015_2401334
crossref_primary_10_1016_j_jfranklin_2019_07_022
crossref_primary_10_1109_TCYB_2025_3530951
crossref_primary_10_1109_TNNLS_2015_2388672
crossref_primary_10_1016_j_neucom_2025_130410
crossref_primary_10_1137_17M1122815
crossref_primary_10_1016_j_amc_2025_129628
crossref_primary_10_1631_FITEE_1900610
crossref_primary_10_1109_TCYB_2014_2321390
crossref_primary_10_1109_TNNLS_2019_2919338
crossref_primary_10_3233_IFS_152059
crossref_primary_10_1002_rnc_6550
crossref_primary_10_1109_ACCESS_2018_2887354
crossref_primary_10_1007_s11071_025_11765_1
crossref_primary_10_1109_TSMC_2016_2558098
crossref_primary_10_1002_asjc_1102
crossref_primary_10_1109_TSMC_2018_2852810
crossref_primary_10_1109_TNNLS_2013_2292704
crossref_primary_10_1109_TSMC_2016_2563982
crossref_primary_10_1109_TCYB_2015_2478857
crossref_primary_10_1109_TSMC_2023_3247466
crossref_primary_10_1016_j_automatica_2016_12_019
crossref_primary_10_1109_TCYB_2021_3107801
crossref_primary_10_1109_TCYB_2017_2752845
crossref_primary_10_1016_j_neucom_2024_128873
crossref_primary_10_1109_TCYB_2016_2598282
crossref_primary_10_1007_s00500_013_1112_9
crossref_primary_10_1016_j_automatica_2025_112168
crossref_primary_10_1016_j_ejcon_2020_03_001
crossref_primary_10_1016_j_neucom_2025_130125
crossref_primary_10_1109_TNNLS_2017_2660070
crossref_primary_10_1002_rnc_7595
crossref_primary_10_1016_j_neucom_2013_09_069
crossref_primary_10_1109_TNNLS_2013_2281663
crossref_primary_10_1109_TNNLS_2015_2453320
crossref_primary_10_1109_TNNLS_2013_2276571
crossref_primary_10_1109_TFUZZ_2014_2360954
crossref_primary_10_1109_TNNLS_2023_3243631
crossref_primary_10_1109_TNNLS_2015_2490698
crossref_primary_10_1109_TSMC_2024_3417230
crossref_primary_10_1016_j_neucom_2017_07_006
crossref_primary_10_1080_00207721_2021_1987578
crossref_primary_10_1109_TSMC_2023_3318650
crossref_primary_10_1631_jzus_C1300145
crossref_primary_10_1109_TSMC_2023_3331150
crossref_primary_10_1007_s00202_015_0355_0
crossref_primary_10_1109_TSMC_2015_2417510
crossref_primary_10_1016_j_ins_2015_04_044
crossref_primary_10_1016_j_jprocont_2021_03_003
crossref_primary_10_1109_TNNLS_2020_3017184
crossref_primary_10_1002_rnc_3181
crossref_primary_10_1016_j_neucom_2023_126502
crossref_primary_10_1016_j_isatra_2024_08_017
crossref_primary_10_1109_TSMC_2018_2814018
crossref_primary_10_1109_TSMC_2021_3113357
crossref_primary_10_1016_j_engappai_2025_110207
crossref_primary_10_1016_j_neunet_2023_07_044
crossref_primary_10_1016_j_neunet_2024_106274
crossref_primary_10_1109_TNNLS_2015_2464080
crossref_primary_10_1080_00207721_2016_1188177
crossref_primary_10_1109_TNNLS_2015_2471262
crossref_primary_10_1109_TCYB_2017_2712617
crossref_primary_10_1016_j_neunet_2014_03_008
crossref_primary_10_1016_j_jfranklin_2018_07_009
crossref_primary_10_1007_s12559_015_9350_z
crossref_primary_10_1002_rnc_5626
crossref_primary_10_1109_TIE_2014_2301770
crossref_primary_10_1109_TNNLS_2024_3379207
crossref_primary_10_1109_TASE_2014_2300532
crossref_primary_10_1007_s11432_015_5462_z
crossref_primary_10_1109_TNNLS_2015_2409301
crossref_primary_10_1109_TNNLS_2013_2271454
crossref_primary_10_1109_TNNLS_2014_2330336
crossref_primary_10_1080_00207721_2020_1831645
crossref_primary_10_1109_TNNLS_2016_2531089
crossref_primary_10_1016_j_ifacol_2018_10_175
crossref_primary_10_1016_j_neucom_2015_10_023
crossref_primary_10_1109_TCYB_2022_3232599
crossref_primary_10_1016_j_neucom_2023_126973
crossref_primary_10_1088_1674_1056_26_3_030505
crossref_primary_10_1109_TNNLS_2024_3392237
crossref_primary_10_1007_s11071_024_09840_0
crossref_primary_10_1016_j_neucom_2024_128412
crossref_primary_10_1109_TNNLS_2016_2539366
crossref_primary_10_1016_j_neunet_2025_107430
crossref_primary_10_1016_j_cie_2019_106010
crossref_primary_10_1049_cth2_12545
crossref_primary_10_1109_TNNLS_2015_2456972
crossref_primary_10_1016_j_neunet_2016_10_002
Cites_doi 10.1109/TSMCB.2008.918073
10.1109/MCI.2009.932261
10.1016/j.neucom.2008.05.012
10.1109/72.623201
10.1080/00207179108934203
10.1109/TSMCB.2010.2043839
10.1109/TSMCC.2002.801727
10.2514/3.21715
10.1016/j.automatica.2006.09.021
10.1109/TSMCB.2008.920269
10.1109/TSMCB.2008.924140
10.1109/TSMCB.2008.926607
10.1109/TSMCC.2010.2049649
10.1109/TSMCB.2008.922019
10.1109/TSMCB.2008.926614
10.1109/IJCNN.2012.6252512
10.1109/MCAS.2009.933854
10.1016/j.automatica.2011.03.005
10.1109/TNN.2005.853408
10.1109/TAC.2008.2009572
10.1016/j.automatica.2010.10.033
10.1109/TAC.2006.878720
10.1109/TNN.2010.2076370
10.1109/TNN.2003.813839
10.1109/72.914523
10.1016/j.automatica.2006.12.017
10.1109/ADPRL.2007.368180
10.7551/mitpress/4939.003.0007
10.1016/j.automatica.2004.11.034
10.1109/TSMCB.2008.923532
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2013
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2013
DBID 97E
RIA
RIE
AAYXX
CITATION
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
DOI 10.1109/TSMCB.2012.2216523
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
PubMed
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitleList Technology Research Database
Aerospace Database

PubMed
MEDLINE - Academic
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
– sequence: 3
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
EISSN 2168-2275
EndPage 789
ExternalDocumentID 2938973841
23070311
10_1109_TSMCB_2012_2216523
6328288
Genre orig-research
Research Support, Non-U.S. Gov't
Journal Article
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
NPM
RIG
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
ID FETCH-LOGICAL-c384t-ed624f2a94b27e3d19a3313f96585ce07f09278249de0cd8d5cba1aafed4f4d93
IEDL.DBID RIE
ISICitedReferencesCount 272
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000317644300030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2168-2267
2168-2275
IngestDate Wed Oct 01 13:35:45 EDT 2025
Thu Oct 02 12:02:02 EDT 2025
Sun Sep 07 03:39:17 EDT 2025
Thu Apr 03 06:57:06 EDT 2025
Tue Nov 18 22:35:49 EST 2025
Sat Nov 29 08:00:51 EST 2025
Wed Aug 27 02:03:31 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c384t-ed624f2a94b27e3d19a3313f96585ce07f09278249de0cd8d5cba1aafed4f4d93
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PMID 23070311
PQID 1324478670
PQPubID 85422
PageCount 11
ParticipantIDs proquest_miscellaneous_1729349302
proquest_journals_1324478670
crossref_citationtrail_10_1109_TSMCB_2012_2216523
proquest_miscellaneous_1349465015
pubmed_primary_23070311
ieee_primary_6328288
crossref_primary_10_1109_TSMCB_2012_2216523
PublicationCentury 2000
PublicationDate 2013-April
2013-4-00
2013-Apr
20130401
PublicationDateYYYYMMDD 2013-04-01
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-April
PublicationDecade 2010
PublicationPlace United States
PublicationPlace_xml – name: United States
– name: Piscataway
PublicationTitle IEEE transactions on cybernetics
PublicationTitleAbbrev TCYB
PublicationTitleAlternate IEEE Trans Cybern
PublicationYear 2013
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref35
ref13
haykin (ref10) 1999
ref12
ref37
ref15
ref36
ref14
ref30
ref11
ref32
werbos (ref34) 1992
ref2
ref16
watkins (ref29) 1989
ref19
beard (ref4) 1995
ref18
liu (ref17) 2008; 38
ref24
ref23
ref26
bertsekas (ref5) 1996
ref25
werbos (ref33) 1991
ref20
ref22
ref21
abu-khalaf (ref1) 2005; 41
ref28
ref27
ref8
hagan (ref9) 1996
wei (ref31) 0
ref7
ref3
ref6
References_xml – ident: ref13
  doi: 10.1109/TSMCB.2008.918073
– ident: ref28
  doi: 10.1109/MCI.2009.932261
– ident: ref32
  doi: 10.1016/j.neucom.2008.05.012
– year: 1995
  ident: ref4
  publication-title: Improving the closed-loop performance of nonlinear systems
– ident: ref22
  doi: 10.1109/72.623201
– ident: ref25
  doi: 10.1080/00207179108934203
– ident: ref14
  doi: 10.1109/TSMCB.2010.2043839
– ident: ref20
  doi: 10.1109/TSMCC.2002.801727
– ident: ref3
  doi: 10.2514/3.21715
– year: 1989
  ident: ref29
  publication-title: Learning from delayed rewards
– ident: ref6
  doi: 10.1016/j.automatica.2006.09.021
– year: 0
  ident: ref31
  article-title: A novel optimal control scheme for discrete-time nonlinear systems using iterative adaptive dynamic programming
  publication-title: IEEE Trans Autom Sci Eng
– ident: ref36
  doi: 10.1109/TSMCB.2008.920269
– year: 1999
  ident: ref10
  publication-title: Neural Networks A Comprehensive Foundation
– ident: ref8
  doi: 10.1109/TSMCB.2008.924140
– ident: ref35
  doi: 10.1109/TSMCB.2008.926607
– year: 1996
  ident: ref5
  publication-title: Neuro-Dynamic Programming
– ident: ref12
  doi: 10.1109/TSMCC.2010.2049649
– volume: 38
  start-page: 988
  year: 2008
  ident: ref17
  article-title: Adaptive critic learning techniques for engine torque and air-fuel ratio control
  publication-title: IEEE Trans Syst Man Cybern B Cybern
  doi: 10.1109/TSMCB.2008.922019
– ident: ref2
  doi: 10.1109/TSMCB.2008.926614
– ident: ref30
  doi: 10.1109/IJCNN.2012.6252512
– ident: ref15
  doi: 10.1109/MCAS.2009.933854
– year: 1992
  ident: ref34
  publication-title: Handbook of Intelligent Control Neural Fuzzy and Adaptive Approaches
– ident: ref26
  doi: 10.1016/j.automatica.2011.03.005
– ident: ref18
  doi: 10.1109/TNN.2005.853408
– year: 1996
  ident: ref9
  publication-title: Neural Network Design
– ident: ref19
  doi: 10.1109/TAC.2008.2009572
– ident: ref37
  doi: 10.1016/j.automatica.2010.10.033
– ident: ref16
  doi: 10.1109/TAC.2006.878720
– ident: ref27
  doi: 10.1109/TNN.2010.2076370
– ident: ref7
  doi: 10.1109/TNN.2003.813839
– ident: ref24
  doi: 10.1109/72.914523
– ident: ref21
  doi: 10.1016/j.automatica.2006.12.017
– ident: ref11
  doi: 10.1109/ADPRL.2007.368180
– start-page: 67
  year: 1991
  ident: ref33
  publication-title: Neural Networks for Control
  doi: 10.7551/mitpress/4939.003.0007
– volume: 41
  start-page: 779
  year: 2005
  ident: ref1
  article-title: Nearly optimal control laws for nonlinear systems with saturating actuators using a neural network HJB approach
  publication-title: Automatica
  doi: 10.1016/j.automatica.2004.11.034
– ident: ref23
  doi: 10.1109/TSMCB.2008.923532
SSID ssj0000816898
Score 2.4751756
Snippet In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite-horizon discrete-time...
SourceID proquest
pubmed
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 779
SubjectTerms Adaptive dynamic programming (ADP)
Algorithms
approximate dynamic programming
Approximation algorithms
Approximation error
Convergence
Dynamic programming
Dynamical systems
finite approximation errors
Heuristic algorithms
Iterative algorithms
Iterative methods
Mathematical analysis
Mathematical models
Neural networks
Nonlinear dynamics
Nonlinear systems
Optimal control
Optimization
Performance analysis
Performance indices
Studies
Title Finite-Approximation-Error-Based Optimal Control Approach for Discrete-Time Nonlinear Systems
URI https://ieeexplore.ieee.org/document/6328288
https://www.ncbi.nlm.nih.gov/pubmed/23070311
https://www.proquest.com/docview/1324478670
https://www.proquest.com/docview/1349465015
https://www.proquest.com/docview/1729349302
Volume 43
WOSCitedRecordID wos000317644300030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2168-2275
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816898
  issn: 2168-2267
  databaseCode: RIE
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED5tEw-8AGP8KIzJSDyAwJtju3H82JVVvFCQGFJfUOTYF6nSaFHaIv58zo4bCQkm8WbJ58TJne3vbN93AK9EZbC0IfJpmzHXlUbeCGzIlqnYhKYofEjJJsx8Xi0W9vMBvBtiYRAxXT7D81hMZ_lh7Xdxq-yiVNFBqA7h0Jiyj9Ua9lNSAomU-lZSgROqMPsYGWEvrr98nF7Gi1zyXFI9eV-RBbhnby_-WJJSjpV_w8207Mzu_1-HH8C9DC_ZpLeHYzjA1UM4zgN4w15nluk3J_Bttoxwk08iqfivZR_ByK-6bt3xS1raAvtEs8l3eti0v83OJpl-nBHOZe-XNN8Q4OYxhoTNe8IN17HMgP4Ivs6urqcfeM61wL2q9JZjKKVupbO6kQZVKKxTqlBt5IYZexSmFVYSmtA2oPChCmPfuMK5FoNudbDqMRyt1it8CswYdMYIbxTVNDF0VjvX-ApLaqq9HEGx_921z0TkMR_GTZ0cEmHrpK06aqvO2hrB26HNj56G41bpk6iLQTKrYQSne63WeaRuavLGtTZVacQIXg7VNMbiwYlb4XoXZbTVBGWL8S0y5KWQmBL0fU96ixnevze0Z3_v13O4K1OSjXgf6BSOtt0OX8Ad_3O73HRnZOyL6iwZ-28ZZvgH
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Rb9MwED6NgQQvwBiwwoAg8QACb47txvFjV1YNsRUkirQXFDm2I1ViLUpbxM_nznEjIcEk3iz5nDi5s_2d7fsO4BUvdSiMJz5tPWSqVIHVPNRoy1isfZ3nzsdkE3o6LS8vzecdeNfHwoQQ4uWzcETFeJbvl25DW2XHhSQHobwBNylzVorW6ndUYgqJmPxWYIEhrtDbKBlujmdfLsYndJVLHAmsR_-LeIA7_vb8j0UpZln5N-CMC8_k3v91-T7cTQAzG3UWsQc7YfEA9tIQXmWvE8_0m334NpkT4GQjohX_Ne9iGNlp2y5bdoKLm88-4XxyhQ8bd_fZs1EiIM8Q6Wbv5zjjIORmFEWSTTvKDdtmiQP9IXydnM7GZyxlW2BOlmrNgi-EaoQ1qhY6SJ8bK2UuG2KHGbrAdcONQDyhjA_c-dIPXW1za5vgVaO8kY9gd7FchAPItA5Wa-60xJqagmeVtbUrQ4FNlRMDyLe_u3KJipwyYnyvokvCTRW1VZG2qqStAbzt2_zoiDiuld4nXfSSSQ0DONxqtUpjdVWhP66ULgvNB_Cyr8ZRRkcndhGWG5JRRiGYzYfXyKCfgmKS4_c97iymf__W0J78vV8v4PbZ7OK8Ov8w_fgU7oiYcoNuBx3C7rrdhGdwy_1cz1ft82jyvwFRKvpo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finite-Approximation-Error-Based+Optimal+Control+Approach+for+Discrete-Time+Nonlinear+Systems&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Liu%2C+Derong&rft.au=Wei%2C+Qinglai&rft.date=2013-04-01&rft.eissn=2168-2275&rft.volume=43&rft.issue=2&rft.spage=779&rft_id=info:doi/10.1109%2FTSMCB.2012.2216523&rft_id=info%3Apmid%2F23070311&rft.externalDocID=23070311
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon