{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:30:52Z","timestamp":1730255452915,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/icra.2013.6630682","type":"proceedings-article","created":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T18:11:25Z","timestamp":1382379085000},"page":"914-920","source":"Crossref","is-referenced-by-count":3,"title":["Covering space with simple robots: From chains to random trees"],"prefix":"10.1109","author":[{"given":"Asish","family":"Ghoshal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dylan A.","family":"Shell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Computational Geometry Algorithms Library","year":"0","key":"19"},{"journal-title":"Markov Chains and Mixing Times","year":"2006","author":"levin","key":"17"},{"key":"18","article-title":"Rrt-connect: An efficient approach to singlequery path planning","author":"kuffner","year":"2000","journal-title":"ICRA"},{"key":"15","first-page":"590","article-title":"Analysis of stochastic deployment policies with time delays for robot ensembles","volume":"30","author":"mather","year":"2011","journal-title":"IJRR"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980440"},{"journal-title":"A General Methodology for Mathematical Analysis of Multi-agent Systems","year":"2001","author":"lerman","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904042197"},{"key":"11","article-title":"Being there, being the RRT: Space filling and searching with minimalist robots","author":"ghoshal","year":"2011","journal-title":"AAAI Spr Symp Multirobot Systems and Physical Structures"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-2789(96)00195-9"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-011-0053-0"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0009-6"},{"key":"1","first-page":"625","article-title":"Robotic 'food' chains: Externalization of state and program for minimal-agent foraging","author":"werger","year":"1996","journal-title":"Proc Sim of Adaptive Behr"},{"journal-title":"Space-Filling Trees","year":"2009","author":"kuffner","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.509170"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012411712038"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1080\/095281397147130"},{"key":"4","article-title":"Rapidly-exploring random trees: Progress and prospects","author":"lavalle","year":"2000","journal-title":"Proc Workshop on the Algorithmic Foundations of Robotics"},{"journal-title":"Sampling-based Algorithms for Optimal Motion Planning","year":"2011","author":"karaman","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"}],"event":{"name":"2013 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2013,5,6]]},"location":"Karlsruhe, Germany","end":{"date-parts":[[2013,5,10]]}},"container-title":["2013 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6615630\/6630547\/06630682.pdf?arnumber=6630682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T19:10:09Z","timestamp":1490209809000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6630682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icra.2013.6630682","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}