Skip to content

LuisEVT/Optimal_Drone_Field_Coverage

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

91 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License.

Optimal Drone Field Coverage

Required Packages

  • Numpy (1.18.1)
  • Scipy (1.4.1)
  • Matplotlib (3.1.3)
  • Shapely (1.7.0)
  • Cvxopt (1.2.0)

Program Submodules

Mask of Field (Source)

  • First, a large set of 'dots' are created in a grid that captures the region. Rectangular Mask

  • Then, we use matplotlib.Path to create the mask of the figure. The 'dots' that remain, are the coordinates that are inside the region. Figure Mask

Optimal Charging Station Location (Source)

  • We use a linear program that finds the optimal locations to place the charging stations such that it minimizes the mission time of the drone per Charging Station (CS) coverage region. Optimal CS

Voronoi Regions (Source)

  • We create Voronoi regions to specify what region the drone will be covering per CS location. Voronoi Region
  • We use a linear program to minimize the edges used to traverse the CS. The area covered by the traversal are removed from the drone mission algorithm applied to each triangular region. Walk

Triangularization (Source)

  • We triangulate each Voronoi region to apply the drone mission algorithm. Triangularization

Drone mission algorithm (Source)

  • Here, we show the path the drone takes in a triangular region. Each color represents a new cycle after each recharge. Triangular Path
  • This is the final product when putting the submodules together. Complete Drone Path

Contribution

Publication

Cost-Minimizing System Design for Surveillance of Large, Inaccessible Agricultural Areas Using Drones of Limited Range

Releases

No releases published

Packages

No packages published

Languages