Coverage Path Planning for Mobile Cleaning Robots

@inproceedings{Waanders2011CoveragePP,
  title={Coverage Path Planning for Mobile Cleaning Robots},
  author={Marten Waanders},
  year={2011}
}
In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore an exact cellular decomposition called the Boustrophedon cellular decomposition is expanded to handle… CONTINUE READING
4 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A neural network approach to complete coverage path planning”, Systems, Man, and Cybernetics, Part B: Cybernetics

  • S. X. Yang
  • IEEE Transactions,
  • 2004
Highly Influential
4 Excerpts

Pál M."An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

  • C. Chekuri
  • THEORY OF COMPUTING, Volume
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…