Skip to content
Optimal coverage path planning
MATLAB
Branch: master
Clone or download
Latest commit 8a8eb05 Apr 3, 2018
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
README.md first commit Mar 23, 2018
adjustDx.m
angleAP.m first commit Mar 23, 2018
antipodalPoints.m
bestPathForAntipodalPair.m cleaned getPathMR Apr 2, 2018
distPoint2Line.m
getConvexPolygon.m
getPathMR.m
getPathMR2.m
getPolygon.m
isAConvexPolygon.m first commit Mar 23, 2018
lineSegmentIntersect.m first commit Mar 23, 2018
rotatePolygon.m
testOptimalCoverageRotCalip.m cleaned getPathMR Apr 2, 2018
timeCost2D.m
torres16.m
torres16simple.m

README.md

Optimal Coverage Path Planning based on the Rotating Calipers Algorithm

CONACYT Copyright (c) 2017, Juan Irving Vasquez-Gomez, All rights reserved.

Field surveying by drones has become a successful activity with applications to mapping, precision agriculture, surveillance, etc. The current state of the art path planners for surveying rely on computing the path that minimizes the number of flight lines. However, such approach could be sub-optimal when the takeoff and landing points are included in the path. We propose a method that computes the optimal path, including the takeoff and landing points. Our method is based on the rotating calipers algorithm and it has a $O(n)$ complexity.

You can’t perform that action at this time.