exportWaypointsPlan
R2026bDescription
Examples
This example shows how to plan a coverage path for a region in local coordinates and compares the results of using the exhaustive solver with the results of using the minimum traversal solver.
Define the vertices for a coverage space. This cross-shaped region creates multiple sub-regions that the solvers must visit in sequence.
area = [5 0; 5 15; 0 15; 0 25; 5 25; 5 40; 15 40; 15 25; 20 25; 20 40; ...
30 40; 30 25; 35 25; 35 15; 30 15; 30 0; 20 0; 20 15; 15 15; 15 0];Because the vertices define a concave polygon and the coverage planner requires convex polygons, decompose the polygon into convex polygons. Then, create a coverage space with the polygons from the decomposition.
polygons = coverageDecomposition(area); centroids = cellfun(@(p) mean(p(:,1)),polygons); [~,sortIdx] = sort(centroids); polygons = polygons(sortIdx); cs = uavCoverageSpace(Polygons=polygons);
Define the takeoff and landing positions. Then, show the coverage space and plot the takeoff and landing positions.
takeoff = [-5 20 0]; landing = [40 20 0]; show(cs); exampleHelperPlotTakeoffLandingLegend(takeoff,landing)
Create a coverage planner with the exhaustive solver algorithm and another coverage planner with a minimum traversal solver algorithm.
The exhaustive solver iterates through all permutations of sweep options to minimize the connection distance between regions. This makes it better suited for smaller or separated regions. The minimum traversal solver uses a recursive traversal through a graph of adjacent polygons, making it faster and better suited for interconnected regions.
cpeExh = uavCoveragePlanner(cs,Solver="Exhaustive"); cpMin = uavCoveragePlanner(cs,Solver="MinTraversal");
Plan with both solver algorithms using the same takeoff and landing positions.
[wptsExh,solnExh] = plan(cpeExh,takeoff,landing); [wptsMin,solnMin] = plan(cpMin,takeoff,landing);
Show the planned path for both the exhaustive and the minimum traversal algorithms.
figure
show(cs);
title("Exhaustive Solver Algorithm")
exampleHelperPlotTakeoffLandingLegend(takeoff,landing,wptsExh)
figure
show(cs);
title("Minimum Traversal Solver Algorithm")
exampleHelperPlotTakeoffLandingLegend(takeoff,landing,wptsMin)
Compare the visiting sequences chosen by each solver. The exhaustive solver finds the globally optimal ordering by evaluating all permutations, while the minimum traversal solver prioritizes traversing adjacent polygons and flies to the nearest unvisited polygon when no adjacent ones remain.
disp("Exhaustive visiting sequence: " + mat2str(solnExh.VisitingSequence))Exhaustive visiting sequence: [1 2 4 5 3]
disp("MinTraversal visiting sequence: " + mat2str(solnMin.VisitingSequence))MinTraversal visiting sequence: [1 2 3 4 5]
Export the waypoints from the exhaustive solver to a .waypoints file with the reference frame set to north-east-down.
exportWaypointsPlan(cpeExh,solnExh,"coveragepath.waypoints",ReferenceFrame="NED")
