{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:44:40Z","timestamp":1768315480482,"version":"3.49.0"},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"7","license":[{"start":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:00:00Z","timestamp":1602028800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>SUMMARY<\/jats:title><jats:p>A new coverage path planning (CPP) algorithm, namely cell permeability-based coverage (CPC) algorithm, is proposed in this paper. Unlike the most CPP algorithms using approximate cellular decomposition, the proposed algorithm achieves exact coverage with lower coverage overlap compared to that with the existing algorithms. Apart from a formal analysis of the algorithm, the performance of the proposed algorithm is compared with two representative approximate cellular decomposition-based coverage algorithms reported in the literature. Results of demonstrative experiments on a TurtleBot mobile robot within the robot operating system\/Gazebo environment and on a Fire Bird V robot are also provided.<\/jats:p>","DOI":"10.1017\/s026357472000096x","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T06:47:13Z","timestamp":1602053233000},"page":"1141-1162","source":"Crossref","is-referenced-by-count":28,"title":["CPC Algorithm: Exact Area Coverage by a Mobile Robot Using Approximate Cellular Decomposition"],"prefix":"10.1017","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9654-519X","authenticated-orcid":false,"given":"K. R.","family":"Guruprasad","sequence":"first","affiliation":[]},{"given":"T. D.","family":"Ranjitha","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,10,7]]},"reference":[{"key":"S026357472000096X_ref14","unstructured":"14. Zheng, X. , Jain, S. , Koenig, S. and Kempe, D. , \u201cMulti-robot Forest Coverage,\u201d Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, August 2005, pp. 3852\u20133857."},{"key":"S026357472000096X_ref1","doi-asserted-by":"publisher","DOI":"10.1177\/02783649030227002"},{"key":"S026357472000096X_ref5","unstructured":"5. Waanders, M. , \u201cCoverage Path Planning for Mobile Cleaning Robots,\u201d Proceedings of 15th Twente Student Conference on IT, The Netherlands. Copyright (2011)."},{"key":"S026357472000096X_ref2","doi-asserted-by":"publisher","DOI":"10.1117\/12.919461"},{"key":"S026357472000096X_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00015-8"},{"key":"S026357472000096X_ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008958800904"},{"key":"S026357472000096X_ref8","first-page":"202","article-title":"Machining-based coverage path planning for automated structural inspection","volume":"15","author":"Macleod","year":"2018","journal-title":"IEEE Trans. Robot."},{"key":"S026357472000096X_ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942969"},{"key":"S026357472000096X_ref3","unstructured":"3. Sheng, W. , Xi, N. , Song, M. , Chen, Y. and MacNeille, P. , \u201cAutomated CAD-Guided Robot Path Planning for Spray Painting of Compound Surfaces,\u201d Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2000), vol. 3 (2000) pp. 1918\u20131923."},{"key":"S026357472000096X_ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2780259"},{"key":"S026357472000096X_ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2515165"},{"key":"S026357472000096X_ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509860"},{"key":"S026357472000096X_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CIMCA.2008.145"},{"key":"S026357472000096X_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-012-9658-9"},{"key":"S026357472000096X_ref4","unstructured":"4. Doty, K. L. and Harrison, R. R. , \u201cSweep Strategies for a Sensory-Driven, Behavior-Based Vacuum Cleaning Agent,\u201d Proceedings of AAAI 1993 Fall Symposium Series (1993) pp. 1\u20136."},{"key":"S026357472000096X_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2783449.2783492"},{"key":"S026357472000096X_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"S026357472000096X_ref16","unstructured":"16. Gonzalez, E. , Alvarez, O. , Diaz, Y. , Parra, C. and Bustacara, C. , \u201cBSA: A Complete Coverage Algorithm,\u201d Proceedings of IEEE International Conference on Robotics and Automation (IEEE, 2005) pp. 2040\u20132044."},{"key":"S026357472000096X_ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016610507833"},{"key":"S026357472000096X_ref15","doi-asserted-by":"crossref","unstructured":"15. Gonzalez, E. , Alarcon, M. , Aristizabal, P. and Parra, C. , \u201cBSA: A Coverage Algorithm,\u201d Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, vol. 2 (IEEE, 2003) pp. 1679\u20131684.","DOI":"10.1109\/IROS.2003.1248885"},{"key":"S026357472000096X_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016639210559"},{"key":"S026357472000096X_ref19","first-page":"718","article-title":"A neural network approach to complete coverage path planning","volume":"34","author":"Yang","year":"2004","journal-title":"Cybern."},{"key":"S026357472000096X_ref13","unstructured":"13. Agmon, N. , Hazon, N. and Kaminka, G. A. , \u201cConstructing Spanning Trees for Efficient Multi-robot Coverage,\u201d Proceedings of IEEE International Conference on Robotics and Automation, 2006. ICRA 2006, May 2006, pp. 1698\u20131703."},{"key":"S026357472000096X_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-013-9364-x"},{"key":"S026357472000096X_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00110-4"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S026357472000096X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T16:29:19Z","timestamp":1723739359000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S026357472000096X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,7]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["S026357472000096X"],"URL":"https:\/\/doi.org\/10.1017\/s026357472000096x","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,7]]}}}