{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:14:47Z","timestamp":1744262087961,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819958436"},{"type":"electronic","value":"9789819958443"}],"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-99-5844-3_33","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T22:02:16Z","timestamp":1693432936000},"page":"455-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Research on Full-Coverage Path Planning Method of Steel Rolling Shop Cleaning Robot"],"prefix":"10.1007","author":[{"given":"Tengguang","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanbing","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuxian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"issue":"10","key":"33_CR1","first-page":"1","volume":"24","author":"B Xu","year":"2016","unstructured":"Xu, B., Xu, M., Chen, L.-P., et al.: Review on coverage path planning algorithm for intelligent machinery. Comput. Meas. Control 24(10), 1\u20135+53 (2016)","journal-title":"Comput. Meas. Control"},{"issue":"3","key":"33_CR2","first-page":"253","volume":"25","author":"D-L Tang","year":"2018","unstructured":"Tang, D.-L., Yuan, B., Hu, L., et al.: Complete coverage path planning method for oil tank inspection wall climbing robot. Chin. J. Eng. Des. 25(3), 253\u2013261 (2018)","journal-title":"Chin. J. Eng. Des."},{"key":"33_CR3","first-page":"232","volume":"8","author":"W-L Li","year":"2017","unstructured":"Li, W.-L., Zhao, D.-H.: Complete coverage path planning for mobile robot based on grid method and neuronal. Mach. Des. Manuf. 8, 232\u2013234 (2017)","journal-title":"Mach. Des. Manuf."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Choi, Y.H., Lee, T.K., Baek, S.H., et al.: Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 5788\u20135793. IEEE, Missouri (2009)","DOI":"10.1109\/IROS.2009.5354499"},{"key":"33_CR5","volume-title":"Pattern-based genetic algorithm approach to overage path planning for mobile robots","author":"M Kapanoglu","year":"2009","unstructured":"Kapanoglu, M., Ozkan, M., Yazici, A., et al.: Pattern-based genetic algorithm approach to overage path planning for mobile robots. Springer, Berlin (2009)"},{"issue":"7","key":"33_CR6","first-page":"1227","volume":"41","author":"K Li","year":"2019","unstructured":"Li, K., Chen, Y.F., Jin, Z.Y., et al.: A full coverage path planning algorithm based on backtracking method. Comput. Eng. Sci. 41(7), 1227\u20131235 (2019)","journal-title":"Comput. Eng. Sci."},{"issue":"10","key":"33_CR7","first-page":"56","volume":"24","author":"Z-B Hao","year":"2007","unstructured":"Hao, Z.-B., Hong, B.-R., Huang, Q.-C.: Study of coverage path planning based on grid-map. Appl. Res. Comput. 24(10), 56\u201358 (2007)","journal-title":"Appl. Res. Comput."},{"issue":"01","key":"33_CR8","first-page":"122","volume":"19","author":"X-N Qiu","year":"2006","unstructured":"Qiu, X.-N., Liu, S.-R., Yu, J.-S., et al.: Complete coverage path planning of mobile robots biologically inspired neural network and heuristic template approach. Pattern Recogn. Artif. Intell. 19(01), 122\u2013128 (2006)","journal-title":"Pattern Recogn. Artif. Intell."},{"issue":"11","key":"33_CR9","first-page":"1440","volume":"30","author":"X-D Zhao","year":"2013","unstructured":"Zhao, X.-D., Bao, F.: Survey on cleaning robot path planning algorithm. J. Mech. Electr. Eng. 30(11), 1440\u20131444 (2013)","journal-title":"J. Mech. Electr. Eng."},{"issue":"01","key":"33_CR10","first-page":"314","volume":"46","author":"Q-Z Xu","year":"2019","unstructured":"Xu, Q.-Z., Han, W.-T., Chen, J.-S., et al.: Optimization of breadth-first search algorithm based on many-core platform. Comput. Sci. 46(01), 314\u2013319 (2019)","journal-title":"Comput. Sci."},{"issue":"S1","key":"33_CR11","first-page":"120","volume":"37","author":"F Gao","year":"2020","unstructured":"Gao, F., Zhou, H., Yang, Z.-Y.: Global path planning for surface unmanned vessels based on improved A* algorithm. Appl. Res. Comput. 37(S1), 120\u2013121+125 (2020)","journal-title":"Appl. Res. Comput."},{"key":"33_CR12","volume-title":"Path Planning of Mobile Robots Based on A* algorithm","author":"M-C Wang","year":"2017","unstructured":"Wang, M.-C.: Path Planning of Mobile Robots Based on A* algorithm. Shenyang University of Technology, Shenyang (2017)"},{"issue":"11","key":"33_CR13","first-page":"1647","volume":"38","author":"H-W Wang","year":"2010","unstructured":"Wang, H.-W., Ma, Y., Xie, Y., et al.: Mobile robot optimal path planning based on smoothing A\u2217 algorithm. J. Tongji Univ. (Nat. Sci.) 38(11), 1647\u20131650+1655 (2010)","journal-title":"J. Tongji Univ. (Nat. Sci.)"},{"issue":"01","key":"33_CR14","first-page":"74","volume":"38","author":"B Tang","year":"2023","unstructured":"Tang, B., Zhang, D., Peng, T.-L., Tang, D.-W.: Research on path planning of mobile robot based on improved A* algorithm. Mech. Manage. Dev. 38(01), 74\u201377 (2023)","journal-title":"Mech. Manage. Dev."},{"issue":"02","key":"33_CR15","first-page":"256","volume":"46","author":"X-D Liu","year":"2018","unstructured":"Liu, X.-D., Yu, R.-F., Li, P.-C., et al.: Research on time complexity of randomized quick select algorithm. Comput. Digit. Eng. 46(02), 256\u2013259+280 (2018)","journal-title":"Comput. Digit. Eng."},{"issue":"03","key":"33_CR16","first-page":"280","volume":"361","author":"L-L He","year":"2021","unstructured":"He, L.-L., Liu, X.-L., Huang, T.-Z., et al.: Research on the complete-coverage path planning algorithm of mobile robot. Mach. Des. Manuf. 361(03), 280\u2013284 (2021)","journal-title":"Mach. Des. Manuf."}],"container-title":["Communications in Computer and Information Science","International Conference on Neural Computing for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-5844-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T22:05:26Z","timestamp":1693433126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-5844-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819958436","9789819958443"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-5844-3_33","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 August 2023","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":"Hefei","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":"7 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ncaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dl2link.com\/ncaa2023\/","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":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"211","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":"83","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":"1","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":"39% - 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.21","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.67","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)"}}]}}