Parallel region coverage using multiple UAVs

Low flying, small endurance UAVs are well-suited for region coverage over airbases or in urban zones since they are cheap, highly maneuverable and expendable. In this paper we consider the problem of minimizing the time needed to cover the region of interest, a contiguous rectilinear polygonal workspace, Pscr, using eta UAVs. Our approach is based on partitioning Pscr into eta interior-disjoint polygons, P i and making a one-to-one assignment of the polygons to the UAVs. The partition comprises polygons that are (a) rectilinear and (b) contiguous (c) whose area-ratios equal to the ratio of rates at which the UAVs can do coverage (d) and whose boundaries include points at which the respective UAV begins coverage. Our work appears to be the first that directly generates partitions that satisfy all the aforementioned conditions. We discuss the operational requirements that motivate this particular partitioning problem. We prove that our algorithm runs in O(N log N + N + eta2N) time; N is the complexity of Pscr

[1]  Thomas C. Shermer.  A Linear Algorithm for Bisecting a Polygon , 1992, Inf. Process. Lett..

[2]  Alberto Bemporad,et al.  Inner and outer approximations of polytopes using boxes , 2004, Comput. Geom..

[3]  Amit Agarwal,et al.  ACO for a new TSP in region coverage , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Esther M. Arkin,et al.  Optimal covering tours with turn costs , 2001, SODA '01.

[5]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Hannah Bast,et al.  The Area Partitioning Problem , 2000, CCCG.

[7]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[8]  AMIT AGARWAL,et al.  Rectilinear Workspace Partitioning for Parallel Coverage Using Multiple UAVs , 2006 .

[9]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[10]  Vladimir J. Lumelsky,et al.  Polygon Area Decomposition for Multiple-Robot Workspace Division , 1998, Int. J. Comput. Geom. Appl..

[11]  Christos H. Papadimitriou,et al.  The bisection width of grid graphs , 1990, SODA '90.