{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T23:04:29Z","timestamp":1747955069041,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Provincial Natural Science Foundation of Guangdong","doi-asserted-by":"publisher","award":["2015A030313662","2015A030308011"],"award-info":[{"award-number":["2015A030313662","2015A030308011"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Frontier and Key Technology Innovation Special Funds of Guangdong","award":["2017B090910008"],"award-info":[{"award-number":["2017B090910008"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3004229","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T20:20:52Z","timestamp":1592943652000},"page":"117203-117217","source":"Crossref","is-referenced-by-count":5,"title":["Motion Planning of Planar Closed Chains Based on Structural Sets"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5419-3229","authenticated-orcid":false,"given":"Guanfeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Trinkle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoming","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/978-3-319-29363-9_20"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1007\/978-3-642-17452-0_20"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/0196-8858(83)90014-3"},{"key":"ref11","first-page":"233","article-title":"A kinematics-based probabilistic roadmap method for closed chain systems","author":"han","year":"2001","journal-title":"Algorithmic and Computational Robotics New Directions"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1177\/0278364902021009119"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ROBOT.2004.1308757"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/10991541_23"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1017\/S0263574714001234"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.15607\/RSS.2005.I.005"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TRA.2003.814507"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1115\/1.2829426"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1155\/2009\/249349"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1115\/1.3152644"},{"year":"1986","author":"schwartz","journal-title":"Planning Geometry and Complexity of Robot Motion","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1177\/0278364917698748"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"ref6","first-page":"293","article-title":"Rapidly-exploring random trees: Progress and prospects","author":"lavalle","year":"2001","journal-title":"Algorithmic and Computational Robotics New Directions"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1115\/1.3143764"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/70.508439"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/70.976030"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/11008941_5"},{"year":"1988","author":"canny","journal-title":"The Complexity of Robot Motion Planning","key":"ref2"},{"year":"2003","author":"cortes","article-title":"Motion planning algorithms for general closed-chain mechanisms","key":"ref9"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1177\/027836498600400403"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ROBOT.2006.1641823"},{"key":"ref22","first-page":"155","article-title":"OBPRM: An obstacle-basedPRM for 3D workspaces","author":"amato","year":"1998","journal-title":"Robotics The Algorithmic Perspective"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/IROS.2007.4399305"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1177\/0278364910396389"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/ROBOT.2009.5152399"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1002\/jcc.10416"},{"key":"ref25","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"1998","journal-title":"Robotics The Algorithmic Perspective"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09123337.pdf?arnumber=9123337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:24Z","timestamp":1642003044000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9123337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3004229","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}