Skip to main content

Multi-robot Visual Coverage Path Planning: Geometrical Metamorphosis of the Workspace through Raster Graphics Based Approaches

  • Conference paper
Book cover Computational Science and Its Applications - ICCSA 2011 (ICCSA 2011)

Abstract

Aerial multi-robot systems are a robust remote sensing choice to collect environmental data from the Earth’s surface. To accomplish this mission in a collaborative way, unmanned aerial vehicles must perform a full coverage trajectory over a target area while acquiring imagery of it. In this paper we address the multi coverage path planning problem with an aerial vehicles team. The approach proposed is hybrid, since is it is composed by an on-line and an off-line steps. This work is based on an optimal solution which is discretized to compute the coverage paths. This work proposes a multi coverage path planning solution making use of computer graphics tools in the world transformation from continuous to discrete, focusing on the aerial images acquisition. The workspace transformation from continuous to discrete is discussed and raster graphics based algorithms are employed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agmon, N., Hazon, N., Kaminka, G.: Constructing spanning trees for effcient multi-robot coverage. In: Proceedings IEEE International Conference on Robotics and Automation (ICRA 2006), pp. 1698–1703 (2006)

    Google Scholar 

  2. Batalin, M.A., Sukhatme, G.S.: Spreading out: A local approach to multi-robot coverage. In: Proc. of 6th International Symposium on Distributed Autonomous Robotic Systems, pp. 373–382 (2002)

    Google Scholar 

  3. Bhattacharya, P., Gavrilova, M.L.: Voronoi diagram in optimal path planning. In: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 38–47. IEEE Computer Society, Washington, DC, USA (2007)

    Chapter  Google Scholar 

  4. Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Systems Journal 4(1), 25–30 (1965)

    Article  Google Scholar 

  5. Choi, Y.H., Lee, T.K., Baek, S.H., Oh, S.Y.: Online complete coverage path plan- ning for mobile robots based on linked spiral paths using constrained inverse dis- tance transform. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2009), pp. 5788–5793 (2009)

    Google Scholar 

  6. Choset, H.: Coverage for robotics - a survey of recent results. Annals of Mathematics and Artificial Intelligence 31(1-4), 113–126 (2001)

    Article  MATH  Google Scholar 

  7. Choset, H., Acar, E.U., Rizzi, A.A., Luntz, J.E.: Exact cellular decompositions in terms of critical points of morse functions. In: Proceedings IEEE International Conference on Robotics and Automation (ICRA 2000), pp. 2270–2277 (2000)

    Google Scholar 

  8. Colorado, J., Barrientos, A., Martinez, A., Lafaverges, B., Valente, J.: Mini-quadrotor attitude control based on hybrid backstepping & frenet-serret theory. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA 2010). pp. 1617–1622 (2010)

    Google Scholar 

  9. Jiao, Y.S., Wang, X.M., Chen, H., Li, Y.: Research on the coverage path planning of uavs for polygon areas. In: Proceedings of the 5th IEEE Conference on Industrial Electronics and Applications (ICIEA 2010) pp. 1467–1472 (2010)

    Google Scholar 

  10. Kurabayashi, D., Ota, J., Arai, T., Ichikawa, S., Koga, S., Asama, H., Endo, I.: Cooperative sweeping by multiple mobile robots with relocating portable obstacles. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 1996), vol. 3, pp. 1472–1477 (1996)

    Google Scholar 

  11. Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers, Norwell (1991)

    Book  MATH  Google Scholar 

  12. LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  13. Lee, J., Choi, J., Lee, B., Lee, K.: Complete coverage path planning for cleaning task using multiple robots. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2009), pp. 3618–3622 (2009)

    Google Scholar 

  14. Luo, C., Yang, S.: A real-time cooperative sweeping strategy for multiple clean- ing robots. In: Proceedings of the IEEE International Symposium on Intelligent Control, pp. 660–665 (2002)

    Google Scholar 

  15. Maza, I., Ollero, A.: Multiple uav cooperative searching operation using polygon area decomposition and efficient coverage algorithms. In: Alami, R., Chatila, R., Asama, H. (eds.) Distributed Autonomous Robotic Systems, vol. 6, pp. 221–230. Springer, Japan (2007)

    Google Scholar 

  16. Min, T.W., Yin, H.K.: A decentralized approach for cooperative sweeping by mul- tiple mobile robots. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 1998), vol. 1, pp. 380–385 (1998)

    Google Scholar 

  17. Oh, J.S., Choi, Y.H., Park, J.B., Zheng, Y.: Complete coverage navigation of clean- ing robots using triangular-cell-based map. IEEE Transactions on Industrial Electronics 51(3), 718–726 (2004)

    Article  Google Scholar 

  18. Oksanen, T., Visala, A.: Coverage path planning algorithms for agricultural field machines. J. Field Robot. 26, 651–668 (2009)

    Article  MATH  Google Scholar 

  19. Ozkan, M., Yazici, A., Kapanoglu, M., Parlaktuna, O.: Hierarchical oriented genetic algorithms for coverage path planning of multi-robot teams with load balancing. In: GEC 2009: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 451–458. ACM, New York (2009)

    Chapter  Google Scholar 

  20. Rekleitis, I., Lee-Shue, V., New, A.P., Choset, H.: Limited communication, multi-robot team based coverage, vol. 4, pp. 3462–3468 (2004)

    Google Scholar 

  21. Rossi, C., Aldama, L., Barrientos, A.: Simultaneous task subdivision and allocation for teams of heterogeneous robots. In: IEEE International Conference on Robotics and Automation, ICRA 2009, pp. 946–951 (2009)

    Google Scholar 

  22. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15(5), 918–933 (1999)

    Article  Google Scholar 

  23. Weiss-Cohen, M., Sirotin, I., Rave, E.: Lawn mowing system for known areas. In: 2008 International Conference on Computational Intelligence for Modelling Control Automation, pp. 539–544 (2008)

    Google Scholar 

  24. Wong, S., MacDonald, B.: A topological coverage algorithm for mobile robots, vol. 2, pp. 1685–1690 (2003)

    Google Scholar 

  25. Zarco-Tejada, P.J., Berni, J.A.J., Suárez, L., Fereres, E.: A new era in remote sensing of crops with unmanned robots. SPIE Newsroom (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valente, J. et al. (2011). Multi-robot Visual Coverage Path Planning: Geometrical Metamorphosis of the Workspace through Raster Graphics Based Approaches. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21931-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21931-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21930-6

  • Online ISBN: 978-3-642-21931-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics