{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:14:25Z","timestamp":1743128065192,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030875701"},{"type":"electronic","value":"9783030875718"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87571-8_37","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:02:47Z","timestamp":1631782967000},"page":"430-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CC-BRRT: A Path Planning Algorithm Based on Central Circle Sampling Bidirectional RRT"],"prefix":"10.1007","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[]},{"given":"Menghan","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Yonglong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Yanyu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Sufang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"issue":"001","key":"37_CR1","first-page":"157","volume":"061","author":"JL Xiang","year":"2020","unstructured":"Xiang, J.L., Wang, H.D., Ou, Y.: Algorithm of local path planning for unmanned surface vehicles based on improved Bi-RRT. Ship Build. China 061(001), 157\u2013166 (2020)","journal-title":"Ship Build. China"},{"issue":"03","key":"37_CR2","first-page":"225","volume":"34","author":"WB Zhang","year":"2020","unstructured":"Zhang, W.B., Xiao, J.L.: Application of improved RRT in intelligent vehicle path planning under complicated environment. China J. Highway Transp. 34(03), 225\u2013234 (2020)","journal-title":"China J. Highway Transp."},{"issue":"10","key":"37_CR3","doi-asserted-by":"publisher","first-page":"4149","DOI":"10.1007\/s00500-015-1750-1","volume":"20","author":"A Ammar","year":"2015","unstructured":"Ammar, A., Bennaceur, H., Ch\u00e2ari, I., Koub\u00e2a, A., Alajlan, M.: Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft. Comput. 20(10), 4149\u20134171 (2015). https:\/\/doi.org\/10.1007\/s00500-015-1750-1","journal-title":"Soft. Comput."},{"issue":"08","key":"37_CR4","first-page":"1085","volume":"52","author":"DJ Wang","year":"2012","unstructured":"Wang, D.J.: Indoor mobile-robot path planning based on an improved A* algorithm. J. Tsinghua Univ. Sci. Technol. 52(08), 1085\u20131089 (2012)","journal-title":"J. Tsinghua Univ. Sci. Technol."},{"issue":"01","key":"37_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.13973\/j.cnki.robot.2017.0008","volume":"39","author":"CJ Liu","year":"2017","unstructured":"Liu, C.J., Han, J.Q., Kang, A.: Dynamic path planning based on an improved RRT algorithm for roboCup robot. Robot 39(01), 8\u201315 (2017). https:\/\/doi.org\/10.13973\/j.cnki.robot.2017.0008","journal-title":"Robot"},{"issue":"2A","key":"37_CR6","first-page":"225","volume":"38","author":"JZ Song","year":"2010","unstructured":"Song, J.Z., Dai, B., Shan, E.: An improved RRT path planning algorithm. Acta Electron. Sin. 38(2A), 225\u2013228 (2010)","journal-title":"Acta Electron. Sin."},{"issue":"08","key":"37_CR7","first-page":"1834","volume":"36","author":"JH Tan","year":"2020","unstructured":"Tan, J.H., Pan, B., et al.: Robot path planning based on improved RRT*FN algorithm. Control Dec. 36(08), 1834\u20131840 (2020)","journal-title":"Control Dec."},{"issue":"08","key":"37_CR8","first-page":"1737","volume":"37","author":"QJ Zou","year":"2020","unstructured":"Zou, Q.J., Liu, S.H., Hou, Y.P.: Rapidly-exploring random tree algorithm for path re-planning based on reinforcement learning under the peculiar environment. Control Theory Appl. 37(08), 1737\u20131748 (2020)","journal-title":"Control Theory Appl."},{"key":"37_CR9","doi-asserted-by":"publisher","unstructured":"Urmson, C., Simmons, R.: Approaches for heuristically biasing RRT\u00a0growth. In: Proceedings 2003 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2003), vol. 2, pp. 1178\u20131183 (2003). https:\/\/doi.org\/10.1109\/IROS.2003.1248805","DOI":"10.1109\/IROS.2003.1248805"},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Kuffner, J.J., LaValle, S.M.:\u00a0RRT-Connect: an efficient approach to single-query path planning. In: IEEE International Conference on Robotics and Automation, vol.2, pp. 995\u20131001(2000). https:\/\/doi.org\/10.1109\/ROBOT.2000.844730","DOI":"10.1109\/ROBOT.2000.844730"},{"issue":"4","key":"37_CR11","first-page":"30","volume":"44","author":"XL Song","year":"2017","unstructured":"Song, X.L., Zhou, N., Huang, Z.Y.: An improved RRT algorithm of local path planning for vehicle collision avoidance. J. Hunan Univ. Nat. Sci. 44(4), 30\u201337 (2017)","journal-title":"J. Hunan Univ. Nat. Sci."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. In: Robotics: Science and Systems (2010). https:\/\/arxiv.org\/abs\/1005.0416","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-30952-7_1","volume-title":"Web Information Systems and Applications","author":"M Gao","year":"2019","unstructured":"Gao, M., et al.: Online anomaly detection via incremental tensor decomposition. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 3\u201314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30952-7_1"},{"key":"37_CR14","doi-asserted-by":"publisher","unstructured":"Pareektty, N., James, F., Ravindran, B.: RRT-HX: RRT with\u00a0heuristic\u00a0extend operations for motion planning in robotic systems. In: ASME International Design Engineering Technical Conferences & Computers & Information in Engineering Conference (2016). https:\/\/doi.org\/10.1115\/DETC2016-60547","DOI":"10.1115\/DETC2016-60547"},{"key":"37_CR15","unstructured":"Liu, J.S., Ji, H.Y., Li, Y.: Robot path planning based on improved bat algorithm and cubic spline interpolation. Acta Automatica Sinica (2020)."},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"19842","DOI":"10.1109\/ACCESS.2020.2969316","volume":"8","author":"R Mashayekhi","year":"2020","unstructured":"Mashayekhi, R., Idris, M., Anisi, M., et al.: Informed RRT*-Connect: an asymptotically optimal single-query path planning method. IEEE Access 8, 19842\u201319852 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2969316","journal-title":"IEEE Access"},{"issue":"4","key":"37_CR17","first-page":"28","volume":"21","author":"XW Li","year":"2019","unstructured":"Li, X.W., Yu, H.S.: RRT robot path planning algorithm based on bidirectional growth improvement. Mod. Comput. 21(4), 28\u201331 (2019)","journal-title":"Mod. Comput."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87571-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:54:06Z","timestamp":1709834046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87571-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030875701","9783030875718"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87571-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaifeng","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wisa.org.cn\/wisa2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"206","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":"49","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":"18","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":"24% - 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":"6,5","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":"3","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)"}}]}}