Go to the documentation of this file.
8 #ifndef FIELDS2COVER_ROUTE_PLANNING_ROUTE_PLANNING_BASE_H_
9 #define FIELDS2COVER_ROUTE_PLANNING_ROUTE_PLANNING_BASE_H_
41 bool show_log =
false,
double d_tol = 1e-4,
bool redirect_swaths =
true,
42 long int time_limit_seconds = 1,
bool search_for_optimum =
false);
67 double d_tol,
bool redirect_swaths =
true)
const;
81 const F2CGraph2D& cov_graph,
bool show_log,
long int time_limit_seconds,
82 bool use_guided_local_search =
true)
const;
86 const std::vector<long long int>& route_ids,
99 #endif // FIELDS2COVER_ROUTE_PLANNING_ROUTE_PLANNING_BASE_H_
virtual F2CGraph2D createCoverageGraph(const F2CCells &cells, const F2CSwathsByCells &swaths_by_cells, F2CGraph2D &shortest_graph, double d_tol, bool redirect_swaths=true) const
virtual F2CGraph2D createShortestGraph(const F2CCells &cells, const F2CSwathsByCells &swaths_by_cells, double d_tol) const
virtual F2CRoute transformSolutionToRoute(const std::vector< long long int > &route_ids, const F2CSwathsByCells &swaths_by_cells, const F2CGraph2D &coverage_graph, F2CGraph2D &shortest_graph) const
Tranform index of points to an actual Route.
virtual ~RoutePlannerBase()=default
std::optional< F2CPoint > r_start_end
void setStartAndEndPoint(const F2CPoint &p)
Set the start and the end of the route.
virtual std::vector< long long int > computeBestRoute(const F2CGraph2D &cov_graph, bool show_log, long int time_limit_seconds, bool use_guided_local_search=true) const
virtual F2CRoute genRoute(const F2CCells &cells, const F2CSwathsByCells &swaths_by_cells, bool show_log=false, double d_tol=1e-4, bool redirect_swaths=true, long int time_limit_seconds=1, bool search_for_optimum=false)
Route planning algorithms' namespace.
fields2cover
Author(s):
autogenerated on Fri Apr 25 2025 02:18:31