{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T01:19:58Z","timestamp":1774919998506,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811961410","type":"print"},{"value":"9789811961427","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-981-19-6142-7_13","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:05:36Z","timestamp":1666281936000},"page":"169-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Path Planning for Mobile Robots Based on Improved A* Algorithm"],"prefix":"10.1007","author":[{"given":"Yuxiang","family":"Hou","sequence":"first","affiliation":[]},{"given":"Huanbing","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zijian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chuansheng","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Sariff, N., Buniyamin, N.: An overview of autonomous mobile robot path planning algorithms. In: Conference on Research and Development, pp. 183\u2013185. IEEE (2006)","DOI":"10.1109\/SCORED.2006.4339335"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.robot.2016.12.008","volume":"89","author":"A Bakdi","year":"2017","unstructured":"Bakdi, A., Abdelfetah, H., Boutamai, H., et al.: Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control. Robot. Auton. Syst. 89(1), 95\u2013109 (2017)","journal-title":"Robot. Auton. Syst."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","volume":"133","author":"A Mohd","year":"2018","unstructured":"Mohd, A., Nayab Zafar, J.C.M.B.: Methodology for path planning and optimization of mobile robots: a review. Procedia Comput. Sci. 133, 141\u2013152 (2018)","journal-title":"Procedia Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Alajlan, M., Koubaa, A., Chaari, I., et al.: Global path planning for mobile robots in large-scale grid environments using genetic algorithms. In: 2013 International Conference on Individual and Collective Behaviors in Robotics (ICBR), pp. 3\u20135. IEEE (2013)","DOI":"10.1109\/ICBR.2013.6729271"},{"issue":"008","key":"13_CR5","first-page":"1548","volume":"46","author":"L Mei","year":"2018","unstructured":"Mei, L.: Research on robot path optimization based on rasterized vision. Comput. Digit. Eng. 46(008), 1548\u20131552 (2018)","journal-title":"Comput. Digit. Eng."},{"key":"13_CR6","unstructured":"Stentz, A.: Optimal and efficient path planning for partially-known environments. In: Proceedings of 1994 IEEE International Conference on Robotics and Automation, pp. 3\u20138. IEEE (1994):"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 270\u2013275 (1959)","journal-title":"Numer. Math."},{"key":"13_CR8","unstructured":"Wang, H., Yuan, Y., Yuan, Q.: Application of Dijkstra algorithm in robot path-planning, pp. 1067\u20131069. IEEE (2011)"},{"issue":"2","key":"13_CR9","first-page":"28","volume":"4","author":"PE Hart","year":"1972","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 28\u201331 (1972)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"1\u20133","key":"13_CR10","first-page":"224","volume":"35","author":"S Aine","year":"2014","unstructured":"Aine, S., Swaminathan, S., Narayanan, V., et al.: Multi-heuristic A*. Int. J. Robot. Res. 35(1\u20133), 224\u2013243 (2014)","journal-title":"Int. J. Robot. Res."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.protcy.2016.03.010","volume":"23","author":"AK Guruji","year":"2016","unstructured":"Guruji, A.K., Agarwal, H., Parsediya, D.K.: Time-efficient A* algorithm for robot path planning. Procedia Technol. 23, 144\u2013149 (2016)","journal-title":"Procedia Technol."},{"issue":"6","key":"13_CR12","first-page":"137","volume":"40","author":"X Zhao","year":"2018","unstructured":"Zhao, X., Wang, Z., Huang, C.K., et al.: Mobile robot path planning based on an improved A* algorithm. Robot 40(6), 137\u2013144 (2018)","journal-title":"Robot"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Islam, F., Narayanan, V., Likhachev, M.: A*-Connect: Bounded suboptimal bidirectional heuristic search. In: 2016 IEEE International Conference on Robotics and Automation (ICRA), pp. 2753\u20132755. IEEE (2016)","DOI":"10.1109\/ICRA.2016.7487437"},{"issue":"21","key":"13_CR14","first-page":"227","volume":"55","author":"P Wu","year":"2019","unstructured":"Wu, P., Sang, C., Lu, Z., Yu, S., Fang, L., Zhang, Y.: Research on mobile robot path planning based on improved A* algorithm. Comput. Eng. Appl. 55(21), 227\u2013233 (2019)","journal-title":"Comput. Eng. Appl."},{"key":"13_CR15","unstructured":"Gao, M., Zhang, Y., Zhu, L.: Bidirectional time-efficient A* algorithm for robot path planning, Appl. Res. Comput. 36(329(03)), 159\u2013162+167 (2019)"},{"issue":"08","key":"13_CR16","first-page":"231","volume":"57","author":"J Kong","year":"2021","unstructured":"Kong, J., Zhang, P., Liu, X.: Research on improved A* algorithm of bidirectional search mechanism. Comput. Eng. Appl. 57(08), 231\u2013237 (2021)","journal-title":"Comput. Eng. Appl."},{"key":"13_CR17","unstructured":"Sturtevant, N.R., Felner, A., Barrer, M., et al.: Memory-based heuristics for explicit state spaces. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, p. 612. Morgan Kaufmann Publishers Inc. (2009)"},{"key":"13_CR18","unstructured":"Ferguson, D., Likhachev, M.: A guide to heuristic-based path planning, pp. 9\u201313 (2005)"},{"issue":"05","key":"13_CR19","first-page":"627","volume":"36","author":"Y Xin","year":"2014","unstructured":"Xin, Y., Liang, H., Du, M., Mei, T., Wang, Z., Jiang, R.: An improved A* algorithm for searching infinite neighbourhoods. Robot 36(05), 627\u2013633 (2014)","journal-title":"Robot"},{"key":"13_CR20","unstructured":"Yan, W., Li, D., Wu, W.: Data Structure, vol. 281, pp. 234\u2013269. Posts and Telecommunications Press, Beijing (2015)"},{"key":"13_CR21","first-page":"100","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2005","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, pp. 100\u2013102. MIT Press, Cambridge (2005)"},{"key":"13_CR22","unstructured":"Qu, W.: The Design and Analysis of Algorithm, pp. 26\u201334. Tsinghua University Press, Beijing (2016)"}],"container-title":["Communications in Computer and Information Science","Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-6142-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:11:57Z","timestamp":1666282317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-6142-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811961410","9789811961427"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-6142-7_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Computing for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dl2link.com\/ncaa2022\/","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":"205","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":"77","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":"38% - 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":"3.09","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.68","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}