Skip to main content
SpringerLink
Log in

Energy Efficient Complete Coverage Path Planning for Vacuum Cleaning Robots

  • Conference paper
  • First Online:
Future Information Technology, Application, and Service

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 164))

Abstract

The present study examines the efficiency of the back-and-forth method and boundary sweep method used for complete coverage path planning (CCPP). After identifying limitations of these existing methods, the present study develops and proposes a new, alternative CCCP method that can be used for designing more efficient vacuum cleaning robots.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Oh, J.S., Choi, Y.H., Zheng, Y.F.: Complete coverage navigation of cleaning robots using triangular-cell-based map. IEEE Trans. Ind. Electron. 51(3), 718–726 (2004)

    Article  Google Scholar 

  2. Yang, S.X., Luo, C.: A neural network approach to complete coverage path planning. IEEE Trans. Syst. Man Cybern. B Cybern. 34(1), 718–724 (2004)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Zhang, G., Ferrari, S., Qian, M.: An information roadmap method for robotic sensor path planning. J. Intell. Robotic Syst. 56(1), 69–98 (2009)

    Article  MATH  Google Scholar 

  5. Lee, J., Lee, T., Choi, H., Lee, B.: Mathematical analysis of various paths for cleaning task using a single robot. In: 2010 Korean Robotic Society Annual Conference. Korean Robotics Society, Seoul (2010)

    Google Scholar 

  6. Choi, Y., Lee, T., Baek, S., Oh, S.: Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform. In: 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5788–5793. IEEE, New York (2009)

    Google Scholar 

Download references

Acknowledgments

This research was supported by World Class University program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (R31-2008-000-10062-0).

Author information

Authors and Affiliations

  1. Department of Interaction Science, Sungkyunkwan University Seoul, Seoul, South Korea

    Eunil Park, Ki Joon Kim & Angel P. del Pobil

  2. Computer Science and Engineering Department, University Jaume-I, Castellon, Spain

    Angel P. del Pobil

Authors
  1. Eunil Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ki Joon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Angel P. del Pobil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eunil Park .

Editor information

Editors and Affiliations

  1. SeoulTech, Computer Science and Engineering, Seoul University of Science & Technology, Gongreung 2-dong 172, Seoul, 139-742, Korea, Republic of (South Korea)

    James J. (Jong Hyuk) Park

  2. , Electrical and Computer Engineering, The University of British Columbia, Room 4013, Kaiser Building, Main Mall 2332, Vancouver, V6T 1Z4, British Columbia, Canada

    Victor C.M. Leung

  3. The University of Hong Kong, Hong Kong, 1, China, People's Republic

    Cho-Li Wang

  4. , Division of Information and Computer Eng, Ajou University, San 5, Suwon, Gyeonggido, 443-749, Korea, Republic of (South Korea)

    Taeshik Shon

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dortdrecht

About this paper

Cite this paper

Park, E., Kim, K.J., del Pobil, A.P. (2012). Energy Efficient Complete Coverage Path Planning for Vacuum Cleaning Robots. In: J. (Jong Hyuk) Park, J., Leung, V., Wang, CL., Shon, T. (eds) Future Information Technology, Application, and Service. Lecture Notes in Electrical Engineering, vol 164. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-4516-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-4516-2_3

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-4515-5

  • Online ISBN: 978-94-007-4516-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation