{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T14:58:43Z","timestamp":1782313123874,"version":"3.54.5"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong Research Grants Council (RGC) General Research Fund","award":["C4063-18G"],"award-info":[{"award-number":["C4063-18G"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62103181"],"award-info":[{"award-number":["62103181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tase.2022.3215562","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T22:41:17Z","timestamp":1667515277000},"page":"135-146","source":"Crossref","is-referenced-by-count":41,"title":["NR-RRT: Neural Risk-Aware Near-Optimal Path Planning in Uncertain Nonconvex Environments"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9225-040X","authenticated-orcid":false,"given":"Fei","family":"Meng","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, The Chinese University of Hong Kong, New Territories, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9594-640X","authenticated-orcid":false,"given":"Liangliang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1960-5432","authenticated-orcid":false,"given":"Han","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, The Chinese University of Hong Kong, New Territories, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0291","authenticated-orcid":false,"given":"Jiankun","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electronic and Electrical Engineering, Shenzhen Key Laboratory of Robotics Perception and Intelligence, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5255-5898","authenticated-orcid":false,"given":"Max Q.-H.","family":"Meng","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, The Chinese University of Hong Kong, New Territories, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683744"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2878996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref4","volume-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2021.XVII.069"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918778338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-8160"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913501564"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812343"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2019.xv.056"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3006716"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2022.3152740"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60916-4_20"},{"key":"ref18","article-title":"Chance-constrained optimization with tight confidence bounds","author":"Cannon","year":"2017","journal-title":"arXiv:1711.03747"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2161160"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CASE49439.2021.9551655"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2517124"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2380273"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406562"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094802"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69259-1_6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912456319"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1177\/0278364920937074"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2021.xvii.041"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2002.1023918"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593893"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1049\/csy2.12020"},{"key":"ref32","first-page":"4732","article-title":"Universal planning networks: Learning generalizable representations for visuomotor control","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Srinivas"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/700"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461096"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196785"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636201"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560962"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460730"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2901898"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3191519"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004275"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.169"},{"key":"ref43","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref44","volume-title":"Spotless Polynomial and Conic Optimization","author":"Tobenkin","year":"2013"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509683"},{"key":"ref46","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915614386"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/10381526\/09928264.pdf?arnumber=9928264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T18:57:37Z","timestamp":1726599457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9928264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":47,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2022.3215562","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}