{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:21:27Z","timestamp":1725387687946},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/iros.2011.6094479","type":"proceedings-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T21:46:42Z","timestamp":1323208002000},"page":"2620-2625","source":"Crossref","is-referenced-by-count":0,"title":["An obstacle-responsive technique for the management and distribution of local rapidly-exploring random trees"],"prefix":"10.1109","author":[{"given":"N. A.","family":"Wedge","sequence":"first","affiliation":[]},{"given":"M. S.","family":"Branicky","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1545607"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5979804"},{"key":"ref6","first-page":"98","article-title":"Rapidly-exploring Random Trees: A New Tool for Path Planning","author":"lavalle","year":"1998","journal-title":"Comput Sci Dept Iowa State Univ"},{"journal-title":"Texas A&M Univ Algorithms & Applications Group Motion Planning Puzzles","article-title":"Alpha Puzzle\/Flange","year":"2000","author":"yamrom","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570709"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROMOCO.2004.240739"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045481"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.772447"},{"article-title":"Sampling-based Motion Planning Algorithms: Analysis and Development","year":"2011","author":"wedge","key":"ref9"},{"first-page":"80","article-title":"Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps","year":"2003","author":"akinc","key":"ref1"}],"event":{"name":"2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2011)","start":{"date-parts":[[2011,9,25]]},"location":"San Francisco, CA","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6034548\/6094399\/06094479.pdf?arnumber=6094479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T08:09:22Z","timestamp":1490083762000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6094479\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":12,"URL":"http:\/\/dx.doi.org\/10.1109\/iros.2011.6094479","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}
