{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:21:32Z","timestamp":1765545692252,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/icra.2011.5979540","type":"proceedings-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T19:26:17Z","timestamp":1313522777000},"page":"5602-5607","source":"Crossref","is-referenced-by-count":20,"title":["Minimising computational complexity of the RRT algorithm a practical approach"],"prefix":"10.1109","author":[{"given":"Mikael","family":"Svenstrup","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Bak","sequence":"additional","affiliation":[]},{"given":"Hans Jorgen","family":"Andersen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.886840"},{"key":"15","article-title":"Kd-tree for matlab","author":"tagliasacchi","year":"0","journal-title":"MATLAB Central File Exchange"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5651531"},{"key":"13","first-page":"280","article-title":"Approximate nearest neighbor queries in fixed dimensions","author":"arya","year":"1993","journal-title":"Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282100"},{"journal-title":"Algorithms in C","year":"1990","author":"sedgewick","key":"11"},{"journal-title":"Principles of Robot Motion Theory Algorithms and Implementations (Intelligent Robotics and Autonomous Agents)","year":"2005","author":"choset","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4651075"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2009.V.003","article-title":"Lqr-trees: Feedback motion planning on sparse randomized trees","author":"tedrake","year":"2009","journal-title":"Proceedings of Robotics Science and Systems"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152874"},{"key":"5","first-page":"365","article-title":"Motion planning for humanoid robots","volume":"15","author":"kuffner","year":"2005","journal-title":"Robotics Research"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363166"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00022-5"},{"key":"8","article-title":"Incremental sampling-based algorithms for optimal motion planning","author":"karaman","year":"2010","journal-title":"Proceedings of Robotics Science and Systems"}],"event":{"name":"2011 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2011,5,9]]},"location":"Shanghai, China","end":{"date-parts":[[2011,5,13]]}},"container-title":["2011 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5967842\/5979525\/05979540.pdf?arnumber=5979540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T03:17:36Z","timestamp":1560482256000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5979540\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icra.2011.5979540","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}