{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:48:19Z","timestamp":1783036099017,"version":"3.54.6"},"reference-count":43,"publisher":"MDPI AG","issue":"23","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"European Regional Development Fund","award":["KK.01.2.1.01.0138"],"award-info":[{"award-number":["KK.01.2.1.01.0138"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The complete coverage path planning is a process of finding a path which ensures that a mobile robot completely covers the entire environment while following the planned path. In this paper, we propose a complete coverage path planning algorithm that generates smooth complete coverage paths based on clothoids that allow a nonholonomic mobile robot to move in optimal time while following the path. This algorithm greatly reduces coverage time, the path length, and overlap area, and increases the coverage rate compared to the state-of-the-art complete coverage algorithms, which is verified by simulation. Furthermore, the proposed algorithm is suitable for real-time operation due to its computational simplicity and allows path replanning in case the robot encounters unknown obstacles. The efficiency of the proposed algorithm is validated by experimental results on the Pioneer 3DX mobile robot.<\/jats:p>","DOI":"10.3390\/s22239269","type":"journal-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T02:09:58Z","timestamp":1669687798000},"page":"9269","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Smooth Complete Coverage Trajectory Planning Algorithm for a Nonholonomic Robot"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6721-0219","authenticated-orcid":false,"given":"Ana","family":"\u0160elek","sequence":"first","affiliation":[{"name":"Laboratory for Autonomous Systems and Mobile Robotics (LAMOR), Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1418-255X","authenticated-orcid":false,"given":"Marija","family":"Seder","sequence":"additional","affiliation":[{"name":"Laboratory for Autonomous Systems and Mobile Robotics (LAMOR), Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mi\u0161el","family":"Brezak","sequence":"additional","affiliation":[{"name":"Laboratory for Autonomous Systems and Mobile Robotics (LAMOR), Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9961-5627","authenticated-orcid":false,"given":"Ivan","family":"Petrovi\u0107","sequence":"additional","affiliation":[{"name":"Laboratory for Autonomous Systems and Mobile Robotics (LAMOR), Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.3901\/JME.2008.03.228","article-title":"Omni-directional mobile robot for floor cleaning","volume":"44","author":"Gao","year":"2008","journal-title":"Chin. J. Mech. Eng."},{"key":"ref_2","unstructured":"Dakulovi\u0107, M., Horvati\u0107, S., and Petrovi\u0107, I. (September, January 28). Complete Coverage D* Algorithm for Path Planning of a Floor-Cleaning Mobile Robot. Proceedings of the Preprints of the 18th IFAC World Congress, Milano, Italy."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TSMCB.2003.811769","article-title":"A neural network approach to complete coverage path planning","volume":"34","author":"Yang","year":"2004","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1177\/02783649030227002","article-title":"Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods","volume":"22","author":"Acar","year":"2003","journal-title":"Int. J. Robot. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1108\/01439911211249779","article-title":"Complete coverage path planning of mobile robots for humanitarian demining","volume":"39","year":"2012","journal-title":"Ind. Robot. Int. J."},{"key":"ref_6","unstructured":"Ollis, M., and Stentz, A. (1996, January 22\u201328). First results in vision-based crop line tracking. Proceedings of the IEEE International Conference on Robotics and Automation, Minneapolis, MN, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Weiss-Cohen, M., Sirotin, I., and Rave, E. (2008, January 10\u201312). Lawn Mowing System for Known Areas. Proceedings of the 2008 International Conference on Computational Intelligence for Modelling Control & Automation, Vienna, Austria.","DOI":"10.1109\/CIMCA.2008.145"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Kapoutsis, A.C., Chatzichristofis, S.A., Doitsidis, L., de Sousa, J.B., and Kosmatopoulos, E.B. (2013, January 25\u201328). Autonomous navigation of teams of Unmanned Aerial or Underwater Vehicles for exploration of unknown static dynamic environments. Proceedings of the 21st Mediterranean Conference on Control and Automation, Platanias, Greece.","DOI":"10.1109\/MED.2013.6608870"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1007\/s10514-015-9510-8","article-title":"Real-time adaptive multi-robot exploration with application to underwater map construction","volume":"40","author":"Kapoutsis","year":"2015","journal-title":"Auton. Robot."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.ifacol.2018.11.582","article-title":"Mobile robot navigation for complete coverage of an environment","volume":"51","author":"Seder","year":"2018","journal-title":"IFAC-PapersOnLine"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.3182\/20110828-6-IT-1002.02944","article-title":"Path smoothing using clothoids for differential drive mobile robots","volume":"44","author":"Brezak","year":"2011","journal-title":"IFAC Proc. Vol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/rob.4620050202","article-title":"Region filling operations with random obstacle avoidance for mobile robotics","volume":"5","author":"Cao","year":"1988","journal-title":"J. Robot. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","article-title":"A Survey on Coverage Path Planning for Robotics","volume":"61","author":"Galceran","year":"2013","journal-title":"Robot. Auton. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/TSMC.2017.2662623","article-title":"A Rainbow Coverage Path Planning for a Patrolling Mobile Robot With Circular Sensing Range","volume":"48","author":"An","year":"2017","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1109\/TSMC.2018.2806840","article-title":"A Triangulation-Based Coverage Path Planning","volume":"50","author":"An","year":"2020","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_16","unstructured":"Zelinsky, A., Jarvis, R., Byrne, J.C., and Yuta, S. (1993, January 26\u201330). Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot. Proceedings of the International Conference on Advanced Robotics, Tokyo, Japan."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0925-7721(02)00110-4","article-title":"Competitive online coverage of grid environments by a mobile robot","volume":"24","author":"Gabriely","year":"2003","journal-title":"Comput. Geom."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.3182\/20120905-3-HR-2030.00162","article-title":"Efficient Interpolated Path Planning of Mobile Robots based on Occupancy Grid Maps","volume":"45","year":"2012","journal-title":"IFAC Proc. Vol."},{"key":"ref_19","first-page":"4868","article-title":"Drivable Path Planning Using Hybrid Search Algorithm Based on E* and Bernstein-B\u00e9zier Motion Primitives","volume":"51","author":"Seder","year":"2019","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Le, A.V., Prabakaran, V., Sivanantham, V., and Mohan, R.E. (2018). Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor. Sensors, 18.","DOI":"10.3390\/s18082585"},{"key":"ref_21","first-page":"6371814","article-title":"Warehouse-Oriented Optimal Path Planning for Autonomous Mobile Fire-Fighting Robots","volume":"2020","author":"Lui","year":"2020","journal-title":"Secur. Commun. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Shrivastava, K., and Kumar, S. (2018, January 24\u201326). The Effectiveness of Parameter Tuning on Ant Colony Optimization for Solving the Travelling Salesman Problem. Proceedings of the 8th International Conference on Communication Systems and Network Technologies, Bhopal, India.","DOI":"10.1109\/CSNT.2018.8820263"},{"key":"ref_24","first-page":"222","article-title":"An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem","volume":"2","author":"Shweta","year":"2013","journal-title":"Int. J. Comput. Sci. Mob. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural Computation of Decisions in Optimization Problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybern."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3891","DOI":"10.1007\/s00500-016-2039-8","article-title":"Improving the Hopfield model performance when applied to the traveling salesman problem","volume":"21","year":"2017","journal-title":"Soft Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.procs.2022.01.084","article-title":"The neural network methods for solving Traveling Salesman Problem","volume":"199","author":"Shi","year":"2022","journal-title":"Procedia Comput. Sci."},{"key":"ref_28","unstructured":"Gabriely, Y., and Rimon, E. (2002, January 11\u201315). Spiral-STC: An On-Line Coverage Algorithm of Grid Environments by a Mobile Robot. Proceedings of the IEEE International Conference on Robotics and Automation, ICRA\u201902, Washington, DC, USA."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"5969","DOI":"10.1109\/LRA.2020.3010455","article-title":"Online Exploration and Coverage Planning in Unknown Obstacle-Cluttered Environments","volume":"5","author":"Kan","year":"2020","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TRO.2019.2946891","article-title":"PPCPP: A Predator\u2013Prey-Based Approach to Adaptive Coverage Path Planning","volume":"36","author":"Hassan","year":"2020","journal-title":"IEEE Trans. Robot."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Yang, C., Tang, Y., Zhou, L., and Ma, X. (2018, January 19\u201323). Complete Coverage Path Planning Based on Bioinspired Neural Network and Pedestrian Location Prediction. Proceedings of the 2018 IEEE 8th Annual International Conference on CYBER Technology in Automation, Control, and Intelligent Systems (CYBER), Tianjin, China.","DOI":"10.1109\/CYBER.2018.8688311"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"104242","DOI":"10.1016\/j.robot.2022.104242","article-title":"ECO-CPP: Energy constrained online coverage path planning","volume":"157","author":"Dogru","year":"2022","journal-title":"Robot. Auton. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Di Franco, C., and Buttazzo, G. (2015, January 8\u201310). Energy-Aware Coverage Path Planning of UAVs. Proceedings of the 2015 IEEE International Conference on Autonomous Robot Systems and Competitions, Vila Real, Portugal.","DOI":"10.1109\/ICARSC.2015.17"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3446","DOI":"10.1109\/JSYST.2021.3117850","article-title":"Asymptotically Optimal Path Planning for Ground Surveillance by a Team of UAVs","volume":"16","author":"Savkin","year":"2022","journal-title":"IEEE Syst. J."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/2372560","article-title":"On curves of minimal length with constraint on average curvature, and with prescribed initial and terminal positions and tangents","volume":"79","author":"Dubin","year":"1957","journal-title":"Am. J. Math."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.biosystemseng.2015.08.005","article-title":"Smooth turning path generation for agricultural vehicles in headlands","volume":"139","author":"Backman","year":"2015","journal-title":"Biosyst. Eng."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Yu, X., Roppel, T.A., and Hung, J.Y. (2015, January 9\u201312). An Optimization Approach for Planning Robotic Field Coverage. Proceedings of the 41st Annual Conference of the IEEE Inductrial Electronics Society, Yokohama, Japan.","DOI":"10.1109\/IECON.2015.7392728"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"283","DOI":"10.13031\/2013.29488","article-title":"Optimal Coverage Path Planning for Arable Farming on 2D Surfaces","volume":"53","author":"Jin","year":"2010","journal-title":"Trans. ASABE"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.robot.2011.06.002","article-title":"Smooth coverage path planning and control of mobile robots based on high-resolution grid map representation","volume":"59","author":"Lee","year":"2011","journal-title":"Robot. Auton. Syst."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/TRO.2013.2283928","article-title":"Real-time Approximation of Clothoids With Bounded Error for Path Planning Applications","volume":"30","author":"Brezak","year":"2014","journal-title":"IEEE Trans. Robot."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.robot.2003.09.007","article-title":"Time optimal path planning considering acceleration limits","volume":"45","author":"Matko","year":"2003","journal-title":"Robot. Auton. Syst."},{"key":"ref_42","unstructured":"Kanayama, Y., Kimura, Y., Miyazaki, F., and Noguchi, T. (1990, January 13\u201318). A stable tracking control method for an autonomous mobile robot. Proceedings of the IEEE International Conference on Robotics and Automation, Cincinnati, OH, USA."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/TCST.2016.2558479","article-title":"Receding Horizon Control for Convergent Navigation of a Differential Drive Mobile Robot","volume":"25","author":"Seder","year":"2017","journal-title":"IEEE Trans. Control. Syst. Technol."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/23\/9269\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:28:43Z","timestamp":1760146123000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/23\/9269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":43,"journal-issue":{"issue":"23","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["s22239269"],"URL":"https:\/\/doi.org\/10.3390\/s22239269","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,28]]}}}