Abstract
Coverage path planning determines a path that passes a robot, a detector, or some type of effector over all points in an environment. Previous work in coverage used cellular decompositions to pass a robot over all points in a target space. We defined a class of cellular decompositions termed Morse Decompositions which were defined by Morse functions; varying the Morse function changes the pattern by which the space was covered. In this paper, we prescribe a provably complete sensor-based coverage path planner that can accommodate detectors with variable effective detecting ranges that go beyond the robot’s periohery. In vast open spaces, the robot can use the full range of its detector, so we cover these spaces as if the robot were as big as the detector. In narrow and cluttered spaces, we obstacles lie within the detector range and thus the detection range “fills” the surrounding area; in this case, the robot simply follows the generalized Voronoi diagram in the cluttered spaces. Therefore, we introduce a new hierarchical decomposition that combines Morse decompositions and generalized Voronoi diagrams. We show how to use this hierarchical decomposition to cover unknown spaces.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.U. Acar and H. Choset. Critical point sensing in unknown environments. In Proc. of IEEE ICRA ‘00, International Conference on Robotics and Automation, pages 3803–3810, San Francisco, CA, 2000.
E.U. Acar and H. Choset. Sensor-based coverage of unknown environments: Incremental construction of morse decompositions. To appear in The International Journal of Robotics Research, 2002.
E.U. Acar, H. Choset, A.A. Rizzi, P.N. Atkar, and D. Hull. Morse decompositions for coverage tasks. To appear in The International Journal of Robotics Research, 2002.
Z. Butler, A. A. Rizzi, and R. L. Hollis. Contact-sensor based coverage of rectilinear environments. In Proc. of IEEE Int’l Symposium on Intelligent Control, Sept. 1998.
J.F. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
J.F. Canny and M. Lin. An opportunistic global path planner. In Proc. IEEE Int. Conf. on Robotics and Automation, pages 1554–1561, 1990.
Z. L. Cao, Y. Huang, and E. Hall. Region filling operations with random obstacle avoidance for mobile robots. Journal of Robotic Systems, pages 87–102, February 1988.
B. Chazelle. Convex partition of polyhedra: A lower bound and worst-case optimal algorithm. SI AM Journal on Computing, 13 (3): 488–507, 1984.
H. Choset, E. Acar, A. Rizzi, and J. Luntz. Exact cellular decompositions in terms of critical points of Morse functions. In Proc. of IEEE ICRA ‘00, Int. Conf. on Robotics and Automation, pages 2270–2277, San Francisco, CA, 2000.
H. Choset and J. Burdick. Sensor based motion planning: Incremental construction of the hierarchical generalized voronoi graph. International Journal of Robotics Research, 19 (2): 126–148, February 2000.
H. Choset and J. Burdick. Sensor based motion planning: The hierarchical generalized voronoi graph. International Journal of Robotics Research, 19 (2): 96–125, February 2000.
H. Choset and P. Pignon. Coverage path planning: The boustrophedon decomposition. In Proceedings of the International Conference on Field and Service Robotics, Canberra, Australia, December 1997.
F. H. Clarke. Optimization and Nonsmooth Analysis. Society of Industrial and Applied Mathematics, Philadelphia, PA, 1990.
Y. Gabriely and E. Rimon. Spanning-tree based coverage of continous areas by a mobile robot. Annals of Mathematics and Artificial Intelligence, Accepted, 2000.
S. Hert, S. Tiwari, and V. Lumelsky. A Terrain-Covering Algorithm for an AUV. Autonomous Robots, 3: 91–119, 1996.
W.H. Huang. Optimal line-sweep-based decompositions for coverage algorithms. In IEEE Int’l. Conf. on Robotics and Automation, volume 1, pages 27–32, Seoul,Korea, 2001.
R.A. Jarvis. Collision free trajectory planning using distance transforms. Mech Eng Trans of the IE Aust, ME10: 197–191, 1985.
J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
V. J. Lumelsky, Snehasis Mukhopadhyay, and Kang Sun. Dynamic path planning in sensor-based terrain acquisition. IEEE Transactions on Robotics and Automation, 6 (4): 462–472, August 1990.
J. Milnor. Morse Theory. Princeton University Press, Princeton, New Jersey, 1963.
C. Ö’Dünlaing and C.K. Yap. A “Retraction” Method for Planning the Motion of a Disc. Algorithmica, 6: 104–111, 1985.
V.S. Spires and S.Y. Goldsmith. Exhaustive geographic search with mobile robots along space-filling curves. In Proc. of First International Workshop on Collective Robotics, pages 1–12, Paris, France, July 1998.
I.A. Wagner and Bruckstein A.M. Cooperative cleaners: A study in ant-robotics. Technical Report CIS-9512, Center for Intelligent Systems, Technion, Haifa, 1995.
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–538, Tokyo, Japan, November 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Acar, E.U., Choset, H. (2004). Sensor-Based Coverage: Incremental Construction of Cellular Decompositions. In: Boissonnat, JD., Burdick, J., Goldberg, K., Hutchinson, S. (eds) Algorithmic Foundations of Robotics V. Springer Tracts in Advanced Robotics, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45058-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-45058-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07341-0
Online ISBN: 978-3-540-45058-0
eBook Packages: Springer Book Archive