{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T23:46:16Z","timestamp":1792453576233,"version":"4.5.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602074"],"award-info":[{"award-number":["61602074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3300244","type":"journal-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T17:35:18Z","timestamp":1690824918000},"page":"81378-81388","source":"Crossref","is-referenced-by-count":4,"title":["Efficient-Low Memory Path Planning Algorithm Based on Adaptive Thresholding"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8826-7479","authenticated-orcid":false,"given":"Rongli","family":"Gai","sequence":"first","affiliation":[{"name":"School of Information Engineering, Dalian University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2219-6572","authenticated-orcid":false,"given":"Xiaohong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Dalian University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8859-5919","authenticated-orcid":false,"given":"Kang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Dalian University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114541"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-022-09709-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref34","first-page":"4741","article-title":"Path planning of mobile robot based on B-RRT* FND algorithm","author":"ying","year":"2022","journal-title":"Proc Chin Automat Congr (CAC)"},{"key":"ref15","first-page":"2227","article-title":"Robotic arm path planning based on improved bidirectional RRT*","volume":"8","author":"zhou","year":"2022","journal-title":"Comput Appl"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/app112411777"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113425"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s13177-021-00281-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/s21020333"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3390\/jmse7050132"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/su142215137"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3052865"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108771"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3233\/AIS-220292"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/app10041381"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908100"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2023.02.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3023200"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3390\/jmse10101460"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3226465"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICMA.2013.6617944"},{"key":"ref22","first-page":"1834","article-title":"Robot path planning based on improved RRT* FN algorithm","volume":"36","author":"tan","year":"2020","journal-title":"Control Decis"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/agriculture12050581"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-021-03625-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/2585910"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23502"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/17298814211016609"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2968471"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.06.013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4172\/2168-9695.1000134"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2360077"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.032"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10197392.pdf?arnumber=10197392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T18:02:04Z","timestamp":1693245724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10197392\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3300244","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}