Area decomposition, partition and coverage with multiple remotely piloted aircraft systems operating in coastal regions

Several approaches can be identified in the literature for area decomposition: Grid based methods, Cellular decomposition and Boustrophedon (or Morse) decomposition. This paper proposes a novel discretization method for the area based on computational geometry approaches. By using a Constrained Delaunay Triangulation, a complex area is segmented in cells which have the size of the projected field of view of the RPAS (UAS) on-board sensor. In addition, costs are associated to each of these cells for both partitioning the area among several RPAS and full covering each sub-area. Simulation results show that this approach manages to optimally decompose and partition a complex area, and also produces a graph that can be used for different cost-based path planning methods.

[1]  Jin Bae Park,et al.  Complete coverage navigation of cleaning robots using triangular-cell-based map , 2004, IEEE Transactions on Industrial Electronics.

[2]  A. Ollero,et al.  Decentralized strategy to ensure information propagation in area monitoring missions with a team of UAVs under limited communications , 2013, 2013 International Conference on Unmanned Aircraft Systems (ICUAS).

[3]  Ashok Joshi,et al.  Heterogeneous UAV swarm system for target search in adversarial environment , 2013, 2013 International Conference on Control Communication and Computing (ICCC).

[4]  Aníbal Ollero,et al.  Cooperative perimeter surveillance with a team of mobile robots under communication constraints , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Aníbal Ollero,et al.  One-to-One Coordination Algorithm for Decentralized Area Partition in Surveillance Missions with a Team of Aerial Robots , 2014, J. Intell. Robotic Syst..

[6]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[7]  Morgan Quigley,et al.  ROS: an open-source Robot Operating System , 2009, ICRA 2009.

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

[9]  Giorgio C. Buttazzo,et al.  Energy-Aware Coverage Path Planning of UAVs , 2015, 2015 IEEE International Conference on Autonomous Robot Systems and Competitions.

[10]  Mariette Yvinec,et al.  Triangulations in CGAL , 2002, Comput. Geom..

[11]  Robert Fitch,et al.  Communication-aware information gathering with dynamic information flow , 2015, Int. J. Robotics Res..

[12]  Liam Paull,et al.  Sensor-Driven Area Coverage for an Autonomous Fixed-Wing Unmanned Aerial Vehicle , 2014, IEEE Transactions on Cybernetics.

[13]  Antonio Barrientos,et al.  Aerial coverage optimization in precision agriculture management: A musical harmony inspired approach , 2013 .

[14]  Jens Wawerla,et al.  Fractal trajectories for online non-uniform aerial coverage , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[15]  Jean Berger,et al.  An innovative multi-agent search-and-rescue path planning approach , 2015, Comput. Oper. Res..

[16]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[17]  A. Ollero,et al.  Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms , 2004, DARS.

[18]  M. Er,et al.  Coverage path planning for UAVs based on enhanced exact cellular decomposition method , 2011 .

[19]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..