{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:22:48Z","timestamp":1771024968771,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819980789","type":"print"},{"value":"9789819980796","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8079-6_8","type":"book-chapter","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T16:02:42Z","timestamp":1699891362000},"page":"91-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["AM-RRT*: An Automatic Robot Motion Planning Algorithm Based on\u00a0RRT"],"prefix":"10.1007","author":[{"given":"Peng","family":"Chi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haipeng","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiyu","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangmiao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,14]]},"reference":[{"issue":"12","key":"8_CR1","doi-asserted-by":"publisher","first-page":"4257","DOI":"10.1017\/S0263574722000893","volume":"40","author":"B Hichri","year":"2022","unstructured":"Hichri, B., Gallala, A., Giovannini, F., Kedziora, S.: Mobile robots path planning and mobile multirobots control: a review. Robotica 40(12), 4257\u20134270 (2022)","journal-title":"Robotica"},{"issue":"12","key":"8_CR2","doi-asserted-by":"publisher","first-page":"2730","DOI":"10.3390\/s17122730","volume":"17","author":"N Tae","year":"2017","unstructured":"Tae, N., Jae, S., Young, C.: A 2.5d map-based mobile robot localization via cooperation of aerial and ground robots. Sensors 17(12), 2730 (2017)","journal-title":"Sensors"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Perez","year":"1979","unstructured":"Lozano-Perez, T., Wesley, M.: An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM 22, 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/70.88035","volume":"5","author":"O Takahashi","year":"1989","unstructured":"Takahashi, O., Schilling, R.: Motion planning in a plane using generalized voronoi diagrams. IEEE Trans. Robot. Autom. 5, 143\u2013150 (1989)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Rob. Autom. 12(4), 566\u2013580 (1996)","journal-title":"IEEE Trans. Rob. Autom."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. In: 1985 IEEE International Conference on Robotics and Automation (Cat. No. 85CH2152-7), pp. 500\u2013505 (1984)","DOI":"10.1109\/ROBOT.1985.1087247"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TSMCA.2003.812599","volume":"33","author":"J Hwang","year":"2003","unstructured":"Hwang, J., Kim, J., Lim, S., Park, K.: A fast path planning by path graph optimization. IEEE Trans. Syst. Man Cybern. Part A-Syst. Humans 33(1), 121\u2013128 (2003)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A-Syst. Humans"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kushleyev, A., Likhachev, M.: Time-bounded lattice for efficient planning in dynamic environments. In: ICRA: 2009 IEEE International Conference Robotics and Automation, vol. 1\u20137. pp. 4303\u20134309 (2009)","DOI":"10.1109\/ROBOT.2009.5152860"},{"key":"8_CR9","unstructured":"Likhachev, M., Gordon, G., Thrun, S.: Ara*: anytime a* with provable bounds on sub-optimality. In: Thrun, S., Saul, K., Scholkopf, B. (eds.) Advances in Neural Information Processing Systems, vol. 16, pp. 767\u2013774 (2004)"},{"key":"8_CR10","unstructured":"Lavalle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Research Report (1999)"},{"key":"8_CR11","unstructured":"LaValle, S., Kuffner, J.: Rapidly-exploring random trees: progress and prospects. In: Donald, B., Lynch, K., Rus, D. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 293\u2013308 (2001)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Reeds, J.A., Shepp, R.A.: Optimal paths for a car that goes both forward and backward. Pac. J. Math. 145 (1991)","DOI":"10.2140\/pjm.1990.145.367"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TRO.2013.2283928","volume":"30","author":"M Brezak","year":"2014","unstructured":"Brezak, M., Petrovic, I.: Real-time approximation of clothoids with bounded error for path planning applications. IEEE Trans. Rob. 30(2), 507\u2013515 (2014)","journal-title":"IEEE Trans. Rob."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.robot.2008.03.009","volume":"57","author":"KG Jolly","year":"2009","unstructured":"Jolly, K.G., Kumar, R.S., Vijayakumar, R.: A bezier curve based path planning in a multi-agent robot soccer system without violating the acceleration limits. Rob. Auton. Syst. 57(1), 23\u201333 (2009)","journal-title":"Rob. Auton. Syst."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Koyuncu, E., Inalhan, G.: A probabilistic b-spline motion planning algorithm for unmanned helicopters flying in dense 3d environments. In: 2008 IEEE\/RSJ International Conference on Robots and Intelligent Systems, Conference Proceedings, vol. 1\u20133, pp. 815\u2013821 (2008)","DOI":"10.1109\/IROS.2008.4651122"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"142682","DOI":"10.1109\/ACCESS.2019.2943009","volume":"7","author":"M Luo","year":"2019","unstructured":"Luo, M., Hou, X., Yang, S.X.: A multi-scale map method based on bioinspired neural network algorithm for robot path planning. IEEE Access 7, 142682\u2013142691 (2019)","journal-title":"IEEE Access"},{"issue":"6","key":"8_CR17","first-page":"713","volume":"34","author":"J Xin","year":"2019","unstructured":"Xin, J., Zhong, J., Sheng, J., Li, P., Cui, Y.: Improved genetic algorithms based on data-driven operators for path planning of unmanned surface vehicle. Int. J. Rob. Autom. 34(6), 713\u2013722 (2019)","journal-title":"Int. J. Rob. Autom."},{"issue":"6SI","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","volume":"32","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Wang, H., Zheng, Y., He, J.: Research on path planning of mobile robot based on improved ant colony algorithm. Neural Comput. Appl. 32(6SI), 1555\u20131566 (2020)","journal-title":"Neural Comput. Appl."},{"key":"8_CR19","first-page":"267","volume":"104","author":"S Karaman","year":"2010","unstructured":"Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. Rob. Sci. Syst. 104, 267\u2013274 (2010)","journal-title":"Rob. Sci. Syst."},{"key":"8_CR20","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 (IROS 2014), pp. 2997\u20133004 (2014)","DOI":"10.1109\/IROS.2014.6942976"},{"issue":"JUN.","key":"8_CR21","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","volume":"123","author":"IB Jeong","year":"2019","unstructured":"Jeong, I.B., Lee, S.J., Kim, J.H.: Quick-rrt*: triangular inequality-based implementation of rrt* with improved initial solution and convergence rate. Expert Syst. Appl. 123(JUN.), 82\u201390 (2019)","journal-title":"Expert Syst. Appl."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","volume":"68","author":"AH Qureshi","year":"2015","unstructured":"Qureshi, A.H., Ayaz, Y.: Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Rob. Auton. Syst. 68, 1\u201311 (2015)","journal-title":"Rob. Auton. Syst."},{"key":"8_CR23","unstructured":"Jordan, M., Perez, A.: Optimal bidirectional rapidly-exploring random trees (2013)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Li, Y., Wei, W., Gao, Y., Wang, D., Fan, Z.: Pq-rrt*: an improved path planning algorithm for mobile robots. Expert Syst. Appl. 152 (2020)","DOI":"10.1016\/j.eswa.2020.113425"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Shi, Y., Li, Q., Bu, S., Yang, J., Zhu, L.: Research on intelligent vehicle path planning based on rapidly-exploring random tree. Math. Prob. Eng. 2020 (2020)","DOI":"10.1155\/2020\/5910503"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TASE.2021.3050762","volume":"19","author":"C Jiang","year":"2022","unstructured":"Jiang, C., et al.: R2-rrt*: reliability-based robust mission planning of off-road autonomous ground vehicle under uncertain terrain environment. IEEE Trans. Autom. Sci. Eng. 19(2), 1030\u20131046 (2022)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Pepy, R., Lambert, A., Mounier, H.: Path planning using a dynamic vehicle model. In: 2006 2nd International Conference on Information & Communication Technologies, vol. 1, pp. 781\u2013786 (2006)","DOI":"10.1109\/ICTTA.2006.1684472"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8079-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T22:37:34Z","timestamp":1730500654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8079-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,14]]},"ISBN":["9789819980789","9789819980796"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8079-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,14]]},"assertion":[{"value":"14 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","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":"20 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2023.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1274","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":"650","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":"51% - 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":"4.14","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.46","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)"}}]}}