Sensor-based coverage of unknown environments: Incremental construction of Morse decompositions

International Journal of Robotics Research

Volumn 21, Issue 4, 2002, Pages 345-366

  Acar, Ercan U ^a   Choset, Howie ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Morse decompositions; Reeb graph; Sensor based coverage

Indexed keywords

ALGORITHMS; FUNCTIONS; GRAPH THEORY; MOTION PLANNING; ROBOTS; SENSORS; TOPOLOGY;

CRITICAL POINT SENSING;

ROBOTICS;

EID: 0036555876     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/027836402320556368     Document Type: Article

References (32)

1. Acar, E.U., Choset, H., Rizzi, A.A., Atkar, P.N., and Hull, D. 2002. Morse decompositions for coverage tasks, The Int. J. Robotics Research 21 (4):331-344.
2. Bondy, J.A., and Murty, U.S.R. 2000. Graph Theory with Applications. New York: John Wiley and Sons, Inc.
3. Butler, Z., Rizzi, A.A., and Hollis, R.L. 1998. Contact-sensor based coverage of rectilinear environments. In Proc. IEEE Int. Symposium on Intelligent Control.
4. Butler, Z., Rizzi, A.A., and Hollis, R.L. 2000. Cooperative coverage of rectilinear environments. In Proc. of IEEE ICRA'00, San Francisco, CA.
5. Cao, Z.L., Huang, Y., and Hall, E. 1988. Region filling operations with random obstacle avoidance for mobile robots. J. Robotic Systems, pp. 87-102.
6. Choset, H., Nagatani, K., and Lazar, N. 1999. The arc-transversal median algorithm: An approach to increasing ultrasonic sensor accuracy. In Proc. IEEE Int. Conf. on Robotics and Automation, Detroit.
7. Choset, H., and Pignon, P. 1997. Coverage path planning: The boustrophedon decomposition. In Proceedings of the International Conference on Field and Service Robotics, Canberra, Australia.
8. Clarke, F.H. 1990. Optimization and nonsmooth analysis. Philadelphia, PA: Society of Industrial and Applied Mathematics. Consumer Reports. 2000. Consumers Union of U.S., Inc., 9.
9. Cormen, H.T., Leiserson, C.E., and Rivest, R.L. 1990. Introduction to Algorithms. Cambridge, MA: MIT Press.
10. Courant, R., and Robbins, H. 1996. What is Mathematics? New York: Oxford University Press, Inc.
11. Fomenko, A.T., and Kunii, T.L. 1997. Topological Modeling for Visualization. Tokyo: Springer-Verlag.
12. Gabriely, Y., and Rimon, E. 2001. Spanning-tree based coverage of continuous areas by a mobile robot. Annals of Mathematics and Artificial Intelligence 31:77-98.
13. Gage, D. 1995. Many-robot MCM search systems. In Proc. of the Autonomous Vehicles in Mine Countermeasures Symposium, Monterey, CA, pp. 9-55, 9-63.
14. Healey, A.J., McMillan, S., Jenkins, D., and McGhee, R.B. 1995. BUGS: Basic UXO gathering system. In Proc. of the Autonomous Vehicles in Mine Countermeasures Symposium, Monterey, CA, pp. 8-32, 8-33.
15. Hert, S., Tiwari, S., and Lumelsky, V. 1996. A terrain-covering algorithm for an AUV. Autonomous Robots 3:91-119.
16. Hofner, C., and Schmidt, G. 1995. Path planning and guidance techniques for au autonomous mobile cleaning robot. Robotics and Autonomous Systems 14:199-212.
17. Huang, W.H. 2001. Optimal line-sweep-based decompositions for coverage algorithms. IEEE Int'l. Conf. on Robotics and Automation, Seoul, Korea, 1:27-32.
18. Latombe, J.C. 1991. Robot Motion Planning. Boston, MA: Kluwer Academic Publishers.
19. Lumelsky, V. and Stepanov, A. 1987. Path planning strategies for point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 2:403-430.
20. Lumelsky, V.J., Mukhopadhyay, Snehasis, and Sun, Kang. 1990. Dynamic path planning in sensor-based terrain acquisition. IEEE Transactions on Robotics and Automation 6(4):462-472.
21. MacKenzie, D., and Balch, T. 1996. Making a clean sweep: Behavior based vacuuming. AAAI Fall Symposium, Instationating Real-World Agents.
22. Nomad. 1996. Nomad 200 User's Manual Mountain View, CA: Nomadic Technologies, Inc.
23. O'Rourke, J. 1998. Computational Geometry in C. Mountain View, CA: Cambridge University Press.
24. Preparata, F.P., and Shamos, M.I. 1985. Computational Geometry: An Introduction. Springer-Verlag.
25. Reeb, G. 1946. Sur les points singuliers d'une forme de Pfaff completement integrable ou d'une fonction numerique. Comptes Rendus Acad. Sciences Paris 222:847-849.
26. Rekleitis, I., Dudek, G., and Milios, E. 1997. Multi-robot exploration of an unknown environment, efficiently reducing the odometry error. Int. Joint Conference in Artificial Intelligence, vol. 2, pp. 1340-1345. Nagoya, Japan: Morgan Kaufmann Publishers, Inc.
27. Rimon, E., and Canny, J.F. 1994. Construction of C-space roadmaps using local sensory data - What should the sensors look for? In Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA, pp. 117-124.
28. Spires, V.S., and Goldsmith, S.Y. 1998. Exhaustive geographic search with mobile robots along space-filling curves. In Proc. of First International Workshop on Collective Robotics, Paris, France, pp. 1-12.
29. VanderHeide, J., and Rao, N.S.V. 1995. Terrain coverage of an unknown room by an autonomous mobile robot. No. ORNL/TM-13117, Oak Ridge National Laboratory, Oak Ridge, Tennessee.
30. Wagner, I.A., and Bruckstein A.M. 1995. Cooperative cleaners: A study in ant-robotics. Center for Intelligent Systems, Technion, Haifa.
31. Walter, R. Principles of Mathematical Analysis. McGraw-Hill, Inc.
32. Zelinsky, A., Jarvis, R.A., Byrne, J.C., and Yuta, S. 1993. Planning paths of complete coverage of an unstructured environment by a mobile robot. In Proc. of Int. Conference on Advanced Robotics, Tokyo, Japan, pp. 533-538.