{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:07:08Z","timestamp":1760710028453,"version":"3.37.3"},"reference-count":41,"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":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP150100935"],"award-info":[{"award-number":["LP150100935"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Roads and Maritime Services of NSW"},{"DOI":"10.13039\/501100001775","name":"University of Technology Sydney","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001775","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2948976","type":"journal-article","created":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T19:55:02Z","timestamp":1571774102000},"page":"153921-153935","source":"Crossref","is-referenced-by-count":6,"title":["A Scalable Sampling-Based Optimal Path Planning Approach via Search Space Reduction"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1677-3633","authenticated-orcid":false,"given":"Wenjie","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dikai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908090961"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref33","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794429"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-018-0102-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref37","article-title":"Learning finite state representations of recurrent policy networks","author":"koul","year":"2018","journal-title":"arXiv 1811 12530"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-018-1101-7"},{"key":"ref35","first-page":"4055","article-title":"Successor features for transfer in reinforcement learning","author":"barreto","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.701"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225177"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.605"},{"key":"ref11","article-title":"Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning","author":"kleinbort","year":"2016","journal-title":"arXiv 1607 04800"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308890"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2002.1176371"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916640908"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353652"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2013.2240176"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844795"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ASCC.2013.6606360"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2008.921540"},{"key":"ref27","first-page":"307","article-title":"FPNN: Field probing neural networks for 3D data","author":"li","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"76","article-title":"Visibility-based motion planning for active target tracking and localization","author":"wei","year":"2014","journal-title":"Proc IROS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00387"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717137"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref7","first-page":"2997","article-title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"gammell","year":"2014","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630809"},{"key":"ref9","first-page":"1","article-title":"Bidirectional fast marching trees: An optimal sampling-based algorithm for bidirectional motion planning","author":"starek","year":"2014","journal-title":"Proc Workshop Algorithmic Found Robot"},{"key":"ref1","first-page":"139","article-title":"Trajectory design for autonomous underwater vehicles for basin exploration","author":"chyba","year":"2010","journal-title":"Proc 9th Int Conf Comput IT Appl Maritime Industries"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.853485"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1013372"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46466-4_29"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2901308"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631230"},{"key":"ref26","article-title":"Generative and discriminative voxel modeling with convolutional neural networks","author":"brock","year":"2016","journal-title":"arXiv 1608 04236"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08879518.pdf?arnumber=8879518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:39:53Z","timestamp":1628624393000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8879518\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2948976","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}