spiral_problem_interface.h

浏览该文件的文档.

/******************************************************************************
 * Copyright 2017 The Apollo Authors. All Rights Reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *****************************************************************************/
 
/*
 * spiral_problem_interface.h
 */
 
#pragma once
 
/* Workaround for coin/IpSmartPtr.hpp:18:4: error: #error "don't have header
 * file for stddef" */
#include <cstddef>
#include <vector>
 
#include <coin/IpTNLP.hpp>
#include <coin/IpTypes.hpp>
 
#include "Eigen/Dense"
 
#include "modules/planning/planning_base/math/curve1d/quintic_spiral_path_with_derivation.h"
 
namespace apollo {
namespace planning {
 
class SpiralProblemInterface : public Ipopt::TNLP {
 public:
  explicit SpiralProblemInterface(std::vector<Eigen::Vector2d> points);
 
  virtual ~SpiralProblemInterface() = default;
 
  void set_default_max_point_deviation(const double point_max_deviation);
 
  void set_start_point(const double x, const double y, const double theta,
                       const double kappa, const double dkappa);
 
  void set_end_point(const double x, const double y, const double theta,
                     const double kappa, const double dkappa);
 
  void set_end_point_position(const double x, const double y);
 
  void set_element_weight_curve_length(const double weight_curve_length);
 
  void set_element_weight_kappa(const double weight_kappa);
 
  void set_element_weight_dkappa(const double weight_dkappa);
 
  void get_optimization_results(std::vector<double>* ptr_theta,
                                std::vector<double>* ptr_kappa,
                                std::vector<double>* ptr_dkappa,
                                std::vector<double>* ptr_s,
                                std::vector<double>* ptr_x,
                                std::vector<double>* ptr_y) const;
 
  bool get_nlp_info(int& n, int& m, int& nnz_jac_g, int& nnz_h_lag,
                    IndexStyleEnum& index_style) override;
 
  bool get_bounds_info(int n, double* x_l, double* x_u, int m, double* g_l,
                       double* g_u) override;
 
  bool get_starting_point(int n, bool init_x, double* x, bool init_z,
                          double* z_L, double* z_U, int m, bool init_lambda,
                          double* lambda) override;
 
  bool eval_f(int n, const double* x, bool new_x, double& obj_value) override;
 
  bool eval_grad_f(int n, const double* x, bool new_x, double* grad_f) override;
 
  bool eval_g(int n, const double* x, bool new_x, int m, double* g) override;
 
  bool eval_jac_g(int n, const double* x, bool new_x, int m, int nele_jac,
                  int* iRow, int* jCol, double* values) override;
 
  bool eval_h(int n, const double* x, bool new_x, double obj_factor, int m,
              const double* lambda, bool new_lambda, int nele_hess, int* iRow,
              int* jCol, double* values) override;
 
  void finalize_solution(Ipopt::SolverReturn status, int n, const double* x,
                         const double* z_L, const double* z_U, int m,
                         const double* g, const double* lambda,
                         double obj_value, const Ipopt::IpoptData* ip_data,
                         Ipopt::IpoptCalculatedQuantities* ip_cq) override;
 
 public:
  static constexpr size_t N = 10;
 
 private:
  void update_piecewise_spiral_paths(const double* x, const int n);
 
  std::vector<Eigen::Vector2d> init_points_;
 
  std::vector<double> opt_theta_;
 
  std::vector<double> opt_kappa_;
 
  std::vector<double> opt_dkappa_;
 
  std::vector<double> opt_s_;
 
  std::vector<double> opt_x_;
 
  std::vector<double> opt_y_;
 
  std::vector<double> point_distances_;
 
  int num_of_variables_ = 0;
 
  int num_of_constraints_ = 0;
 
  int num_of_points_ = 0;
 
  double default_max_point_deviation_ = 0.0;
 
  const int num_of_internal_points_ = 5;
 
  std::vector<double> relative_theta_;
 
  std::vector<QuinticSpiralPathWithDerivation<N>> piecewise_paths_;
 
  bool has_fixed_start_point_ = false;
 
  double start_x_ = 0.0;
 
  double start_y_ = 0.0;
 
  double start_theta_ = 0.0;
 
  double start_kappa_ = 0.0;
 
  double start_dkappa_ = 0.0;
 
  bool has_fixed_end_point_ = false;
 
  double end_x_ = 0.0;
 
  double end_y_ = 0.0;
 
  double end_theta_ = 0.0;
 
  double end_kappa_ = 0.0;
 
  double end_dkappa_ = 0.0;
 
  bool has_fixed_end_point_position_ = false;
 
  double weight_curve_length_ = 1.0;
 
  double weight_kappa_ = 1.0;
 
  double weight_dkappa_ = 1.0;
};
 
}  // namespace planning
}  // namespace apollo