Loading...
Searching...
No Matches
cmaes_optimizer.cpp File Reference
Bounded CMA-ES refinement for the native reference planner. More...
#include "dipla_gp_belief_planner.hpp"#include <cmaes_interface.h>#include <boundary_transformation.h>#include <cmath>#include <stdexcept>#include <utility>Namespaces | |
| namespace | aipp |
Functions | |
| std::vector< Point > | aipp::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. | |
| std::vector< Point > | aipp::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. | |
Detailed Description
Bounded CMA-ES refinement for the native reference planner.
Starts from the greedy lattice route, searches in CMA-ES latent coordinates, transforms candidates into flight bounds, and retains the best feasible route seen. Fixed-altitude tasks omit Z from the optimizer vector.