{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:58Z","timestamp":1750220338240,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"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":[[2021,11,20]]},"DOI":"10.1145\/3507623.3507631","type":"proceedings-article","created":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T22:16:54Z","timestamp":1649715414000},"page":"44-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Development of Informed Rapidly-Exploring Random Tree Focused on Memory Efficient Path Planning"],"prefix":"10.1145","author":[{"given":"Zhanhao","family":"Le","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering and Automation, Wuhan Textile University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanyi","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengyu","family":"Wang","sequence":"additional","affiliation":[{"name":"SWJTU-LEEDS Joint School, Southwest Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,11]]},"reference":[{"volume-title":"Planning Algorithms. 10.1017\/CBO9780511546877","year":"2006","unstructured":"LaValle, Steven. ( 2006 ). Planning Algorithms. 10.1017\/CBO9780511546877 . LaValle, Steven. (2006). Planning Algorithms. 10.1017\/CBO9780511546877.","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"crossref","unstructured":"P. Vadakkepat Kay Chen Tan and Wang Ming-Liang \"Evolutionary artificial potential fields and their application in real time robot path planning \" Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) 2000 pp. 256-263 vol.1 doi: 10.1109\/CEC.2000.870304.  P. Vadakkepat Kay Chen Tan and Wang Ming-Liang \"Evolutionary artificial potential fields and their application in real time robot path planning \" Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) 2000 pp. 256-263 vol.1 doi: 10.1109\/CEC.2000.870304.","key":"e_1_3_2_1_2_1","DOI":"10.1109\/CEC.2000.870304"},{"issue":"2","key":"e_1_3_2_1_3_1","first-page":"100","article-title":"A formal basis for theheuristic determination of minimum cost paths","volume":"4","author":"Hart P. E.","year":"1968","unstructured":"P. E. Hart , N. J. Nilsson , and B. Raphael , \u201c A formal basis for theheuristic determination of minimum cost paths ,\u201d TSSC , 4 ( 2 ): 100 \u2013 107 , Jul. 1968 P. E. Hart, N. J. Nilsson, and B. Raphael, \u201cA formal basis for theheuristic determination of minimum cost paths,\u201d TSSC, 4(2): 100\u2013107,Jul. 1968","journal-title":"TSSC"},{"key":"e_1_3_2_1_4_1","volume-title":"Journal of Physics: Conference Series(1), doi:10","author":"Li Yang","year":"2016","unstructured":"Yang Li ,, Dada Hu ,, Jingxin Chen & Zhiyong Tang .(2018). Research on Obstacle Avoidance Algorithm for Four-rotor UAV . Journal of Physics: Conference Series(1), doi:10 .1088\/1742-6596\/1061\/1\/01 2016 . Yang Li,,Dada Hu,,Jingxin Chen & Zhiyong Tang.(2018).Research on Obstacle Avoidance Algorithm for Four-rotor UAV. Journal of Physics: Conference Series(1), doi:10.1088\/1742-6596\/1061\/1\/012016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/ACCESS.2019.2928846"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2822013.2822036"},{"key":"e_1_3_2_1_7_1","first-page":"1416","volume-title":"A novel RRT*-based algorithm for motion planning in Dynamic environments,\" 2017 IEEE International Conference on Mechatronics and Automation (ICMA)","author":"Adiyatov O.","year":"2017","unstructured":"O. Adiyatov and H. A. Varol , \" A novel RRT*-based algorithm for motion planning in Dynamic environments,\" 2017 IEEE International Conference on Mechatronics and Automation (ICMA) , 2017 , pp. 1416 - 1421 , doi: 10.1109\/ICMA.2017.8016024. O. Adiyatov and H. A. Varol, \"A novel RRT*-based algorithm for motion planning in Dynamic environments,\" 2017 IEEE International Conference on Mechatronics and Automation (ICMA), 2017, pp. 1416-1421, doi: 10.1109\/ICMA.2017.8016024."},{"key":"e_1_3_2_1_8_1","volume-title":"Rapidly-Exploring Random Trees: Progress and Prospects. Algorithmic and computational robotics: New directions","author":"Kuffner Steven","year":"2000","unstructured":"Lavalle, Steven & Kuffner , James. ( 2000 ). Rapidly-Exploring Random Trees: Progress and Prospects. Algorithmic and computational robotics: New directions . Lavalle, Steven & Kuffner, James. (2000). Rapidly-Exploring Random Trees: Progress and Prospects. Algorithmic and computational robotics: New directions."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1177\/0278364911406761"},{"key":"e_1_3_2_1_10_1","first-page":"2640","volume-title":"Sampling heuristics for optimal motion planning in high dimensions,\" 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems","author":"Akgun B.","year":"2011","unstructured":"B. Akgun and M. Stilman , \" Sampling heuristics for optimal motion planning in high dimensions,\" 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems , 2011 , pp. 2640 - 2645 , doi: 10.1109\/IROS.2011.6095077. B. Akgun and M. Stilman, \"Sampling heuristics for optimal motion planning in high dimensions,\" 2011 IEEE\/RSJ International Conference on Intelligent Robots and Systems, 2011, pp. 2640-2645, doi: 10.1109\/IROS.2011.6095077."},{"key":"e_1_3_2_1_11_1","first-page":"354","volume-title":"Rapidly-exploring random tree based memory efficient motion planning,\" 2013 IEEE International Conference on Mechatronics and Automation","author":"Adiyatov O.","year":"2013","unstructured":"O. Adiyatov and H. A. Varol , \" Rapidly-exploring random tree based memory efficient motion planning,\" 2013 IEEE International Conference on Mechatronics and Automation , 2013 , pp. 354 - 359 , doi: 10.1109\/ICMA.2013.6617944. O. Adiyatov and H. A. Varol, \"Rapidly-exploring random tree based memory efficient motion planning,\" 2013 IEEE International Conference on Mechatronics and Automation, 2013, pp. 354-359, doi: 10.1109\/ICMA.2013.6617944."},{"doi-asserted-by":"crossref","unstructured":"Gammell J. D. Srinivasa S. S. & Barfoot T. D. (2014). Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. Paper presented at the 2997-3004. https:\/\/doi.org\/10.1109\/IROS.2014.6942976Conference Name:ACM Woodstock conference  Gammell J. D. Srinivasa S. S. & Barfoot T. D. (2014). Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. Paper presented at the 2997-3004. https:\/\/doi.org\/10.1109\/IROS.2014.6942976Conference Name:ACM Woodstock conference","key":"e_1_3_2_1_12_1","DOI":"10.1109\/IROS.2014.6942976"}],"event":{"acronym":"CIIS 2021","name":"CIIS 2021: 2021 The 4th International Conference on Computational Intelligence and Intelligent Systems","location":"Tokyo Japan"},"container-title":["2021 The 4th International Conference on Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3507623.3507631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3507623.3507631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:27Z","timestamp":1750191147000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3507623.3507631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,20]]},"references-count":12,"alternative-id":["10.1145\/3507623.3507631","10.1145\/3507623"],"URL":"https:\/\/doi.org\/10.1145\/3507623.3507631","relation":{},"subject":[],"published":{"date-parts":[[2021,11,20]]},"assertion":[{"value":"2022-04-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}