{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T09:54:32Z","timestamp":1779011672361,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819965007","type":"print"},{"value":"9789819965014","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-6501-4_24","type":"book-chapter","created":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T21:01:23Z","timestamp":1697144483000},"page":"279-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerated Informed RRT*: Fast and\u00a0Asymptotically Path Planning Method Combined with\u00a0RRT*-Connect and\u00a0APF"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0166-5835","authenticated-orcid":false,"given":"Zhixin","family":"Tu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3164-4204","authenticated-orcid":false,"given":"Wenbing","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4063-4545","authenticated-orcid":false,"given":"Yuquan","family":"Leng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8955-5429","authenticated-orcid":false,"given":"Chenglong","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,13]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/rob.20109","volume":"23","author":"D Ferguson","year":"2006","unstructured":"Ferguson, D., Stentz, A.: Using interpolation to improve path planning: the field D* algorithm. J. Field Robot. 23(2), 79\u2013101 (2006)","journal-title":"J. Field Robot."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Gammell, J.D., Srinivasa, S.S., Barfoot, T.D.: Informed RRT: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 2997\u20133004. IEEE (2014)","DOI":"10.1109\/IROS.2014.6942976"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Gasparetto, A., Boscariol, P., Lanzutti, A., Vidoni, R.: Path planning and trajectory planning algorithms: a general overview. In: Motion and Operation Planning of Robotic Systems: Background and Practical Approaches, pp. 3\u201327 (2015)","DOI":"10.1007\/978-3-319-14705-5_1"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.3390\/s21020333","volume":"21","author":"JG Kang","year":"2021","unstructured":"Kang, J.G., Lim, D.W., Choi, Y.S., Jang, W.J., Jung, J.W.: Improved RRT-connect algorithm based on triangular inequality for robot path planning. Sensors 21(2), 333 (2021)","journal-title":"Sensors"},{"issue":"7","key":"24_CR5","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11370-017-0242-9","volume":"11","author":"MC Kim","year":"2018","unstructured":"Kim, M.C., Song, J.B.: Informed RRT* with improved converging rate by adopting wrapping procedure. Intel. Serv. Robot. 11, 53\u201360 (2018)","journal-title":"Intel. Serv. Robot."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065), vol. 2, pp. 995\u20131001. IEEE (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Lee, M.C., Park, M.G.: Artificial potential field based path planning for mobile robots using a virtual obstacle concept. In: Proceedings 2003 IEEE\/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003), vol. 2, pp. 735\u2013740. IEEE (2003)","DOI":"10.1109\/AIM.2003.1225434"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Solovey, K., Janson, L., Schmerling, E., Frazzoli, E., Pavone, M.: Revisiting the asymptotic optimality of RRT. In: 2020 IEEE International Conference on Robotics and Automation (ICRA), pp. 2189\u20132195. IEEE (2020)","DOI":"10.1109\/ICRA40945.2020.9196553"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1109\/TASE.2020.2976560","volume":"17","author":"J Wang","year":"2020","unstructured":"Wang, J., Chi, W., Li, C., Wang, C., Meng, M.Q.H.: Neural RRT*: learning-based optimal path planning. IEEE Trans. Autom. Sci. Eng. 17(4), 1748\u20131758 (2020). https:\/\/doi.org\/10.1109\/TASE.2020.2976560","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Warren, C.W.: Fast path planning using modified A* method. In: [1993] Proceedings IEEE International Conference on Robotics and Automation, pp. 662\u2013667. IEEE (1993)","DOI":"10.1109\/ROBOT.1993.291883"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Xinggang, W., Cong, G., Yibo, L.: Variable probability based bidirectional RRT algorithm for UAV path planning. In: The 26th Chinese control and decision conference (2014 CCDC), pp. 2217\u20132222. IEEE (2014)","DOI":"10.1109\/CCDC.2014.6852537"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"95046","DOI":"10.1109\/ACCESS.2019.2928846","volume":"7","author":"W Xinyu","year":"2019","unstructured":"Xinyu, W., Xiaojuan, L., Yong, G., Jiadong, S., Rui, W.: Bidirectional potential guided RRT* for motion planning. IEEE Access 7, 95046\u201395057 (2019)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Intelligent Robotics and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-6501-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:17:45Z","timestamp":1730315865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-6501-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819965007","9789819965014"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-6501-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Robotics and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icira2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icira2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"630","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"431","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}