Traversal Algorithm for Complete Coverage

There are many applications which require complete coverage and obstacle avoidance. The classical A* algorithm provides the user a shortest path by avoiding the obstacle. As well, the Dijkstra’s algorithm finds the shortest path between the source and destination. But in many applications we require complete coverage of the proposed area with obstacle avoidance. There are LSP, LSSP, BSA, spiral-STC and Complete Coverage D* algorithms which do not realize complete (100%) coverage. The complete coverage using a critical point algorithm assures complete coverage, but it is not well suited for applications like mine detection. Also for covering the missed region it keeps the obstacle as a critical point which is not advisable in critical applications where obstacle may be a dangerous one. To overcome this and to achieve the complete coverage we propose a novel graph traversal algorithm Traversal Algorithm for Complete Coverage (TRACC). Here the area to be scanned is decomposed into a finite number of cells. The traversal is done through all the cells after making sure the next cell has no obstacle. TRACC assures thorough coverage of the proposed area and ensuring that all the obstacles are avoided. Hence the TRACC always have the safer path while covering the entire area. It also reports the obstacle placed or blocked cell.

[1]  Ernest L. Hall,et al.  Region filling operations for mobile robot using computer graphics , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[3]  Enrique González,et al.  BSA: A Complete Coverage Algorithm , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Anthony Stentz,et al.  First results in vision-based crop line tracking , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[6]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[7]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.

[8]  Se-Young Oh,et al.  Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[10]  Howie Choset,et al.  Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions , 2002, Int. J. Robotics Res..

[11]  Maki K. Habib,et al.  The Pemex-B autonomous demining robot: perception and navigation strategies , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[12]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[13]  Ivan Petrović,et al.  Complete Coverage D* Algorithm for Path Planning of a Floor-Cleaning Mobile Robot , 2011 .

[14]  Pablo González de Santos,et al.  Mobile-robot navigation with complete coverage of unstructured environments , 2004, Robotics Auton. Syst..

[15]  Carlos Moreno,et al.  Complementary regions: a surface filling algorithm , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  Sylvia C. Wong,et al.  A topological coverage algorithm for mobile robots , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[17]  Bret A. Wallach,et al.  Autonomous vacuum cleaner , 1997 .

[18]  Howie Choset,et al.  Robust sensor-based coverage of unstructured environments , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[19]  Se-Young Oh,et al.  Complete coverage algorithm based on linked smooth spiral paths for mobile robots , 2010, 2010 11th International Conference on Control Automation Robotics & Vision.

[20]  Francesco Mondada,et al.  Autonomous vacuum cleaner , 1997, Robotics Auton. Syst..

[21]  Enrique González,et al.  BSA: a coverage algorithm , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).