{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:40:03Z","timestamp":1755877203243,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:00:00Z","timestamp":1711065600000},"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":[[2024,3,22]]},"DOI":"10.1145\/3654823.3654880","type":"proceedings-article","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T16:20:33Z","timestamp":1716999633000},"page":"309-314","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["BTR-RRT*: Biased Towards Path Reference Points Path Planning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0535-5102","authenticated-orcid":false,"given":"Julong","family":"Gu","sequence":"first","affiliation":[{"name":"China Communications First Highway Engineering Fifth Engineering Co., Ltd, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7646-7944","authenticated-orcid":false,"given":"Lingyue","family":"Xu","sequence":"additional","affiliation":[{"name":"China Communications First Highway Engineering Fifth Engineering Co., Ltd, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4852-1393","authenticated-orcid":false,"given":"Wu","family":"Liu","sequence":"additional","affiliation":[{"name":"China Communications First Highway Engineering Fifth Engineering Co., Ltd, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5985-1773","authenticated-orcid":false,"given":"Xing","family":"Huang","sequence":"additional","affiliation":[{"name":"CCCC Jianshi Digital Technology (Suzhou) Co. Ltd, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2731-6584","authenticated-orcid":false,"given":"Kuo","family":"Li","sequence":"additional","affiliation":[{"name":"Jilin University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30301-5"},{"key":"e_1_3_2_1_2_1","first-page":"287","volume-title":"His Life, Work, and Legacy","author":"Dijkstra E. W.","year":"2022","unstructured":"E. W. Dijkstra, \"A note on two problems in connexion with graphs,\" Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287-290, 2022."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.838026"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"volume-title":"The international journal of robotics research","author":"LaValle S. M.","key":"e_1_3_2_1_6_1","unstructured":"S. M. LaValle, and J. J. Kuffner Jr, \u201cRandomized kinodynamic planning,\u201d The international journal of robotics research, vol. 20, no. 5, pp. 378-400, 2001."},{"volume-title":"Ant colony optimization","author":"Dorigo M.","key":"e_1_3_2_1_7_1","unstructured":"M. Dorigo, M. Birattari, and T. Stutzle, \u201cAnt colony optimization,\u201d IEEE computational intelligence magazine, vol. 1, no. 4, pp. 28-39, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93025-1_4"},{"key":"e_1_3_2_1_9_1","first-page":"1942","volume-title":"Particle swarm optimization","author":"Kennedy J.","unstructured":"J. Kennedy, and R. Eberhart, \"Particle swarm optimization.\" pp. 1942-1948."},{"issue":"2","key":"e_1_3_2_1_10_1","first-page":"267","article-title":"Incremental sampling-based algorithms for optimal motion planning","volume":"104","author":"Karaman S.","year":"2010","unstructured":"S. Karaman, and E. Frazzoli, \u201cIncremental sampling-based algorithms for optimal motion planning,\u201d Robotics Science and Systems VI, vol. 104, no. 2, pp. 267-274, 2010.","journal-title":"Robotics Science and Systems VI"},{"key":"e_1_3_2_1_11_1","first-page":"2997","volume-title":"Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"Gammell J. D.","unstructured":"J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, \"Informed RRT: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic.\" pp. 2997-3004."},{"key":"e_1_3_2_1_12_1","first-page":"995","volume-title":"An efficient approach to single-query path planning","author":"Kuffner J. J.","unstructured":"J. J. Kuffner, and S. M. LaValle, \"RRT-connect: An efficient approach to single-query path planning.\" pp. 995-1001 vol.2."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969316"},{"issue":"08","key":"e_1_3_2_1_14_1","first-page":"127","article-title":"RRT intelligent vehicle path planning algorithm based on a* guided domain","volume":"26","author":"Feng L.","year":"2017","unstructured":"L. Feng, H. Liang, and M. Du, \u201cRRT intelligent vehicle path planning algorithm based on a* guided domain,\u201d Computer Systems & Applications, vol. 26, no. 08, pp. 127-133, 2017.","journal-title":"Computer Systems & Applications"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2021.3063273"},{"key":"e_1_3_2_1_17_1","first-page":"961","volume-title":"Improved RRT* path planning algorithm based on artificial potential field method","author":"Chen H.","unstructured":"H. Chen, P. Dou, Z. Wang, and H. Zhang, \"Improved RRT* path planning algorithm based on artificial potential field method.\" pp. 961-965."}],"event":{"name":"CACML 2024: 2024 3rd Asia Conference on Algorithms, Computing and Machine Learning","acronym":"CACML 2024","location":"Shanghai China"},"container-title":["Proceedings of the 2024 3rd Asia Conference on Algorithms, Computing and Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654823.3654880","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654823.3654880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:17:49Z","timestamp":1755875869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654823.3654880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,22]]},"references-count":17,"alternative-id":["10.1145\/3654823.3654880","10.1145\/3654823"],"URL":"https:\/\/doi.org\/10.1145\/3654823.3654880","relation":{},"subject":[],"published":{"date-parts":[[2024,3,22]]},"assertion":[{"value":"2024-05-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}