{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:01:37Z","timestamp":1780074097145,"version":"3.54.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Preresearch Project","award":["41412040101"],"award-info":[{"award-number":["41412040101"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tii.2019.2918589","type":"journal-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T20:52:23Z","timestamp":1558644743000},"page":"949-958","source":"Crossref","is-referenced-by-count":20,"title":["ReinforcedRimJump: Tangent-Based Shortest-Path Planning for Two-Dimensional Maps"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7532-4200","authenticated-orcid":false,"given":"Zhuo","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6632-0144","authenticated-orcid":false,"given":"Weimin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongliang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingzhu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenshuo","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5269-4161","authenticated-orcid":false,"given":"Qiang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.889486"},{"key":"ref10","first-page":"735","article-title":"Artificial potential field based path planning for mobile robots using a virtual obstacle concept","volume":"2","author":"min","year":"0","journal-title":"Proc IEEE\/ASME Int Conf Adv Intell Mechatronics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3080845.3080879"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRAE.2017.8291354"},{"key":"ref13","article-title":"Stochastic functional gradient path planning in occupancy maps","author":"francis","year":"2017","journal-title":"arxiv 1705 05987"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SICE.2002.1195739"},{"key":"ref15","first-page":"1221","article-title":"Genetic algorithm based path planning for a mobile robot","volume":"1","author":"tu","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2011.2109332"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2014.2316638"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1108\/AA-11-2015-094"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574718001236"},{"key":"ref4","first-page":"201","article-title":"Any-angle path planning for computer games","author":"yap","year":"0","journal-title":"Proc Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1991.131594"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-82044-0.50085-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5419-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.06.013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.04.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2004.1367681"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2007.352683"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SIBCON.2017.7998564"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.07.010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAIRO.2017.64"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1109\/70.338536","article-title":"Computation of the tangent graph of polygonal obstacles by moving-line processing","volume":"10","author":"liu","year":"1994","journal-title":"IEEE Trans Robot Autom"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1177\/027836499201100409"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/8963774\/08721088.pdf?arnumber=8721088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:58:02Z","timestamp":1651078682000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8721088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tii.2019.2918589","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}