{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:40Z","timestamp":1750306120026,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,20]],"date-time":"2017-01-20T00:00:00Z","timestamp":1484870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,20]]},"DOI":"10.1145\/3036331.3036358","type":"proceedings-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T12:50:05Z","timestamp":1496667005000},"page":"19-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Experimental Study of Parameters for Rapidly-exploring Random Tree Algorithm"],"prefix":"10.1145","author":[{"given":"Li","family":"Meng","sequence":"first","affiliation":[{"name":"School of electrical engineering, University of Jinan, Jinan, Shandong, China"}]},{"given":"Song","family":"Qing","sequence":"additional","affiliation":[{"name":"School of electrical engineering, University of Jinan, Jinan, Shandong, China"}]},{"given":"Zhao Qin","family":"Jun","sequence":"additional","affiliation":[{"name":"School of electrical engineering, University of Jinan, Jinan, Shandong, China"}]}],"member":"320","published-online":{"date-parts":[[2017,1,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"LaValle S. M. 1998. Rapidly-exploring random trees:A new tool for path planning. Technical Report. Computer Science Dept Iowa State University.  LaValle S. M. 1998. Rapidly-exploring random trees:A new tool for path planning. Technical Report. Computer Science Dept Iowa State University."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"LaValle S. M. 2006. Planning Algorithms.: Cambridge Univ.Press. Cambridge U.K.   LaValle S. M. 2006. Planning Algorithms.: Cambridge Univ.Press. Cambridge U.K.","DOI":"10.1017\/CBO9780511546877"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-011-9619-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Mo H. Xu L. 2015. Research of biogeography particle swarm optimization for robot path planning. Neuro computing vol. 148 (Jan. 2015) 91--99.  Mo H. Xu L. 2015. Research of biogeography particle swarm optimization for robot path planning. Neuro computing vol. 148 (Jan. 2015) 91--99.","DOI":"10.1016\/j.neucom.2012.07.060"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-009-9365-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2345351"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2477355"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Kim B. Um T. T. Suh C. Park F. C. 2016. Tangent bundle RRT: A randomized algorithm for constrained motion planning. Robotica 34 01 (Jan. 2015) 202--225.  Kim B. Um T. T. Suh C. Park F. C. 2016. Tangent bundle RRT: A randomized algorithm for constrained motion planning. Robotica 34 01 (Jan. 2015) 202--225.","DOI":"10.1017\/S0263574714001234"}],"event":{"name":"ICCMS '17: 8th International Conference on Computer Modeling and Simulation","sponsor":["Central Queensland University","University of Canberra University of Canberra"],"location":"Canberra Australia","acronym":"ICCMS '17"},"container-title":["Proceedings of the 8th International Conference on Computer Modeling and Simulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3036331.3036358","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3036331.3036358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:43Z","timestamp":1750217803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3036331.3036358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,20]]},"references-count":8,"alternative-id":["10.1145\/3036331.3036358","10.1145\/3036331"],"URL":"https:\/\/doi.org\/10.1145\/3036331.3036358","relation":{},"subject":[],"published":{"date-parts":[[2017,1,20]]},"assertion":[{"value":"2017-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}