Loading...
Searching...
No Matches
cmaes_optimizer.cpp
Go to the documentation of this file.
41 cmaes_boundary_transformation_t bounds{}; /**< Bounded-coordinate transform, separate from optimizer state. */
43 bool bounds_initialized = false; /**< Transform cleanup remains valid if optimizer setup fails. */
62 std::vector<double> lower(dimension), upper(dimension), deviations(dimension), latent(dimension), bounded(dimension);
68 lower[index] = coordinate == 0 ? grid.xmin + options.margin_cells * grid.step : coordinate == 1 ? grid.ymin + options.margin_cells * grid.step : options.zmin;
69 upper[index] = coordinate == 0 ? grid.xmax - options.margin_cells * grid.step : coordinate == 1 ? grid.ymax - options.margin_cells * grid.step : options.zmax;
79 cmaes_boundary_transformation_inverse(&optimizer.bounds, bounded.data(), latent.data(), latent.size());
81 cmaes_init_para(&optimizer.state, dimension, latent.data(), deviations.data(), options.seed, options.popsize, silent_filename);
91 for (int generation = 0; generation < options.maxiter && evaluations + options.popsize <= options.maxfevals; ++generation) {
95 cmaes_boundary_transformation(&optimizer.bounds, population[member], bounded.data(), bounded.size());
void cmaes_boundary_transformation_exit(cmaes_boundary_transformation_t *t)
Definition boundary_transformation.c:71
void cmaes_boundary_transformation_init(cmaes_boundary_transformation_t *t, double const *lower_bounds, double const *upper_bounds, unsigned long len_of_bounds)
Definition boundary_transformation.c:31
void cmaes_boundary_transformation_inverse(cmaes_boundary_transformation_t *t, double const *x, double *y, unsigned long len)
Definition boundary_transformation.c:131
void cmaes_boundary_transformation(cmaes_boundary_transformation_t *t, double const *x, double *y, unsigned long len)
Definition boundary_transformation.c:78
double * cmaes_UpdateDistribution(cmaes_t *t, const double *rgFunVal)
Definition cmaes.c:810
void cmaes_init_para(cmaes_t *t, int dimension, double *inxstart, double *inrgstddev, long int inseed, int lambda, const char *input_parameter_filename)
Definition cmaes.c:277
static bool start(uint32_t session)
Admit a nonzero session and discard correlation from the previous one.
Definition dipla_camera_backend.c:170
Native finite-grid GP sensor model and trajectory-planning API.
Definition compat.hpp:242
std::vector< Point > refine(const Grid &grid, const Vector &mean, const Matrix &covariance, const Point &start, const std::vector< Point > &initial, const PlannerOptions &options)
Refine a greedy route with bounded CMA-ES while retaining its best candidate.
Definition cmaes_optimizer.cpp:55
std::vector< Point > plan(const Grid &grid, const Vector &mean, const Matrix &covariance, const Point &start, const PlannerOptions &options)
Run greedy route selection followed by optional CMA-ES refinement.
Definition cmaes_optimizer.cpp:114
std::vector< bool > importance_mask(const Vector &mean, const Matrix &covariance, const PlannerOptions &options)
Select cells whose confidence bounds satisfy the utility threshold.
Definition dipla_gp_belief_planner.cpp:417
double trajectory_objective(const Grid &grid, const Matrix &covariance, const std::vector< bool > &mask, const Point &start, const std::vector< Point > &raw_waypoints, const PlannerOptions &options)
Score a trajectory by safety violation and distance-normalized information gain.
Definition dipla_gp_belief_planner.cpp:635
std::vector< Point > grid_search(const Grid &grid, const Vector &mean, const Matrix &covariance, const Point &start, const PlannerOptions &options)
Greedily select a bounded route by information gain per travel cost.
Definition dipla_gp_belief_planner.cpp:678
Point clip_point(const Grid &grid, const Point &point, const PlannerOptions &options)
Clamp a candidate to the map safety inset and altitude interval.
Definition dipla_gp_belief_planner.cpp:516
Search, utility, and optimizer controls for the reference planner.
Definition dipla_gp_belief_planner.hpp:131