Sensor-Based Incremental Boustrophedon Decomposition for Coverage Path Planning of a Mobile Robot

  • Dugarjav Batsaikhan
  • Adiyabaatar Janchiv
  • Soon-Geul Lee
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 193)

Abstract

This paper presents a sensor-based coverage algorithm with which a robot covers an unknown rectilinear region while simultaneously constructing cell decomposition. In this algorithm, cell boundaries are indicated by combined lines of critical edges those are sensed partial contours of wall and objects in the workspace. The robot uses the laser scanner to sense critical edges. The proposed algorithm incrementally (one by one) decomposes unknown environment into cells. The constructing order of the cells is very important in this incremental cell decomposition algorithm. In order to decide next target cell from candidate cells, the robot checks redundancy of the planned path and possible position of ending points of the current cell. The key point of the algorithm is memorizing the covered space to define the next target cell from possible cells more than one. Path generation within the defined cell is determined to minimize the number of turns because the number of turns is the main factor to save time for coverage. Therefore, the long boundary of cell should be chosen as a main path of the robot. Verification of this algorithm is done by the simulation under LABVIEW environment.

Keywords

sensor-based boustrophedon decomposition incremental cell decomposition complete coverage path planning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Latombe, J.C.: Robot motion planning. Kluwer Academic Publishers, Boston (1991)CrossRefGoogle Scholar
  2. 2.
    Choset, H.: Coverage of known space: the boustrophedon cellular decomposition. Autonomous Robots 9, 247–253 (2000)CrossRefGoogle Scholar
  3. 3.
    Acar, E., Choset, H., Rizzi, A., Atkar, N., Hull, D.: Morse decompositions for the coverage task. The Int. Journal of Robotics Research 21(4), 331–344 (2002)CrossRefGoogle Scholar
  4. 4.
    Choset, H., Acar, E., Riazi, A., Luntz, J.: Exact cellular decompositions in terms of critical points of morse functions. In: The Int. Conf. on Robot Automation, San Francisco (2000)Google Scholar
  5. 5.
    Acar, E., Choset, H.: Robust sensor-based coverage of unstructured environment. In: The Int. Conf. on Intelligent Robots and Systems, Maui, Hawaii, USA (2001)Google Scholar
  6. 6.
    Acar, E., Choset, H.: Sensor-based coverage of unknown environments: incremental construction of Morse decompositions. The Int. Journal of Robotics Research 21, 345–366 (2002)CrossRefGoogle Scholar
  7. 7.
    Choset, H., Burdick, J.: Sensor-based motion planning: incremental construction of the hierarchical generalized Voronoi graph. The Int. Journal of Robotics Research 19(2), 126–148 (2000)CrossRefGoogle Scholar
  8. 8.
    Acar, E., Choset, H., Ji Yeong, L.: Sensor-based coverage with extended range detectors. IEEE Trans. on Robotics 22(1) (2006)Google Scholar
  9. 9.
    Nguyen, V., Martinelli, A., Tomatis, N., Siegwart, R.: A Comparison of line extraction algorithms using 2D laser range finder for indoor mobile robotics. In: The Int. Conf. on Intelligent Robots and Systems (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Dugarjav Batsaikhan
    • 1
  • Adiyabaatar Janchiv
    • 1
  • Soon-Geul Lee
    • 1
  1. 1.Dept. of Mechanical EngineeringKyung Hee UniversityGyeonggi-doKorea

Personalised recommendations