{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:10:28Z","timestamp":1769217028293,"version":"3.49.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1109\/iecon49645.2022.9968798","type":"proceedings-article","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T18:45:34Z","timestamp":1670611534000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Obstacle Based Fast Marching Tree for Global Motion Planning"],"prefix":"10.1109","author":[{"given":"Jiale","family":"Hou","sequence":"first","affiliation":[{"name":"Zhejiang University,Polytechnic Institute,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhitao","family":"Liu","sequence":"additional","affiliation":[{"name":"Zhejiang University,Institute of Cyber-Systems and Control,State Key Laboratory of Industrial, Control Technology,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongye","family":"Su","sequence":"additional","affiliation":[{"name":"Zhejiang University,Institute of Cyber-Systems and Control,State Key Laboratory of Industrial, Control Technology,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.770022"},{"key":"ref12","article-title":"Rapidly-exploring random trees : a new tool for path planning","author":"lavalle","year":"1998","journal-title":"annual research report"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2016.7866392"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref15","first-page":"995","article-title":"RRT-connect: An efficient approach to single-query path planning","volume":"2","author":"kuffner","year":"2000","journal-title":"Proceedings 2000 ICRA Millennium Conference IEEE International Conference on Robotics and Automation Symposia Proceedings (Cat No 00CH37065)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28872-7_38"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353652"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2987397"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2498841"},{"key":"ref8","article-title":"Theta*: Any-Angle Path Planning on Grids","author":"nash","year":"2007","journal-title":"AAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908100"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11893004_70"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2019.2962425"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2992978"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"}],"event":{"name":"IECON 2022 \u2013 48th Annual Conference of the IEEE Industrial Electronics Society","location":"Brussels, Belgium","start":{"date-parts":[[2022,10,17]]},"end":{"date-parts":[[2022,10,20]]}},"container-title":["IECON 2022 \u2013 48th Annual Conference of the IEEE Industrial Electronics Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9968313\/9968303\/09968798.pdf?arnumber=9968798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:38:07Z","timestamp":1672083487000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9968798\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/iecon49645.2022.9968798","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]}}}