Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 61 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

Approximate Environment Decompositions for Robot Coverage Planning using Submodular Set Cover (2409.03120v1)

Published 4 Sep 2024 in cs.RO

Abstract: In this paper, we investigate the problem of decomposing 2D environments for robot coverage planning. Coverage path planning (CPP) involves computing a cost-minimizing path for a robot equipped with a coverage or sensing tool so that the tool visits all points in the environment. CPP is an NP-Hard problem, so existing approaches simplify the problem by decomposing the environment into the minimum number of sectors. Sectors are sub-regions of the environment that can each be covered using a lawnmower path (i.e., along parallel straight-line paths) oriented at an angle. However, traditional methods either limit the coverage orientations to be axis-parallel (horizontal/vertical) or provide no guarantees on the number of sectors in the decomposition. We introduce an approach to decompose the environment into possibly overlapping rectangular sectors. We provide an approximation guarantee on the number of sectors computed using our approach for a given environment. We do this by leveraging the submodular property of the sector coverage function, which enables us to formulate the decomposition problem as a submodular set cover (SSC) problem with well-known approximation guarantees for the greedy algorithm. Our approach improves upon existing coverage planning methods, as demonstrated through an evaluation using maps of complex real-world environments.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (24)
  1. E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,” Robotics and Autonomous Systems, vol. 61, no. 12, pp. 1258–1276, 2013.
  2. J. M. Palacios-Gasós, Z. Talebpour, E. Montijano, C. Sagüés, and A. Martinoli, “Optimal path planning and coverage control for multi-robot persistent coverage in environments with obstacles,” in 2017 IEEE International Conference on Robotics and Automation (ICRA), May 2017, pp. 1321–1327.
  3. X. Jin and A. Ray, “Coverage control of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments,” in 2013 American Control Conference, Jun. 2013, pp. 2594–2599.
  4. K. A. R. Grøntved, U. P. S. Lundquist, and A. L. Christensen, “Decentralized Multi-UAV Trajectory Task Allocation in Search and Rescue Applications,” in 2023 21st International Conference on Advanced Robotics (ICAR).   Abu Dhabi, United Arab Emirates: IEEE, Dec. 2023, pp. 35–41.
  5. E. M. Arkin, S. P. Fekete, and J. S. Mitchell, “Approximation algorithms for lawn mowing and milling,” Computational Geometry, vol. 17, no. 1-2, pp. 25–50, 2000.
  6. R. Bähnemann, N. Lawrance, J. J. Chung, M. Pantic, R. Siegwart, and J. Nieto, “Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem,” in Field and Service Robotics, ser. Springer Proceedings in Advanced Robotics.   Singapore: Springer, 2021, pp. 277–290.
  7. W. Huang, “Optimal line-sweep-based decompositions for coverage algorithms,” in 2001 IEEE International Conference on Robotics and Automation (ICRA), vol. 1, 2001, pp. 27–32 vol.1.
  8. S. Agarwal and S. Akella, “Area Coverage With Multiple Capacity-Constrained Robots,” IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 3734–3741, Apr. 2022.
  9. J. Lu, B. Zeng, J. Tang, T. L. Lam, and J. Wen, “TMSTC*: A Path Planning Algorithm for Minimizing Turns in Multi-Robot Coverage,” IEEE Robotics and Automation Letters, vol. 8, no. 8, pp. 5275–5282, Aug. 2023.
  10. A. Ianenko, A. Artamonov, G. Sarapulov, A. Safaraleev, S. Bogomolov, and D.-k. Noh, “Coverage Path Planning with Proximal Policy Optimization in a Grid-based Environment,” in 2020 59th IEEE Conference on Decision and Control (CDC).   Jeju, Korea (South): IEEE, Dec. 2020, pp. 4099–4104.
  11. M. Ramesh, F. Imeson, B. Fidan, and S. L. Smith, “Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning,” IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 9731–9738, Oct. 2022.
  12. ——, “Anytime Replanning of Robot Coverage Paths for Partially Unknown Environments,” IEEE Transactions on Robotics (To appear), 2024, pre-print available at http://arxiv.org/abs/2311.17837.
  13. Z. Marzeh, M. Tahmasbi, and N. Mirehi, “Algorithm for finding the largest inscribed rectangle in polygon,” Journal of Algorithms and Computation, vol. 51, no. 1, pp. 29–41, Jun. 2019.
  14. K. Daniels, V. Milenkovic, and D. Roth, “Finding the largest area axis-parallel rectangle in a polygon,” Computational Geometry, vol. 7, no. 1-2, pp. 125–148, Jan. 1997.
  15. M. Corah and N. Michael, “Distributed Submodular Maximization on Partition Matroids for Planning on Large Sensor Networks,” in 2018 IEEE Conference on Decision and Control (CDC), Dec. 2018, pp. 6792–6799.
  16. N. Mehr and R. Horowitz, “A Submodular Approach for Optimal Sensor Placement in Traffic Networks,” in 2018 Annual American Control Conference (ACC), Jun. 2018, pp. 6353–6358.
  17. L. A. Wolsey, “An analysis of the greedy algorithm for the submodular set covering problem,” Combinatorica, vol. 2, no. 4, pp. 385–393, Dec. 1982.
  18. R. K. Iyer and J. A. Bilmes, “Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints,” in Advances in Neural Information Processing Systems, vol. 26.   Curran Associates, Inc., 2013.
  19. W. Chen and V. Crawford, “Bicriteria approximation algorithms for the submodular cover problem,” in Advances in Neural Information Processing Systems, vol. 36.   Curran Associates, Inc., 2023, pp. 72 705–72 716.
  20. J. S. Chang and C. K. Yap, “A polynomial solution for the potato-peeling problem,” Discrete & Computational Geometry, vol. 1, no. 2, pp. 155–182, Jun. 1986.
  21. O. Hall-Holt, M. J. Katz, P. Kumar, J. S. B. Mitchell, and A. Sityon, “Finding large sticks and potatoes in polygons,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm - SODA ’06.   Miami, Florida: ACM Press, 2006, pp. 474–483.
  22. I. Vandermeulen, R. Groß, and A. Kolling, “Turn-minimizing multirobot coverage,” in 2019 IEEE International Conference on Robotics and Automation (ICRA), 2019, pp. 1014–1020.
  23. K. J. Obermeyer and Contributors, “VisiLibity: A C++ Library for Visibility Computations in Planar Polygonal Environments,” http://www.VisiLibity.org, 2008.
  24. H. Kälviäinen, P. Hirvonen, L. Xu, and E. Oja, “Probabilistic and non-probabilistic Hough transforms: Overview and comparisons,” Image and Vision Computing, vol. 13, no. 4, pp. 239–252, May 1995.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up