{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:53:48Z","timestamp":1742943228868,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_36","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"468-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Cell Potential and Motion Pattern Driven Multi-robot Coverage Path Planning Algorithm"],"prefix":"10.1007","author":[{"given":"Meng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Bin","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Lihua","family":"Dou","sequence":"additional","affiliation":[]},{"given":"Guanqiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"7\u20138","key":"36_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1177\/02783649030227002","volume":"22","author":"EU Acar","year":"2003","unstructured":"Acar, E.U., Choset, H., Zhang, Y., Schervish, M.: Path planning for robotic demining: robust sensor-based coverage of unstructured environments and probabilistic methods. Int. J. Robot. Res. 22(7\u20138), 441\u2013466 (2003). \nhttps:\/\/doi.org\/10.1177\/02783649030227002","journal-title":"Int. J. Robot. Res."},{"issue":"11","key":"36_CR2","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1177\/0278364905059058","volume":"24","author":"PN Atkar","year":"2005","unstructured":"Atkar, P.N., Greenfield, A., Conner, D.C., Choset, H., Rizzi, A.A.: Uniform coverage of automotive surface patches. Int. J. Robot. Res. 24(11), 883\u2013898 (2005). \nhttps:\/\/doi.org\/10.1177\/0278364905059058","journal-title":"Int. J. Robot. Res."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.aaspro.2015.12.026","volume":"7","author":"M Boryga","year":"2015","unstructured":"Boryga, M., Grabo\u015b, A., Ko\u0142odziej, P., Go\u0142acki, K., Stropek, Z.: Trajectory planning with obstacles on the example of tomato harvest. Agric. Agric. Sci. Procedia 7, 27\u201334 (2015). \nhttps:\/\/doi.org\/10.1016\/j.aaspro.2015.12.026","journal-title":"Agric. Agric. Sci. Procedia"},{"issue":"1\u20134","key":"36_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31(1\u20134), 113\u2013126 (2001). \nhttps:\/\/doi.org\/10.1023\/A:1016639210559","journal-title":"Ann. Math. Artif. Intell."},{"issue":"12","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258\u20131276 (2013). \nhttps:\/\/doi.org\/10.1016\/j.robot.2013.09.004","journal-title":"Robot. Auton. Syst."},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1631\/FITEE.1800551","volume":"20","author":"G Gao","year":"2019","unstructured":"Gao, G., Xin, B.: A-STC: auction-based spanning tree coverage algorithm formotion planning of cooperative robots. Front. Inf. Technol. Electron. Eng. 20(1), 18\u201331 (2019). \nhttps:\/\/doi.org\/10.1631\/FITEE.1800551","journal-title":"Front. Inf. Technol. Electron. Eng."},{"issue":"7","key":"36_CR7","doi-asserted-by":"publisher","first-page":"3560","DOI":"10.1109\/tsp.2012.2194706","volume":"60","author":"A Ghaffarkhah","year":"2012","unstructured":"Ghaffarkhah, A., Mostofi, Y.: Path planning for networked robotic surveillance. IEEE Trans. Signal Process. 60(7), 3560\u20133575 (2012). \nhttps:\/\/doi.org\/10.1109\/tsp.2012.2194706","journal-title":"IEEE Trans. Signal Process."},{"key":"36_CR8","unstructured":"Goldberg, D.E.: Genetic algorithms and rule learning in dynamic system control. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 8\u201315 (1985)"},{"issue":"4","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1007\/s10845-010-0404-5","volume":"23","author":"M Kapanoglu","year":"2012","unstructured":"Kapanoglu, M., Alikalfa, M., Ozkan, M., Parlaktuna, O., et al.: A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time. J. Intell. Manuf. 23(4), 1035\u20131045 (2012). \nhttps:\/\/doi.org\/10.1007\/s10845-010-0404-5","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10846-016-0461-x","volume":"86","author":"AC Kapoutsis","year":"2017","unstructured":"Kapoutsis, A.C., Chatzichristofis, S.A., Kosmatopoulos, E.B.: DARP: divide areas algorithm for optimal multi-robot coverage path planning. J. Intell. Robot. Syst. 86(3), 663\u2013680 (2017). \nhttps:\/\/doi.org\/10.1007\/s10846-016-0461-x","journal-title":"J. Intell. Robot. Syst."},{"key":"36_CR11","doi-asserted-by":"publisher","unstructured":"Liu, Y., Lin, X., Zhu, S.: Combined coverage path planning for autonomous cleaning robots in unstructured environments. In: Proceedings of the 7th World Congress on Intelligent Control and Automation, pp. 8271\u20138276 (2008). \nhttps:\/\/doi.org\/10.1109\/WCICA.2008.4594223","DOI":"10.1109\/WCICA.2008.4594223"},{"issue":"1\u20134","key":"36_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10846-011-9560-x","volume":"65","author":"L Merino","year":"2012","unstructured":"Merino, L., Caballero, F., Mart\u00ednez-De-Dios, J.R., Maza, I., Ollero, A.: An unmanned aircraft system for automatic forest fire monitoring and measurement. J. Intell. Robot. Syst. 65(1\u20134), 533\u2013548 (2012). \nhttps:\/\/doi.org\/10.1007\/s10846-011-9560-x","journal-title":"J. Intell. Robot. Syst."},{"key":"36_CR13","doi-asserted-by":"publisher","unstructured":"Mitschke, M., Uchiyama, N., Sawodny, O.: Online coverage path planning for a mobile robot considering energy consumption. In: Proceedings of 14th International Conference on Automation Science and Engineering (CASE), pp. 1473\u20131478 (2018). \nhttps:\/\/doi.org\/10.1109\/COASE.2018.8560376","DOI":"10.1109\/COASE.2018.8560376"},{"key":"36_CR14","doi-asserted-by":"publisher","unstructured":"Moravec, H., Elfes, A.: High resolution maps from wide angle sonar. In: Proceedings of the 1985 IEEE International Conference on Robotics and Automation, pp. 116\u2013121 (1985). \nhttps:\/\/doi.org\/10.1109\/ROBOT.1985.1087316","DOI":"10.1109\/ROBOT.1985.1087316"},{"key":"36_CR15","doi-asserted-by":"publisher","unstructured":"Park, E., Kim, K.J., Del Pobil, A.P.: Energy efficient complete coverage path planning for vacuum cleaning robots. In: J. (Jong Hyuk) Park, J., Leung, V., Wang, C.L., Shon, T. (eds) Future Information Technology, Application, and Service. LNEE, vol. 164, no. 1, pp. 23\u201331. Springer, Dordrecht (2012). \nhttps:\/\/doi.org\/10.1007\/978-94-007-4516-2_3","DOI":"10.1007\/978-94-007-4516-2_3"},{"issue":"1\u20134","key":"36_CR16","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s10846-016-0362-z","volume":"84","author":"EG Tsardoulias","year":"2016","unstructured":"Tsardoulias, E.G., Iliakopoulou, A., Kargakos, A., Petrou, L.: A review of global path planning methods for occupancy grid maps regardless of obstacle density. J. Intell. Robot. Syst. 84(1\u20134), 829\u2013858 (2016). \nhttps:\/\/doi.org\/10.1007\/s10846-016-0362-z","journal-title":"J. Intell. Robot. Syst."},{"key":"36_CR17","doi-asserted-by":"publisher","unstructured":"Wilfahrt, R., Kim, S.: Traveling salesman problem (TSP). Encyclopedia of GIS, pp. 1173\u20131176 (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-35973-1_1406","DOI":"10.1007\/978-0-387-35973-1_1406"},{"key":"36_CR18","doi-asserted-by":"publisher","unstructured":"Yazici, A., Kirlik, G., Parlaktuna, O., Sipahioglu, A.: A dynamic path planning approach for multirobot sensor-based coverage considering energy constraints. In: 2009 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 5930\u20135935 (2009). \nhttps:\/\/doi.org\/10.1109\/IROS.2009.5354058","DOI":"10.1109\/IROS.2009.5354058"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:32:59Z","timestamp":1585791179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_36","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.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":"197","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":"121","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":"61% - 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","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","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)"}}]}}