Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Online On-Demand Multi-Robot Coverage Path Planning (2303.00047v3)

Published 28 Feb 2023 in cs.RO

Abstract: We present an online centralized path planning algorithm to cover a large, complex, unknown workspace with multiple homogeneous mobile robots. Our algorithm is horizon-based, synchronous, and on-demand. The recently proposed horizon-based synchronous algorithms compute all the robots' paths in each horizon, significantly increasing the computation burden in large workspaces with many robots. As a remedy, we propose an algorithm that computes the paths for a subset of robots that have traversed previously computed paths entirely (thus on-demand) and reuses the remaining paths for the other robots. We formally prove that the algorithm guarantees complete coverage of the unknown workspace. Experimental results on several standard benchmark workspaces show that our algorithm scales to hundreds of robots in large complex workspaces and consistently beats a state-of-the-art online centralized multi-robot coverage path planning algorithm in terms of the time needed to achieve complete coverage. For its validation, we perform ROS+Gazebo simulations in five 2D grid benchmark workspaces with 10 Quadcopters and 10 TurtleBots, respectively. Also, to demonstrate its practical feasibility, we conduct one indoor experiment with two real TurtleBot2 robots and one outdoor experiment with three real Quadcopters.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (69)
  1. R. Bormann, F. Jordan, J. Hampp, and M. Hägele, “Indoor coverage path planning: Survey, implementation, analysis,” in ICRA, 2018, pp. 1718–1725.
  2. I. Vandermeulen, R. Groß, and A. Kolling, “Turn-minimizing multirobot coverage,” in ICRA, 2019, pp. 1014–1020.
  3. W. Jing, J. Polden, C. F. Goh, M. Rajaraman, W. Lin, and K. Shimada, “Sampling-based coverage motion planning for industrial inspection application with redundant robotic system,” in IROS, 2017, pp. 5211–5218.
  4. D. Engelsons, M. Tiger, and F. Heintz, “Coverage path planning in large-scale multi-floor urban environments with applications to autonomous road sweeping,” in ICRA, 2022, pp. 3328–3334.
  5. R. Schirmer, P. Biber, and C. Stachniss, “Efficient path planning in belief space for safe navigation,” in IROS, 2017, pp. 2857–2863.
  6. A. Barrientos, J. Colorado, J. del Cerro, A. Martinez, C. Rossi, D. Sanz, and J. Valente, “Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robots,” J. Field Robotics, vol. 28, no. 5, pp. 667–689, 2011.
  7. W. Luo, C. Nam, G. Kantor, and K. P. Sycara, “Distributed environmental modeling and adaptive sampling for multi-robot sensor coverage,” in AAMAS, 2019, pp. 1488–1496.
  8. N. Karapetyan, J. Moulton, J. S. Lewis, A. Q. Li, J. M. O’Kane, and I. M. Rekleitis, “Multi-robot dubins coverage with autonomous surface vehicles,” in ICRA, 2018, pp. 2373–2379.
  9. S. Agarwal and S. Akella, “Line coverage with multiple robots,” in ICRA, 2020, pp. 3248–3254.
  10. J. S. Lewis, W. Edwards, K. Benson, I. M. Rekleitis, and J. M. O’Kane, “Semi-boustrophedon coverage with a dubins vehicle,” in IROS, 2017, pp. 5630–5637.
  11. T. M. Cabreira, L. B. Brisolara, and P. R. Ferreira Jr, “Survey on coverage path planning with unmanned aerial vehicles,” Drones, vol. 3, no. 1, p. 4, 2019.
  12. S. Dogru and L. Marques, “Improved coverage path planning using a virtual sensor footprint: a case study on demining,” in ICRA, 2019, pp. 4410–4415.
  13. Y. Bouzid, Y. Bestaoui, and H. Siguerdidjane, “Quadrotor-uav optimal coverage path planning in cluttered environment with a limited onboard energy,” in IROS, 2017, pp. 979–984.
  14. A. Kleiner, R. Baravalle, A. Kolling, P. Pilotti, and M. Munich, “A solution to room-by-room coverage for autonomous cleaning robots,” in IROS, 2017, pp. 5346–5352.
  15. G. Sharma, A. Dutta, and J. Kim, “Optimal online coverage path planning with energy constraints,” in AAMAS, 2019, pp. 1189–1197.
  16. M. Wei and V. Isler, “Coverage path planning under the energy constraint,” in ICRA, 2018, pp. 368–373.
  17. M. Coombes, W. Chen, and C. Liu, “Flight testing boustrophedon coverage path planning for fixed wing uavs in wind,” in ICRA, 2019, pp. 711–717.
  18. X. Chen, T. M. Tucker, T. R. Kurfess, and R. W. Vuduc, “Adaptive deep path: Efficient coverage of a known environment under various configurations,” in IROS, 2019, pp. 3549–3556.
  19. M. Dharmadhikari, T. Dang, L. Solanka, J. Loje, H. Nguyen, N. Khedekar, and K. Alexis, “Motion primitives-based path planning for fast and agile exploration using aerial robots,” in ICRA, 2020, pp. 179–185.
  20. L. Zhu, S. Yao, B. Li, A. Song, Y. Jia, and J. Mitani, “A geometric folding pattern for robot coverage path planning,” in ICRA, 2021, pp. 8509–8515.
  21. E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,” Robotics Auton. Syst., vol. 61, no. 12, pp. 1258–1276, 2013.
  22. J. Modares, F. Ghanei, N. Mastronarde, and K. Dantu, “UB-ANC planner: Energy efficient coverage path planning with multiple drones,” in ICRA, 2017, pp. 6182–6189.
  23. N. Karapetyan, K. Benson, C. McKinney, P. Taslakian, and I. M. Rekleitis, “Efficient multi-robot coverage of a known environment,” in IROS, 2017, pp. 1846–1852.
  24. M. Salaris, A. Riva, and F. Amigoni, “Multirobot coverage of modular environments,” in AAMAS, 2020, pp. 1178–1186.
  25. G. Hardouin, J. Moras, F. Morbidi, J. Marzat, and E. M. Mouaddib, “Next-best-view planning for surface reconstruction of large-scale 3D environments with multiple uavs,” in IROS, 2020, pp. 1567–1574.
  26. J. Tang, C. Sun, and X. Zhang, “Mstc∗∗{}^{\mbox{{${{}_{\ast}}$}}}start_FLOATSUPERSCRIPT start_FLOATSUBSCRIPT ∗ end_FLOATSUBSCRIPT end_FLOATSUPERSCRIPT: Multi-robot coverage path planning under physical constrain,” in ICRA, 2021, pp. 2518–2524.
  27. L. Collins, P. Ghassemi, E. T. Esfahani, D. S. Doermann, K. Dantu, and S. Chowdhury, “Scalable coverage path planning of multi-robot teams for monitoring non-convex areas,” in ICRA, 2021, pp. 7393–7399.
  28. N. Hazon and G. A. Kaminka, “Redundancy, efficiency and robustness in multi-robot coverage,” in ICRA, 2005, pp. 735–741.
  29. X. Zheng, S. Jain, S. Koenig, and D. Kempe, “Multi-robot forest coverage,” in IROS, 2005, pp. 3852–3857.
  30. A. Riva and F. Amigoni, “A GRASP metaheuristic for the coverage of grid environments with limited-footprint tools,” in AAMAS, 2017, pp. 484–491.
  31. C. Cao, J. Zhang, M. J. Travers, and H. Choset, “Hierarchical coverage path planning in complex 3d environments,” in ICRA, 2020, pp. 3206–3212.
  32. R. K. Ramachandran, L. Zhou, J. A. Preiss, and G. S. Sukhatme, “Resilient coverage: Exploring the local-to-global trade-off,” in IROS, 2020, pp. 11 740–11 747.
  33. H. Song, J. Yu, J. Qiu, Z. Sun, K. Lang, Q. Luo, Y. Shen, and Y. Wang, “Multi-uav disaster environment coverage planning with limited-endurance,” in ICRA, 2022, pp. 10 760–10 766.
  34. B. Yamauchi, “Frontier-based exploration using multiple robots,” in AGENTS, K. P. Sycara and M. J. Wooldridge, Eds., 1998, pp. 47–53.
  35. A. Howard, L. E. Parker, and G. S. Sukhatme, “Experiments with a large heterogeneous mobile robot team: Exploration, mapping, deployment and detection,” Int. J. Robotics Res., vol. 25, no. 5-6, pp. 431–447, 2006.
  36. A. Bircher, M. Kamel, K. Alexis, H. Oleynikova, and R. Siegwart, “Receding horizon “next-best-view” planner for 3D exploration,” in ICRA, 2016, pp. 1462–1468.
  37. A. Mannucci, S. Nardi, and L. Pallottino, “Autonomous 3D exploration of large areas: A cooperative frontier-based approach,” in MESAS, vol. 10756.   Springer, 2017, pp. 18–39.
  38. E. A. Jensen and M. L. Gini, “Online multi-robot coverage: Algorithm comparisons,” in AAMAS, 2018, pp. 1974–1976.
  39. S. N. Das and I. Saha, “Rhocop: receding horizon multi-robot coverage,” in ICCPS, 2018, pp. 174–185.
  40. A. Özdemir, M. Gauci, A. Kolling, M. D. Hall, and R. Groß, “Spatial coverage without computation,” in ICRA, 2019, pp. 9674–9680.
  41. S. Datta and S. Akella, “Prioritized indoor exploration with a dynamic deadline,” in IROS, 2021, pp. 3131–3137.
  42. Y. Gabriely and E. Rimon, “Spanning-tree based coverage of continuous areas by a mobile robot,” in ICRA, 2001, pp. 1927–1933.
  43. M. Li, A. Richards, and M. Sooriyabandara, “Asynchronous reliability-aware multi-uav coverage path planning,” in ICRA, 2021, pp. 10 023–10 029.
  44. R. Mitra and I. Saha, “Scalable online coverage path planning for multi-robot systems,” in IROS, 2022, pp. 10 102–10 109.
  45. Z. J. Butler, A. A. Rizzi, and R. L. Hollis, “Complete distributed coverage of rectilinear environments,” in Algorithmic and Computational Robotics.   AK Peters/CRC Press, 2001, pp. 61–68.
  46. N. Hazon, F. Mieli, and G. A. Kaminka, “Towards robust on-line multi-robot coverage,” in ICRA, 2006, pp. 1710–1715.
  47. I. M. Rekleitis, A. P. New, E. S. Rankin, and H. Choset, “Efficient boustrophedon multi-robot coverage: an algorithmic approach,” Ann. Math. Artif. Intell., vol. 52, no. 2-4, pp. 109–142, 2008.
  48. E. A. Jensen and M. L. Gini, “Rolling dispersion for robot teams,” in IJCAI, 2013, pp. 2473–2479.
  49. K. Hungerford, P. Dasgupta, and K. R. Guruprasad, “A repartitioning algorithm to guarantee complete, non-overlapping planar coverage with multiple robots,” in DARS, N. Y. Chong and Y. Cho, Eds., vol. 112, 2014, pp. 33–48.
  50. H. H. Viet, V. Dang, S. Y. Choi, and T. Chung, “BoB: an online coverage approach for multi-robot systems,” Appl. Intell., vol. 42, no. 2, pp. 157–173, 2015.
  51. L. Siligardi, J. Panerati, M. Kaufmann, M. Minelli, C. Ghedini, G. Beltrame, and L. Sabattini, “Robust area coverage with connectivity maintenance,” in ICRA, 2019, pp. 2202–2208.
  52. J. Song and S. Gupta, “CARE: cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures,” Auton. Robots, vol. 44, no. 3-4, pp. 647–671, 2020.
  53. M. Hassan, D. Mustafic, and D. Liu, “Dec-ppcpp: A decentralized predator-prey-based approach to adaptive coverage path planning amid moving obstacles,” in IROS, 2020, pp. 11 732–11 739.
  54. TurtleBot. [Online]. Available: https://www.turtlebot.com/
  55. TurtleBot 2. [Online]. Available: https://clearpathrobotics.com/turtlebot-2-open-source-robot/
  56. P. Oberlin, S. Rathinam, and S. Darbha, “A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem,” in ACC, 2009, pp. 1292–1297.
  57. H. W. Kuhn, “The hungarian method for the assignment problem,” Nav. Res. Logist., vol. 2, no. 1-2, pp. 83–97, 1955.
  58. F. Bourgeois and J. Lassalle, “An extension of the munkres algorithm for the assignment problem to rectangular matrices,” Commun. ACM, vol. 14, no. 12, pp. 802–804, 1971.
  59. M. A. Erdmann and T. Lozano-Pérez, “On multiple moving objects,” in ICRA, 1986, pp. 1419–1424.
  60. D. Silver, “Cooperative pathfinding,” in AIIDE, 2005, pp. 117–122.
  61. J. P. van den Berg and M. H. Overmars, “Prioritized motion planning for multiple robots,” in IROS, 2005, pp. 430–435.
  62. M. Turpin, K. Mohta, N. Michael, and V. Kumar, “Goal assignment and trajectory planning for large teams of aerial robots,” in RSS, 2013.
  63. R. Hassin and S. Rubinstein, “Approximations for the maximum acyclic subgraph problem,” Inf. Process. Lett., vol. 51, no. 3, pp. 133–140, 1994.
  64. Robot Operating System. [Online]. Available: https://www.ros.org/
  65. R. Stern, N. R. Sturtevant, A. Felner, S. Koenig, H. Ma, T. T. Walker, J. Li, D. Atzmon, L. Cohen, T. K. S. Kumar, R. Barták, and E. Boyarski, “Multi-agent pathfinding: Definitions, variants, and benchmarks,” in SOCS, 2019, pp. 151–159.
  66. R. Mitra and I. Saha, “Online on-demand multi-robot coverage path planning,” CoRR, vol. abs/2303.00047, 2023. [Online]. Available: https://arxiv.org/abs/2303.00047
  67. DJI Consumer Drones Comparison. [Online]. Available: https://www.dji.com/global/products/comparison-consumer-drones
  68. N. P. Koenig and A. Howard, “Design and use paradigms for gazebo, an open-source multi-robot simulator,” in IROS, 2004, pp. 2149–2154.
  69. Vicon Motion Capture Systems. [Online]. Available: https://www.vicon.com/
Citations (1)
View on Semantic Scholar

Summary

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

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