Skip to main content
Have a personal or library account? Click to login
Efficient Coverage Path Planning via Gradient-Based Rectangular Segmentation Cover

Efficient Coverage Path Planning via Gradient-Based Rectangular Segmentation

Open Access
|Sep 2026
Read online

References

  1. E. Galceran and M. Carreras, “A survey on coverage path planning for robotics”, Robotics and Autonomous Systems, vol. 61, no. 12, 2013, 1258–1276, https://doi.org/10.1016/j.robot.2013.09.004.
  2. T. Oksanen and A. Visala, “Coverage path planning algorithms for agricultural field machines”, Journal of Field Robotics, vol. 26, no. 8, 2009, 651–668, https://doi.org/10.1002/rob.20300.
  3. H. Choset and P. Pignon, “Coverage path planning: The boustrophedon cellular decomposition”, Proc. Field and Service Robotics, 1998, 203–209.
  4. X. Miao, J. Lee, and B.-Y. Kang, “Scalable coverage path planning for cleaning robots using rectangular map decomposition on large environments”, IEEE Access, vol. 6, 2018, 38200–38215.
  5. S. Bochkarev and S. L. Smith, “On minimizing turns in robot coverage path planning”, Proc. 2016 IEEE International Conference on Automation Science and Engineering (CASE), 2016, 1237–1242.
  6. A. Khan, I. Noreen, and Z. Habib, “On complete coverage path planning algorithms for non-holonomic mobile robots: Survey and challenges.”, Journal of Information Science and Engineering, vol. 33, no. 1, 2017, 101–121.
  7. H. Choset, “Coverage for robotics – a survey of recent results”, Annals of Mathematics and Artificial Intelligence, vol. 31, 2001, 113–126, 10.1023/A:1016639210559.
  8. R. Bormann, F. Jordan, J. Hampp, and M. Hägele, “Indoor coverage path planning: Survey, implementation, analysis”, Proc. 2018 IEEE International Conference on Robotics and Automation (ICRA), 2018, 1718–1725, 10.1109/ICRA.2018.8460566.
  9. T. Cabreira, L. Brisolara, and P. R. F. Jr., “Survey on coverage path planning with unmanned aerial vehicles”, Drones, vol. 3, 2019, 4, 10.3390/drones3010004.
  10. C. S. Tan, R. Mohd-Mokhtar, and M. R. Arshad, “A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms”, IEEE Access, vol. 9, 2021, 119310–119342, 10.1109/ACCESS.2021.3108177.
  11. M. Höffmann, S. Patel, and C. Büskens, “Optimal guidance track generation for precision agriculture: A review of coverage path planning techniques”, Journal of Field Robotics, vol. 41, 2024, 823–844, 10.1002/rob.22286.
  12. K. P. Jayalakshmi, V. G. Nair, and D. Sathish, “A comprehensive survey on coverage path planning for mobile robots in dynamic environments”, IEEE Access, vol. 13, 2025, 60158–60185, 10.1109/ACCESS.2025.3556446.
  13. Y. Gabriely and E. Rimon, “Spanning-tree based coverage of continuous areas by a mobile robot”, Annals of Mathematics and Artificial Intelligence, vol. 31, 2001, 77–98, 10.1023/A:1016610507833.
  14. H. V. Pham, P. Moore, and D. X. Truong, “Proposed smooth-stc algorithm for enhanced coverage path planning performance in mobile robot applications”, Robotics, vol. 8, 2019, 10.3390/ROBOTICS8020044.
  15. K. R. Guruprasad and T. D. Ranjitha, “Cpc algorithm: Exact area coverage by a mobile robot using approximate cellular decomposition”, Robotica, vol. 39, 2021, 10.1017/S026357472000096X.
  16. A. Singha, A. K. Ray, and A. B. Samaddar, “Neural dynamics based complete grid coverage by single and multiple mobile robots”, SN Applied Sciences 2021 3:5, vol. 3, 2021, 543–, 10.1007/s42452-021-04508-5.
  17. H. Choset, E. Acar, A. A. Rizzi, and J. Luntz, “Exact cellular decompositions in terms of critical points of morse functions”, Proc. 2000 IEEE International Conference on Robotics and Automation (ICRA), Millennium Conference, vol. 3, 2000, 2270–2277.
  18. S. Karakaya and M. Z. Konyar, “Hybrid boustrophedon and direction-biased region transitions for mobile robot coverage path planning: A region-based multi-cost framework”, Applied Sciences (Switzerland), vol. 15, 2025, 10.3390/app152312666.
  19. Z. Wang and Z. Bo, “Coverage path planning for mobile robot based on genetic algorithm”, Proc. 2014 IEEE Workshop on Electronics, Computer and Applications (IWECA), 2014, 732–735, 10.1109/IWECA.2014.6845726.
  20. X. Wu, J. Bai, F. Hao, G. Cheng, Y. Tang, and X. Li, “Field complete coverage path planning based on improved genetic algorithm for transplanting robot”, Machines, vol. 11, 2023, 10.3390/machines11060659.
  21. G. Chen, Y. Du, X. Xi, K. Zhang, J. Yang, L. Xu, and C. Ren, “Improved genetic algorithm based on bi-level co-evolution for coverage path planning in irregular region”, Scientific Reports, vol. 15, 2025, 10.1038/s41598-025-93492-6.
  22. C. Carr and P. Wang, “Fast-spanning ant colony optimisation for mobile robot coverage path planning”, Proc. UK Workshop on Computational Intelligence, 2022, 463–474.
  23. K. Shi, W. Wu, Z. Wu, B. Jiang, and H. R. Karimi, “Coverage path planning for cleaning robot based on improved simulated annealing algorithm and ant colony algorithm”, Signal, Image and Video Processing, vol. 18, 2024, 10.1007/s11760-023-02989-y.
  24. J.-H. Li, H. Kang, M.-G. Kim, H. Jin, M.-J. Lee, G. R. Cho, and C. Bae, “Full coverage of confined irregular polygon area for marine survey”, IEEE Access, vol. 11, 2023, 92200–92208, 10.1109/ACCESS.2023.3308145.
  25. C. Wang, W. Dong, R. Li, H. Dong, H. Liu, and Y. Gao, “An improved stc-based full coverage path planning algorithm for cleaning tasks in large-scale unstructured social environments”, Sensors, vol. 24, 2024, 10.3390/s24247885.
  26. Z. Chen, H. Wang, K. Chen, C. Song, X. Zhang, B. Wang, and J. C. Cheng, “Improved coverage path planning for indoor robots based on bim and robotic configurations”, Automation in Construction, vol. 158, 2024, 10.1016/j.autcon.2023.105160.
  27. N. Wang, Z. Jin, T. Wang, J. Xiao, Z. Zhang, H. Wang, M. Zhang, and H. Li, “Hybrid path planning methods for complete coverage in harvesting operation scenarios”, Computers and Electronics in Agriculture, vol. 231, 2025, 10.1016/j.compag.2025.109946.
  28. B. F. Gómez, A. Jayadeep, M. A. V. J. Muthugala, and M. R. Elara, “A framework for coverage path planning of outdoor sweeping robots deployed in large environments”, Mathematics, vol. 13, 2025, 2238, 10.3390/math13142238.
  29. K. Wu, Z. Wu, S. Lu, and W. Li, “Full coverage path planning strategy for cleaning robots in semi-structured outdoor environments”, Robotics and Autonomous Systems, vol. 192, 2025, 10.1016/j.robot.2025.105050.
  30. G. Mier, A. M. C. Faulı́, J. Valente, and S. de Bruin, “Fields2benchmark: An open-source benchmark for coverage path planning methods in agriculture”, Smart Agricultural Technology, vol. 12, 2025, 10.1016/j.atech.2025.101156.
  31. D. P. Kingma and J. Ba. “Adam: A method for stochastic optimization”, 2017.
  32. S. Yang and C. Luo, “A neural network approach to complete coverage path planning”, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 34, no. 1, 2004, 718–724, 10.1109/TSMCB.2003.811769.
  33. R. Bormann, J. Hampp, and M. Hagele, “New brooms sweep clean - an autonomous robotic cleaning assistant for professional office cleaning”, Proc. IEEE International Conference on Robotics and Automation, 2015, 4470–4477, 10.1109/ICRA.2015.7139818.
DOI: https://doi.org/10.14313/jamris-2026-041 | Journal eISSN: 2080-2145 | Journal ISSN: 1897-8649
Language: English
Page range: 94 - 104
Submitted on: Aug 5, 2025
Accepted on: Mar 2, 2026
Published on: Sep 30, 2026
Published by: Łukasiewicz Research Network – Industrial Research Institute for Automation and Measurements PIAP
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2026 Hubert Baraniak, Konrad Cop, Morteza Haghbeigi, published by Łukasiewicz Research Network – Industrial Research Institute for Automation and Measurements PIAP
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.