JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Optimal Underwater Coverage of a Cellular Region by Autonomous Underwater Vehicle Using Line Sweep Motion
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Optimal Underwater Coverage of a Cellular Region by Autonomous Underwater Vehicle Using Line Sweep Motion
Choi, Myoung-Hwan;
  PDF(new window)
 Abstract
An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells consist of straight lines and no turn is allowed inside the cell. An optimal line sweep coverage solution is presented when the line sweep path is parallel to an edge of the cell boundary. The total time to complete the coverage task is minimized. A unique contribution of this work is that the optimal sequence of cell visits is computed in addition to the optimal line sweep paths and the optimal cell decomposition.
 Keywords
Autonomous underwater vehicle;Underwater coverage;Line sweep motion;Optimal coverage;Sidescan sonar;Group traveling salesman problem;
 Language
English
 Cited by
 References
1.
Yasutomi, F., Takaoka, D., Yamada, M., and Tsukamoto, K., "Cleaning robot control", IEEE Int. Conf. Robotics Automation, Philadelphia, PA, pp. 1839-1841, 1988.

2.
Oh, J.S., Choi, Y.H., Park, J.B., and Zheng, Y.F., "Complete Coverage Navigation of Cleaning Robots Using Triangular-Cell-Based Map", IEEE Trans. Industrial Electronics, Vol. 51, No. 3, pp. 718-726, 2004. crossref(new window)

3.
Huang, Y.Y., Cao, Z.L. and Hall, E.L., "Region filling operations for mobile robot using computer graphics", Proc. of the IEEE Conference on Robotics and Automation, pp. 1607-1614, 1986.

4.
Najjaran, H. and Kircanski, N., "Path planning for a terrain scanner robot", Proc. 31st Int. Symp. Robotics, Montreal, QC, Canada, pp. 132-137, 2000.

5.
Ollis, M. and Stentz, A., "First results in vision-based crop line tracking", Proc. IEEE Int. Conf. Robotics Automation, Minneapolis, MN, pp. 951-956, 1996.

6.
Farsi, M., Ratcliff, K., Johnson, P.J., Allen, C.R., Karam, K.Z., and Pawson, R., "Robot control system for window cleaning", Proc. 11th Int. Symp. Automation Robotics Construction, Brighton, U.K., pp. 617-623, 1994.

7.
Hert, S., Tiwari, S., and Lumelsky, V., "A terraincovering algorithm for an AUV", Autonomous Robots, Vol. 3, pp. 91-119, 1996. crossref(new window)

8.
Reed, S., Petillot, Y., and Bell, J., "An Automatic Approach to the Detection and Extraction of Mine Features in Sidescan Sonar", IEEE J. of Oceanic Eng., Vol. 28, No. 1, pp. 90-105, 2003 crossref(new window)

9.
Sariel, S., Balch, T. and Erdogan, N., "Naval Mine Countermeasure Missions", IEEE Robotics and Automation Magazine, March, pp. 45-52, 2008.

10.
Couillard, M., Fawcett, J. A., Myers, V.L., Davison, M., "Support vector machines for classification of underwater targets in sidescan sonar imagery", Technical Memorandum DRDC Atlantic TM 2008-190, November, 2008.

11.
Evans, B., Baralli, F., Bellettini, A., Bovio, E., Coiras, E., Davies, G., Groen, J., Myers, V., Pinto, M., "AUV technology for shallow water MCM recon-naissance", NURC Reprint Series, NURC-PR-2007-008, 2007

12.
Paull, L., Saeedi, S., Li, H., Myers, V., "An Information Gain Based Adaptive Path Planning Method for an Autonomous Underwater Vehicle using Sidescan Sonar", 6th annual IEEE Conf. on Automation Science and Engineering, Toronto, Canada, pp. 835-840, 2010.

13.
Huang, W.H., "Optimal line-sweep-based decompositions for coverage algorithms", 2001 IEEE Conf. on Robotics and Automation, pp. 27-32, 2001.

14.
Moravec, H.P. and Elfes, A., "High resolution maps from wide angle sonar", IEEE Int. Conf. Robotics Automation, St. Louis, MO, pp. 116-121, 1985.

15.
Arkin, E.M. and Hassin, R., "Approximation algorithms for the geometric covering salesman problem", Discrete Appl. Math., 55, pp. 197-218, 1994. crossref(new window)

16.
Choset, H. and Pignon, P., "Coverage path planning: The boustrophedon cellular decomposition", Int. Conf. on Field and Service Robotics, Canberra, Australia, 1997.

17.
Schmidt, G. and Hofner, C., "An advanced planning and navigation approach for autonomous cleaning robot operations", IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, Vol. 2, pp. 1230-1235, 1998.

18.
Y.S. Jung, B.H. Lee, M.H. Choi, S.Y. Lee, K.W. Lee, "An Efficient Underwater Coverage Method for Multi-AUV with Sea Current Disturbance", Int. Journal of Control, Automation and Systems, Vol. 7, No. 4, pp. 615-629, Aug., 2009 crossref(new window)

19.
Choset, H., "Coverage for robotics - A survey of recent results", Annals of Mathematics and Artificial Intelligence, Vol. 31, pp. 113-126, 2001. crossref(new window)

20.
Yang, S. and Luo, C., "A Neural Network Approach to Complete Coverage Path Planning", IEEE Trans. on Systems, Man, and Cybernatics - PART B, Vol. 34, No. 1, pp. 718-725, 2004.

21.
Fang, C. and Anstee, S., "Coverage Path Planning for Harbour Seabed Surveys using an Autonomous Underwater Vehicle", OCEANS 2010, pp. 1-8, 2010.

22.
Arkin, E.M., Bender, M. A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B. and Sethia, S., "Optimal covering tours with turn costs", Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington. D, C., United States. pp. 138-147, 2001.

23.
Gabriely, Y. and Rimon, E., "Spanning-tree based coverage of continuous areas by a mobile robot", Annals of Mathematics and Artificial Intelligence Vol. 31, pp. 77-98, 2001. crossref(new window)

24.
Jimenez, P. A., Shirinzadeh, B., Nicholson, A., Alici, G., "Optimal Area Covering using Genetic Algorithms", Proceedings of 2007 IEEE/ASME int. conf. on Advanced Intelligent Mechatronics, pp. 1-5, 2007.

25.
Garcia, E. and Gonzalez, P. de Santos, "Mobile-robot navigation with complete coverage of unstructured environments", Robotics and Autonomous Systems, Vol. 46, pp. 195-204, 2004. crossref(new window)

26.
Safra, S and Schwartz, O., "On the Complexity of Approximating TSP with Neighborhoods and Related Problems", Computational Complexity Vol. 14, pp. 281- 307, 2005

27.
Elbassioni, K., Fishkin, A.V., Mustafa, N.H., and Sitters, R., "Approximation Algorithms for Euclidean Group TSP", 32nd International Colloquium, L. Caires et al. (Eds.): ICALP 2005, LNCS 3580, pp. 1115-1126, 2005.

28.
Laporte, G.," The traveling salesman problem: An overview of exact and approximate algorithms", European Journal of Operational Research Vol. 59, pp. 231-247, 1992 crossref(new window)

29.
Rota, G., "The Number of Partitions of a Set", American Mathematical Monthly, Vol. 71, No. 5: pp. 498-504, 1964. crossref(new window)

30.
Luong, B., "MATLAB Script for computing all partitions of a set of n elements", [webpage] http://www.mathworks.cn/matlabcentral/fileexchange/24133-set-partition/content/SetPartFolder/SetPartition. m., May, 2012