Skip to main content

Coverage Path Planning: The Boustrophedon Cellular Decomposition

  • Conference paper
Field and Service Robotics

Abstract

Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, floor scrubbing, and inspection. We developed the boustrophedon cellular decomposition, which is an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon is covered with simple back and forth motions. Once each cell is covered, then the entire environment is covered. Therefore, coverage is reduced to finding an exhaustive path through a graph which represents the adjacency relationships of the cells in the boustrophedon decomposition. This approach is provably complete and Experiments on a mobile robot validate this approach.

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. J.F. Canny and M.C. Lin. An Opportunistic Global Path Planner. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 1554–1559, Cincinnati, Ohio, 1990.

    Chapter  Google Scholar 

  2. J.F. Canny and M.C. Lin. An Opportunistic Global Path Planner. Algorithmica, 10:102–120, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  3. J.F. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.

    Google Scholar 

  4. J. Colegrave and A. Branch. A Case Study of Autonomous Household Vacuum Cleaner. In AIAA/NASA CIRFFSS, 1994.

    Google Scholar 

  5. S. Hert, S. Tiwari, and V. Lumelsky. A Terrain-Covering Algorithm for an auv. Autonomous Robots, 3:91–119, 1996.

    Article  Google Scholar 

  6. C. Hofner and G. Schmidt. Path planning and guidance techniques for an autonomous mobile cleaning robot. Robotics and Autonomous Systems, 14:199–212, 1995.

    Article  Google Scholar 

  7. D. Kurabayashi, J. Ota, T. Arai, and E. Yoshida. Cooperative Sweeping by Multiple Mobile Robots. In Int. Conf. on Robotics and Automation, 1996.

    Google Scholar 

  8. J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.

    Book  Google Scholar 

  9. M. Ollis and A. Stentz. First Results in Vision-Based Crop Line Tracking. In IEEE International Conference on Robotics and Automation, 1996.

    Google Scholar 

  10. F.P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. p198–257.

    Google Scholar 

  11. J. Vander Heide and N. S. V. Rao. Terrain coverage of an unknown room by an autonomous mobile robot. Technical Report ORNL/TM-13117, Oak Ridge National Laboratory, Oak Ridge, Tennessee, 1995.

    Book  Google Scholar 

  12. A. Zelinsky, R.A. Jarvis, J.C. Byrne, and S. Yuta. Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot. In Proceedings of International Conference on Advanced Robotics, pages pp533-pp538, Tokyo Japan, November 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this paper

Cite this paper

Choset, H., Pignon, P. (1998). Coverage Path Planning: The Boustrophedon Cellular Decomposition. In: Zelinsky, A. (eds) Field and Service Robotics. Springer, London. https://doi.org/10.1007/978-1-4471-1273-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1273-0_32

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-1275-4

  • Online ISBN: 978-1-4471-1273-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics