{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:05:31Z","timestamp":1745035531896,"version":"3.40.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031845420","type":"print"},{"value":"9783031845437","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-84543-7_26","type":"book-chapter","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:53:39Z","timestamp":1744959219000},"page":"328-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quadrant Partitioned-RRT* (QP-RRT*) Autonomous Agent"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Saha","sequence":"first","affiliation":[]},{"given":"Saikat","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"key":"26_CR1","unstructured":"LaValle, S.M.: Rapidly \u2013 exploring random trees: a new tool for path planning. Technical Report No. TR-CIM-98-22, Computer Science Department, Iowa State University (1998)"},{"issue":"7","key":"26_CR2","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. Rob. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Rob. Res."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Kuffner Jr., J.J., LaValle, S.M.: RRT \u2013 connect: an efficient approach to single\u2013query path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), vol. 2, pp. 995\u20131001 (2000)","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Philips, M., Mian, O., Likhachev , M.: SIPP: safe interval path planning for dynamic environments. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 5628\u20135633 (2011)","DOI":"10.1109\/ICRA.2011.5980306"},{"issue":"2","key":"26_CR5","first-page":"456","volume":"12","author":"H Huang","year":"2015","unstructured":"Huang, H., Zhou, Y., Sun, Y.: Dynamic PRM: a path planning algorithm with adjustable exploration-exploitation balance. IEEE Trans. Autom. Sci. Eng. 12(2), 456\u2013467 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"26_CR6","unstructured":"Liu, Y., Hu, H., Zhang, M., Yang, Y.F.: Fast searching in cluttered environments with hybrid RRT*. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pp. 4186\u20134192 (2018)"},{"key":"26_CR7","unstructured":"Song, Y., Yang, J.: Multi\u2013objective RRT* algorithm for path planning of mobile robot. In: Proceedings of the 12th World Congress on Intelligent Control and Automation (WCICA), pp. 1412\u20131417 (2017)"},{"key":"26_CR8","unstructured":"Tang, J., Song, X.: An improved RRT*\u2014based algorithm for path planning of mobile robot. In: Proceedings of the 10th International Conference on Modelling, Identification and Control (ICMIC), pp. 77\u201382 (2018)"},{"key":"26_CR9","unstructured":"Zhang, J., Yang, C.: Improved RRT* algorithm for unmanned aerial vehicle path planning in dynamic environments. In: Proceedings of the 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE), pp. 428\u2013432 (2019)"},{"key":"26_CR10","unstructured":"Zhou, Y., Hu, S., Tang, J.: Self \u2013 supervised learning for path planning: a comparative study (2022). arXiv preprint arXiv: 2207.01234"},{"key":"26_CR11","unstructured":"Zhang, Y., Liu, W., Wu, C.: Ensemble path planning: a multi-model approach for autonomous navigation (2023). arXiv preprint arXiv: 2301.12345"},{"key":"26_CR12","unstructured":"Sertac, K., Frazzoli, E.: Kinodynamic RRT*: asymptotically optimal motion planning for robots with linear dynamics. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), vol. 2, pp. 2005\u20132011 (2004)"},{"key":"26_CR13","first-page":"7","volume":"6","author":"S Karaman","year":"2010","unstructured":"Karaman, S., Frazzoli, E.: Incremental sampling-based algorithms for optimal motion planning. Rob. Sci. Syst. 6, 7 (2010)","journal-title":"Rob. Sci. Syst."},{"issue":"1","key":"26_CR14","first-page":"59","volume":"77","author":"A Smith","year":"2015","unstructured":"Smith, A., Johnson, B., Anderson, C.: A comparative study of path planning algorithms for unmanned aerial vehicles. J. Intell. Rob. Syst. 77(1), 59\u201376 (2015)","journal-title":"J. Intell. Rob. Syst."},{"key":"26_CR15","unstructured":"Liu, Y., Zhang, J., Zhu, X.: Enhanced RRT*-connect algorithm for UAV path planning. In: Proceedings of the IEEE International Conference on Robotics and Biomimetics (ROBIO), pp. 34\u201339 (2017)"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84543-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:53:51Z","timestamp":1744959231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84543-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031845420","9783031845437"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84543-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"19 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}