{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:34:19Z","timestamp":1742934859834,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811958670"},{"type":"electronic","value":"9789811958687"}],"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-19-5868-7_62","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T07:49:15Z","timestamp":1672559355000},"page":"827-838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Avenues of Graph Theoretic Approach of Analysing the LIDAR Data for Point-To-Point Floor Exploration by Indoor AGV"],"prefix":"10.1007","author":[{"given":"Rapti","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"Jashaswimalya","family":"Acharjee","sequence":"additional","affiliation":[]},{"given":"Suman","family":"Deb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"Cheng KP, Mohan RE, Nhan NHK, Le AV (2019) Graph theory-based approach to accomplish complete coverage path planning tasks for reconfigurable robots. IEEE Access 7:94642\u201394657","DOI":"10.1109\/ACCESS.2019.2928467"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Karur K, Sharma N, Dharmatti C, Siegel JE (2021) A survey of path planning algorithms for mobile robots. Vehicles 3(3):448\u2013468","DOI":"10.3390\/vehicles3030027"},{"key":"62_CR3","doi-asserted-by":"crossref","unstructured":"Goyal JK, Nagla KS (2014) A new approach of path planning for mobile robots. In: 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI), pp 863\u2013867","DOI":"10.1109\/ICACCI.2014.6968200"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Nagib G, Gharieb W (2004) Path planning for a mobile robot using genetic algorithms. IEEE Proc Robot 185189","DOI":"10.1109\/ICEEC.2004.1374415"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Teleweck PE, Chandrasekaran B (2019) Path planning algorithms and their use in robotic navigation systems. J Phys Conf Ser 1207:012018. IOP Publishing, 2019","DOI":"10.1088\/1742-6596\/1207\/1\/012018"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Hassani I, Maalej I, Rekik C (2018) Robot path planning with avoiding obstacles in known environment using free segments and turning points algorithm. Math Prob Eng 2018","DOI":"10.1155\/2018\/2163278"},{"key":"62_CR7","unstructured":"Fragkopoulos C, Graeser A (2010) Arrt based path planning algorithm for rehabilitation robots. In: ISR 2010 (41st international symposium on robotics) and ROBOTIK 2010 (6th German conference on robotics), pp 1\u20138"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Bruce J, Veloso MM (2002) Real-time randomized path planning for robot navigation. In: Robot soccer world cup. Springer, Berlin, pp 288\u2013295","DOI":"10.1007\/978-3-540-45135-8_23"},{"issue":"15","key":"62_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.3182\/20060906-3-IT-2910.00059","volume":"39","author":"S Garrido","year":"2006","unstructured":"Garrido S, Abderrahim M, Moreno L (2006) Path planning and navigation using voronoi diagram and fast marching. IFAC Proc Volumes 39(15):346\u2013351","journal-title":"IFAC Proc Volumes"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014) 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. IEEE, pp 2997\u20133004","DOI":"10.1109\/IROS.2014.6942976"},{"issue":"2","key":"62_CR11","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1109\/LRA.2020.2969191","volume":"5","author":"L Schmid","year":"2020","unstructured":"Schmid L, Pantic M, Khanna R, Ott L, Siegwart R, Nieto J (2020) An efficient sampling-based method for online informative path planning in unknown environments. IEEE Rob Autom Lett 5(2):1500\u20131507","journal-title":"IEEE Rob Autom Lett"},{"key":"62_CR12","unstructured":"Yonetani R, Taniai T, Barekatain M, Nishimura M, Kanezaki A (2021) Path planning using neural a* search. In: International conference on machine learning. PMLR, pp 12029\u201312039"},{"key":"62_CR13","unstructured":"Choset H (2007) Robotic motion planning: A* and d* search. Rob Inst 16\u2013735"},{"key":"62_CR14","unstructured":"Bochkovskiy A, Wang C-Y, Liao H-YM (2020) Yolov4: Optimal speed and accuracy of object detection. arXiv preprint arXiv:2004.10934"},{"key":"62_CR15","doi-asserted-by":"crossref","unstructured":"Fan X, Guo Y, Liu H, Wei B, Lyu W (2020) Improved artificial potential field method applied for auv path planning. Math Probl Eng 2020","DOI":"10.1155\/2020\/6523158"},{"key":"62_CR16","doi-asserted-by":"crossref","unstructured":"Breitenmoser A, Schwager M, Metzger J-C, Siegwart R, Rus D (2010) Voronoi coverage of non-convex environments with a group of networked robots. In: 2010 IEEE international conference on robotics and automation. IEEE, pp 4982\u20134989","DOI":"10.1109\/ROBOT.2010.5509696"},{"key":"62_CR17","doi-asserted-by":"crossref","unstructured":"Jing X, Yang X (2018) Application and improvement of heuristic function in a* algorithm. In: 2018 37th Chinese control conference (CCC). IEEE, pp 2191\u20132194","DOI":"10.23919\/ChiCC.2018.8482630"},{"key":"62_CR18","doi-asserted-by":"crossref","unstructured":"Elizondo-Leal JC, Parra-Gonzalez EF, Ram\u00b4\u0131rez-Torres JG (2013) The exact euclidean distance transform: a new algorithm for universal path planning. Int J Adv Robot Syst 10(6):266","DOI":"10.5772\/56581"},{"key":"62_CR19","doi-asserted-by":"crossref","unstructured":"Karaman S, Walter MR, Perez A, Frazzoli E, Teller S (2011) Anytime motion planning using the rrt. In: 2011 IEEE international conference on robotics and automation. IEEE, pp 1478\u20131483","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Islam F, Nasir J, Malik U, Ayaz Y, Hasan O (2012) Rrt* - smart: Rapid convergence implementation of rrt* towards optimal solution. In: 2012 IEEE international conference on mechatronics and automation. IEEE, pp 1651\u20131656","DOI":"10.1109\/ICMA.2012.6284384"}],"container-title":["Lecture Notes in Electrical Engineering","Machine Learning, Image Processing, Network Security and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-5868-7_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T08:53:08Z","timestamp":1672563188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-5868-7_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789811958670","9789811958687"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-5868-7_62","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}