What is lateral FOV in yaml file? about polygon_coverage_planning HOT 13 CLOSED

I would also like to know why sometimes pressing Enter to publish polygon does nothing alot of the time. I get no warning in teminal, just nothing happens when I try to publish polygon. I already set polygon from rviz to True, in the yaml file.

from polygon_coverage_planning.

Hey, the FOV alpha is in radians.

The distance between two sweeps calculates as

The height z is given by the polygon input.

If you want to give the distance between sweeps directly, you can select the line sensor model and set the distance lateral_footprint directly.
https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_ros/cfg/coverage_planner.yaml#L10
https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_ros/cfg/coverage_planner.yaml#L12

from polygon_coverage_planning.

I would also like to know why sometimes pressing Enter to publish polygon does nothing alot of the time. I get no warning in teminal, just nothing happens when I try to publish polygon. I already set polygon from rviz to True, in the yaml file.

But the path appears after a while? If the polygon is very complicated it takes some time to pre-compute the decomposition and possible paths. I took this issue to a new conversation #83

from polygon_coverage_planning.

@rikba This doesn't fully answer my question, so I'll expound. I will assume the parts of the image I circled are the sensors?.

If this is the case, then I need to know how exactly the sensor FOV affects the path planner. Before that, let me mae sure I know what the "sweep" is in this context. Is the sweep the red lines(cell decompositions) in the image below or the green lines(The path trajectory)?

If the "sweep" is the green line, how does the sensor FOV affect the green line spacing? I have an image below to illustrate the top view I have in my head.

from polygon_coverage_planning.

think basically, The alpha on the lateral feild of view, what is the area of projection when it hits the ground(the projection being the red circle in the last image)

I would also like to know how to make the delta zero, as in if I wish to not have the two rays intersect(the rays from the illustration you provided).

from polygon_coverage_planning.

Yes, you are correct. Green is the sweep. The spacing between two sweeps is a function of the distance to the surface and FOV. For example, a large field of view will cause your sweeps to be far apart. A large distance will also cause your sweeps to be far apart.

If you don't want overlap you can set lateral_overlap to zero.

But also note you do not have to use this "FOV" sensor model. You can also directly define the distance between the sweeps by setting

sensor_model_type: 0 # [0: Line, 1: Frustum]
lateral_overlap: 0.0
lateral_footprint: 33.0 # Only for line sensor model.

For 33.0m distance between the sweeps.

from polygon_coverage_planning.

Also note: This coverage planner is purely 2D. There is no way to have an adaptive sweep distance, e.g., with varying terrain.

from polygon_coverage_planning.

from polygon_coverage_planning.

No, it can be different. The coverage path algorithm will (most likely) end the last sweep close to where your goal point is set.

from polygon_coverage_planning.

@rikba DO all boustrophedon methods require setting goal positions?

from polygon_coverage_planning.

No, you can also compute the path without start and goal.

In this implementation you would have to change the way the solver is called.
At the moment it adds the additional start and goal to the optimization problem. You could probably code it to skip this step.

See
https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_ros/include/polygon_coverage_ros/coverage_planner.h#L151
https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_planners/src/planners/polygon_stripmap_planner.cc#L79
https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_planners/src/graphs/sweep_plan_graph.cc#L517-L521

from polygon_coverage_planning.

from polygon_coverage_planning.

No, you can also compute the path without start and goal.

In this implementation you would have to change the way the solver is called. At the moment it adds the additional start and goal to the optimization problem. You could probably code it to skip this step.

See https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_ros/include/polygon_coverage_ros/coverage_planner.h#L151 https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_planners/src/planners/polygon_stripmap_planner.cc#L79 https://github.com/ethz-asl/polygon_coverage_planning/blob/master/polygon_coverage_planners/src/graphs/sweep_plan_graph.cc#L517-L521

Hey, if possible can you please let me know what specific changes should i make for removing this start and end goal dependecy?

from polygon_coverage_planning.