{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T01:40:55Z","timestamp":1777945255189,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306186"],"award-info":[{"award-number":["62306186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62471319"],"award-info":[{"award-number":["62471319"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007620","name":"Department of Education of Liaoning Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007620","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["2024-BSLH-174"],"award-info":[{"award-number":["2024-BSLH-174"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Robotics and Autonomous Systems"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.robot.2026.105462","type":"journal-article","created":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T07:00:24Z","timestamp":1774767624000},"page":"105462","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An asymptotically optimal sampling-based method for high-dimensional complex motion planning using novel efficient heuristics"],"prefix":"10.1016","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6257-8770","authenticated-orcid":false,"given":"Jing","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengxuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boneng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jichi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.robot.2026.105462_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112569","article-title":"Learning to construct a solution for UAV path planning problem with positioning error correction","volume":"304","author":"Chun","year":"2024","journal-title":"Knowl.-Based Syst."},{"issue":"5","key":"10.1016\/j.robot.2026.105462_bib0002","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1002\/rob.21894","article-title":"Sampling-based hierarchical motion planning for a reconfigurable wheel-on-leg planetary analogue exploration rover","volume":"37","author":"Reid","year":"2020","journal-title":"J. Field Robot."},{"key":"10.1016\/j.robot.2026.105462_bib0003","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.isatra.2023.10.019","article-title":"Autonomous ship navigation with an enhanced safety collision avoidance technique","volume":"144","author":"Ali","year":"2024","journal-title":"ISA trans."},{"key":"10.1016\/j.robot.2026.105462_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119423","article-title":"Humanoid robot path planning using memory-based gravity search algorithm and enhanced differential evolution approach in a complex environment","volume":"215","author":"Vikas","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.robot.2026.105462_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.mechatronics.2023.102969","article-title":"Kinodynamic optimal trajectories generation in cluttered environments using Bernstein polynomials","volume":"92","author":"Strano","year":"2023","journal-title":"Mechatronics"},{"key":"10.1016\/j.robot.2026.105462_bib0006","series-title":"2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems","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"},{"issue":"5","key":"10.1016\/j.robot.2026.105462_bib0007","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1177\/02783640122067453","article-title":"Randomized kinodynamic planning","volume":"20","author":"LaValle","year":"2001","journal-title":"Int. J. Robot. Res."},{"issue":"7","key":"10.1016\/j.robot.2026.105462_bib0008","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"issue":"7","key":"10.1016\/j.robot.2026.105462_bib0009","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1177\/0278364915577958","article-title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions","volume":"34","author":"Janson","year":"2015","journal-title":"Int. J. Robot. Res."},{"key":"10.1016\/j.robot.2026.105462_bib0010","series-title":"2015 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","first-page":"2072","article-title":"An asymptotically-optimal sampling-based algorithm for Bi-directional motion planning","author":"Starek","year":"2015"},{"key":"10.1016\/j.robot.2026.105462_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116751","article-title":"Decoding driving states based on normalized mutual information features and hyperparameter self-optimized gaussian kernel-based radial basis function extreme learning machine[J]","volume":"199","author":"Chen","year":"2025","journal-title":"Chaos Solit. Fractals"},{"issue":"7","key":"10.1016\/j.robot.2026.105462_bib0012","doi-asserted-by":"crossref","first-page":"299","DOI":"10.5772\/56718","article-title":"RRT*-SMART: A rapid convergence implementation of RRT*","volume":"10","author":"Nasir","year":"2013","journal-title":"Int. J. Adv. Robot. Syst."},{"issue":"4","key":"10.1016\/j.robot.2026.105462_bib0013","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1109\/TRO.2018.2830331","article-title":"Informed sampling for asymptotically optimal path planning","volume":"34","author":"Gammell","year":"2018","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.robot.2026.105462_bib0014","doi-asserted-by":"crossref","first-page":"3214","DOI":"10.1109\/LRA.2025.3540627","article-title":"Asymptotically optimal path planning with an approximation of the omniscient set","volume":"10","author":"K\u0159\u00ed\u017e","year":"2025","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10.1016\/j.robot.2026.105462_bib0015","series-title":"2014 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"2519","article-title":"Cloud RRT\u2217: sampling Cloud based RRT\u2217","author":"Kim","year":"2014"},{"key":"10.1016\/j.robot.2026.105462_bib0016","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","article-title":"Quick-RRT*: triangular inequality-based implementation of RRT* with improved initial solution and convergence rate","author":"Jeong","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.robot.2026.105462_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115457","article-title":"F-RRT*: an improved path planning algorithm with improved initial solution and convergence rate","volume":"184","author":"Liao","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.robot.2026.105462_bib0018","series-title":"2021 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"10093","article-title":"AM-RRT*: informed sampling-based planning with assisting metric","author":"Armstrong","year":"2021"},{"key":"10.1016\/j.robot.2026.105462_bib0019","series-title":"2015 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"2951","article-title":"Lazy collision checking in asymptotically-optimal motion planning","author":"Hauser","year":"2015"},{"issue":"6","key":"10.1016\/j.robot.2026.105462_bib0020","doi-asserted-by":"crossref","first-page":"5068","DOI":"10.1109\/TIE.2020.2992978","article-title":"Informed anytime fast marching tree for asymptotically optimal motion planning","volume":"68","author":"Xu","year":"2021","journal-title":"IEEE Trans. Ind. Electron."},{"key":"10.1016\/j.robot.2026.105462_bib0021","series-title":"2015 IEEE International Conference on Robotics and Biomimetics (ROBIO 2015)","first-page":"1670","article-title":"RRT*-Connect: faster, asymptotically optimal motion planning","author":"Klemm","year":"2015"},{"key":"10.1016\/j.robot.2026.105462_bib0022","series-title":"2015 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"3067","article-title":"Batch informed trees (BIT*): sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","author":"Gammell","year":"2015"},{"key":"10.1016\/j.robot.2026.105462_bib0023","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TIV.2022.3150748","article-title":"GMR-RRT*: sampling-based path planning using gaussian mixture regression","volume":"7","author":"Wang","year":"2022","journal-title":"IEEE Trans. Intell. Veh."},{"key":"10.1016\/j.robot.2026.105462_bib0024","series-title":"2020 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"3191","article-title":"Adaptively informed trees (AIT*): fast asymptotically optimal path planning through adaptive heuristics","author":"Strub","year":"2020"},{"key":"10.1016\/j.robot.2026.105462_bib0025","doi-asserted-by":"crossref","first-page":"3636","DOI":"10.1109\/TRO.2022.3181947","article-title":"Bidirectional sampling-based motion planning without two-point boundary value solution","volume":"38","author":"Nayak","year":"2022","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.robot.2026.105462_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.114097","article-title":"Driver fatigue detection using EEG-based graph attention convolutional neural networks: an end-to-end learning approach with mutual information-driven connectivity","volume":"186","author":"Chen","year":"2026","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.robot.2026.105462_bib0027","series-title":"2015 IEEE International Conference on Robotics and Automation (ICRA)","first-page":"4167","article-title":"Asymptotically-optimal motion planning using lower bounds on cost","author":"Salzman","year":"2015"},{"key":"10.1016\/j.robot.2026.105462_bib0028","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1146\/annurev-control-061623-094742","article-title":"Sampling-based motion planning: A comparative review","volume":"7","author":"Orthey","year":"2023","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"4","key":"10.1016\/j.robot.2026.105462_bib0029","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The Open Motion Planning Library","volume":"19","author":"Sucan","year":"2012","journal-title":"IEEE Robot. Autom. Mag."}],"container-title":["Robotics and Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0921889026001351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0921889026001351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:38:28Z","timestamp":1777718308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0921889026001351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":29,"alternative-id":["S0921889026001351"],"URL":"https:\/\/doi.org\/10.1016\/j.robot.2026.105462","relation":{},"ISSN":["0921-8890"],"issn-type":[{"value":"0921-8890","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An asymptotically optimal sampling-based method for high-dimensional complex motion planning using novel efficient heuristics","name":"articletitle","label":"Article Title"},{"value":"Robotics and Autonomous Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.robot.2026.105462","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105462"}}