Skip to main content

Multi-robot Coverage and Exploration in Non-Euclidean Metric Spaces

  • Conference paper
Algorithmic Foundations of Robotics X

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 86))

Abstract

Multi-robot coverage and exploration is a fundamental problem in robotics. A widely-used, efficient and distributable algorithm for achieving coverage of a convex environment with Euclidean metric is that proposed by Cortes, et al., which is based on the discrete-time Lloyd’s algorithm. It is significantly difficult to achieve the same in non-convex environments and with non-Euclidean metrics. In this paper we generalize the control law based on minimization of the coverage functional to spaces that are inherently non-Euclidean and are punctured by obstacles. We also propose a practical discrete implementation based on standard graph search-based algorithms. We demonstrate the applicability of the proposed algorithm by solving efficient coverage problems on a sphere and exploration problems in highly non-convex indoor environments.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bhattacharya, S., Ghrist, R., Kumar, V.: Relationship between gradient of distance functions and tangents to geodesics. Technical report, University of Pennsylvania, http://subhrajit.net/wiki/index.php?SFile=DistanceGradient

  2. Bhattacharya, S., Michael, N., Kumar, V.: Distributed Coverage and Exploration in Unknown Non-convex Environments. In: Martinoli, A., Mondada, F., Correll, N., Mermoud, G., Egerstedt, M., Hsieh, M.A., Parker, L.E., Støy, K. (eds.) Distributed Autonomous Robotic Systems. STAR, vol. 83, pp. 61–75. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Bullo, F., Cortés, J., Martínez, S.: Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms. Applied Mathematics Series. Princeton University Press (2009)

    Google Scholar 

  4. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education (2001)

    Google Scholar 

  5. Cortes, J., Martinez, S., Karatas, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Trans. Robot. Autom. 20(2), 243–255 (2004)

    Article  Google Scholar 

  6. Cortez, J., Martinez, S., Bullo, F.: Spatially-distributed coverage optimization and control with limited-range interactions. ESIAM: Control, Optimisation and Calculus of Variations 11, 691–719 (2005)

    Google Scholar 

  7. Cortez, J., Martinez, S., Karatas, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Trans. Robot. and Automat. 20(2), 243–255 (2004)

    Article  Google Scholar 

  8. Cundy, H., Rollett, A.: Mathematical Models, 3rd edn. Tarquin Pub. (1989)

    Google Scholar 

  9. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  10. Durham, J.W., Carli, R., Frasca, P., Bullo, F.: Discrete partitioning and coverage control for gossiping robots. IEEE Transactions on Robotics 28(2), 364–378 (2012)

    Article  Google Scholar 

  11. Gromov, M., Lafontaine, J., Pansu, P.: Metric structures for Riemannian and non-Riemannian spaces. Progress in Mathematics. Birkhäuser (1999)

    Google Scholar 

  12. Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28, 129–137 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  13. Pimenta, L.C.A., Kumar, V., Mesquita, R.C., Pereira, G.A.S.: Sensing and coverage for a network of heterogeneous robots. In: Proc. of the IEEE Conf. on Decision and Control, Cancun, Mexico, pp. 3947–3952 (December 2008)

    Google Scholar 

  14. Stachniss, C.: Exploration and Mapping with Mobile Robots. PhD thesis, University of Freiburg, Freiburg, Germany (April 2006)

    Google Scholar 

  15. Stachniss, C., Grisetti, G., Burgard, W.: Information gain-based exploration using rao-blackwellized particle filters. In: Proc. of Robot.: Sci. and Syst., Cambridge, MA, pp. 65–72 (June 2005)

    Google Scholar 

  16. Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics (Intelligent Robotics and Autonomous Agents). The MIT Press (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Subhrajit Bhattacharya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhattacharya, S., Ghrist, R., Kumar, V. (2013). Multi-robot Coverage and Exploration in Non-Euclidean Metric Spaces. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds) Algorithmic Foundations of Robotics X. Springer Tracts in Advanced Robotics, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36279-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36279-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36278-1

  • Online ISBN: 978-3-642-36279-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics