{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T06:12:34Z","timestamp":1768543954081,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Key Research and Development Program of China for \u201cNew Energy Automobile\u201d"},{"name":"Key Technology Research and Demonstration Operation of Electric Autonomous Vehicle Project","award":["2017YFB0102603"],"award-info":[{"award-number":["2017YFB0102603"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2939161","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T19:22:48Z","timestamp":1567538568000},"page":"126077-126087","source":"Crossref","is-referenced-by-count":3,"title":["An Approximate Quadratic Programming for Efficient Bellman Equation Solution"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7901-6835","authenticated-orcid":false,"given":"Jianmei","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongliang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhinan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.05.036"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2734043"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1115\/1.4035871"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1200"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.875977"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/11847250_22","article-title":"Random separation: A new method for solving fixed-cardinality optimization problems","author":"cai","year":"2006","journal-title":"Proc Int Workshop Parameterized Exact Comput"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GrC.2013.6740370"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01042"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00113"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2003.11.006"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.256500"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00892"},{"key":"ref2","article-title":"Playing atari with deep reinforcement learning","author":"mnih","year":"2013","journal-title":"arXiv 1312 5602"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.376"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2015.06.002"},{"key":"ref22","article-title":"Large-scale Markov decision problems via the linear programming dual","author":"abbasi-yadkori","year":"2019","journal-title":"arXiv 1901 01992"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553478"},{"key":"ref24","first-page":"459","article-title":"A smoothed approximate linear program","author":"desai","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1000"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551274"},{"key":"ref25","first-page":"386","article-title":"Non-parametric approximate dynamic programming via the kernel method","author":"bhat","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst Conf"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.02.032"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1063\/1.5065373"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2017.05.031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S1874-1029(13)60031-2"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706969"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2417170"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(85)90317-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1044"},{"key":"ref17","author":"farias","year":"2002","journal-title":"The linear programming approach to approximate dynamic programming Theory and application"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0094"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743163"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2013.06.011"},{"key":"ref3","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0152099"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.02.002"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1109\/TNN.2011.2146788","article-title":"Adaptive neural output feedback tracking control for a class of uncertain discrete-time nonlinear systems","volume":"22","author":"liu","year":"2011","journal-title":"IEEE Trans Neural Netw"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2332305"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.1993"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2523935"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401383558"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0516"},{"key":"ref48","first-page":"3027","article-title":"Robust approximate bilinear programming for value function approximation","volume":"12","author":"petrik","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SIEDS.2006.278719"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009739827008"},{"key":"ref41","author":"petrik","year":"2010","journal-title":"Optimization-based approximate dynamic programming"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref43","author":"mitchell","year":"2003","journal-title":"Machine Learning"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08822946.pdf?arnumber=8822946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T09:47:30Z","timestamp":1643276850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8822946\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2939161","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}