Apollo 10.0
自动驾驶开放平台
distance_approach_ipopt_cuda_interface.h
浏览该文件的文档.
1/******************************************************************************
2 * Copyright 2019 The Apollo Authors. All Rights Reserved.
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 *****************************************************************************/
16
17/*
18 * @file
19 */
20
21#pragma once
22
23#include <vector>
24
25#include <omp.h>
26
27#include <adolc/adolc.h>
28#include <adolc/adolc_openmp.h>
29#include <adolc/adolc_sparse.h>
30#include <adolc/adouble.h>
31
32#include <coin/IpTNLP.hpp>
33#include <coin/IpTypes.hpp>
34
35#include "Eigen/Dense"
36
37#include "modules/common_msgs/config_msgs/vehicle_config.pb.h"
38#include "modules/planning/planning_open_space/proto/planner_open_space_config.pb.h"
39
40#include "cyber/common/log.h"
41#include "cyber/common/macros.h"
47
48#define tag_f 1
49#define tag_g 2
50#define tag_L 3
51#define HPOFF 30
52
53namespace apollo {
54namespace planning {
55
57 public:
59 const size_t horizon, const double ts, const Eigen::MatrixXd& ego,
60 const Eigen::MatrixXd& xWS, const Eigen::MatrixXd& uWS,
61 const Eigen::MatrixXd& l_warm_up, const Eigen::MatrixXd& n_warm_up,
62 const Eigen::MatrixXd& x0, const Eigen::MatrixXd& xf,
63 const Eigen::MatrixXd& last_time_u, const std::vector<double>& XYbounds,
64 const Eigen::MatrixXi& obstacles_edges_num, const size_t obstacles_num,
65 const Eigen::MatrixXd& obstacles_A, const Eigen::MatrixXd& obstacles_b,
66 const PlannerOpenSpaceConfig& planner_open_space_config);
67
69
71 bool get_nlp_info(int& n, int& m, int& nnz_jac_g, int& nnz_h_lag, // NOLINT
72 IndexStyleEnum& index_style) override; // NOLINT
73
75 bool get_bounds_info(int n, double* x_l, double* x_u, int m, double* g_l,
76 double* g_u) override;
77
79 bool get_starting_point(int n, bool init_x, double* x, bool init_z,
80 double* z_L, double* z_U, int m, bool init_lambda,
81 double* lambda) override;
82
84 bool eval_f(int n, const double* x, bool new_x, double& obj_value) override;
85
87 bool eval_grad_f(int n, const double* x, bool new_x, double* grad_f) override;
88 // eval_grad_f by hand.
89 bool eval_grad_f_hand(int n, const double* x, bool new_x, double* grad_f);
90
92 bool eval_g(int n, const double* x, bool new_x, int m, double* g) override;
93
95 bool check_g(int n, const double* x, int m, const double* g);
96
101 bool eval_jac_g(int n, const double* x, bool new_x, int m, int nele_jac,
102 int* iRow, int* jCol, double* values) override;
103 // sequential implementation to jac_g
104 bool eval_jac_g_ser(int n, const double* x, bool new_x, int m, int nele_jac,
105 int* iRow, int* jCol, double* values);
106 // parallel implementation to jac_g
107 bool eval_jac_g_par(int n, const double* x, bool new_x, int m, int nele_jac,
108 int* iRow, int* jCol, double* values);
109
115 bool eval_h(int n, const double* x, bool new_x, double obj_factor, int m,
116 const double* lambda, bool new_lambda, int nele_hess, int* iRow,
117 int* jCol, double* values) override;
118
122 void finalize_solution(Ipopt::SolverReturn status, int n, const double* x,
123 const double* z_L, const double* z_U, int m,
124 const double* g, const double* lambda,
125 double obj_value, const Ipopt::IpoptData* ip_data,
126 Ipopt::IpoptCalculatedQuantities* ip_cq) override;
127
128 void get_optimization_results(Eigen::MatrixXd* state_result,
129 Eigen::MatrixXd* control_result,
130 Eigen::MatrixXd* time_result,
131 Eigen::MatrixXd* dual_l_result,
132 Eigen::MatrixXd* dual_n_result) const;
133
134 //*************** start ADOL-C part ***********************************
136 template <class T>
137 bool eval_obj(int n, const T* x, T* obj_value);
138
140 template <class T>
141 bool eval_constraints(int n, const T* x, int m, T* g);
142
144 void generate_tapes(int n, int m, int* nnz_h_lag);
145 //*************** end ADOL-C part ***********************************
146
147 private:
148 int num_of_variables_ = 0;
149 int num_of_constraints_ = 0;
150 int horizon_ = 0;
151 int lambda_horizon_ = 0;
152 int miu_horizon_ = 0;
153 double ts_ = 0.0;
154 Eigen::MatrixXd ego_;
155 Eigen::MatrixXd xWS_;
156 Eigen::MatrixXd uWS_;
157 Eigen::MatrixXd l_warm_up_;
158 Eigen::MatrixXd n_warm_up_;
159 Eigen::MatrixXd x0_;
160 Eigen::MatrixXd xf_;
161 Eigen::MatrixXd last_time_u_;
162 std::vector<double> XYbounds_;
163
164 // debug flag
165 bool enable_constraint_check_;
166
167 // penalty
168 double weight_state_x_ = 0.0;
169 double weight_state_y_ = 0.0;
170 double weight_state_phi_ = 0.0;
171 double weight_state_v_ = 0.0;
172 double weight_input_steer_ = 0.0;
173 double weight_input_a_ = 0.0;
174 double weight_rate_steer_ = 0.0;
175 double weight_rate_a_ = 0.0;
176 double weight_stitching_steer_ = 0.0;
177 double weight_stitching_a_ = 0.0;
178 double weight_first_order_time_ = 0.0;
179 double weight_second_order_time_ = 0.0;
180
181 double w_ev_ = 0.0;
182 double l_ev_ = 0.0;
183 std::vector<double> g_;
184 double offset_ = 0.0;
185 Eigen::MatrixXi obstacles_edges_num_;
186 int obstacles_num_ = 0;
187 int obstacles_edges_sum_ = 0;
188 double wheelbase_ = 0.0;
189
190 Eigen::MatrixXd state_result_;
191 Eigen::MatrixXd dual_l_result_;
192 Eigen::MatrixXd dual_n_result_;
193 Eigen::MatrixXd control_result_;
194 Eigen::MatrixXd time_result_;
195
196 // obstacles_A
197 Eigen::MatrixXd obstacles_A_;
198
199 // obstacles_b
200 Eigen::MatrixXd obstacles_b_;
201
202 // whether to use fix time
203 bool use_fix_time_ = false;
204
205 // state start index
206 int state_start_index_ = 0;
207
208 // control start index.
209 int control_start_index_ = 0;
210
211 // time start index
212 int time_start_index_ = 0;
213
214 // lagrangian l start index
215 int l_start_index_ = 0;
216
217 // lagrangian n start index
218 int n_start_index_ = 0;
219
220 double min_safety_distance_ = 0.0;
221
222 double max_safety_distance_ = 0.0;
223
224 double max_steer_angle_ = 0.0;
225
226 double max_speed_forward_ = 0.0;
227
228 double max_speed_reverse_ = 0.0;
229
230 double max_acceleration_forward_ = 0.0;
231
232 double max_acceleration_reverse_ = 0.0;
233
234 double min_time_sample_scaling_ = 0.0;
235
236 double max_time_sample_scaling_ = 0.0;
237
238 double max_steer_rate_ = 0.0;
239
240 double max_lambda_ = 0.0;
241
242 double max_miu_ = 0.0;
243
244 private:
245 DistanceApproachConfig distance_approach_config_;
246 PlannerOpenSpaceConfig planner_open_space_config_;
247 const common::VehicleParam vehicle_param_ =
249
250 private:
251 //*************** start ADOL-C part ***********************************
252 double* obj_lam;
253 unsigned int* rind_L; /* row indices */
254 unsigned int* cind_L; /* column indices */
255 double* hessval; /* values */
256 int nnz_L = 0;
257 int options_L[4];
258 //*************** end ADOL-C part ***********************************
259
260// park generic
261 public:
263 const size_t horizon, const double ts, const Eigen::MatrixXd& ego,
264 const Eigen::MatrixXd& xWS, const Eigen::MatrixXd& uWS,
265 const Eigen::MatrixXd& l_warm_up, const Eigen::MatrixXd& n_warm_up,
266 const Eigen::MatrixXd& x0, const Eigen::MatrixXd& xf,
267 const Eigen::MatrixXd& last_time_u, const std::vector<double>& XYbounds,
268 const Eigen::MatrixXi& obstacles_edges_num, const size_t obstacles_num,
269 const Eigen::MatrixXd& obstacles_A, const Eigen::MatrixXd& obstacles_b,
270 const DistanceApproachConfig& distance_approach_config);
271};
272
273} // namespace planning
274} // namespace apollo
static const VehicleConfig & GetConfig()
Get the current vehicle configuration.
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
Method to return the starting point for the algorithm
bool eval_jac_g(int n, const double *x, bool new_x, int m, int nele_jac, int *iRow, int *jCol, double *values) override
Method to return: 1) The structure of the jacobian (if "values" is nullptr) 2) The values of the jaco...
bool check_g(int n, const double *x, int m, const double *g)
Check unfeasible constraints for further study
void get_optimization_results(Eigen::MatrixXd *state_result, Eigen::MatrixXd *control_result, Eigen::MatrixXd *time_result, Eigen::MatrixXd *dual_l_result, Eigen::MatrixXd *dual_n_result) const
DistanceApproachIPOPTCUDAInterface(const size_t horizon, const double ts, const Eigen::MatrixXd &ego, const Eigen::MatrixXd &xWS, const Eigen::MatrixXd &uWS, const Eigen::MatrixXd &l_warm_up, const Eigen::MatrixXd &n_warm_up, const Eigen::MatrixXd &x0, const Eigen::MatrixXd &xf, const Eigen::MatrixXd &last_time_u, const std::vector< double > &XYbounds, const Eigen::MatrixXi &obstacles_edges_num, const size_t obstacles_num, const Eigen::MatrixXd &obstacles_A, const Eigen::MatrixXd &obstacles_b, const DistanceApproachConfig &distance_approach_config)
bool eval_jac_g_par(int n, const double *x, bool new_x, int m, int nele_jac, int *iRow, int *jCol, double *values)
bool eval_jac_g_ser(int n, const double *x, bool new_x, int m, int nele_jac, int *iRow, int *jCol, double *values)
bool get_nlp_info(int &n, int &m, int &nnz_jac_g, int &nnz_h_lag, IndexStyleEnum &index_style) override
Method to return some info about the nlp
bool eval_grad_f_hand(int n, const double *x, bool new_x, double *grad_f)
bool eval_g(int n, const double *x, bool new_x, int m, double *g) override
Method to return the constraint residuals
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
This method is called when the algorithm is complete so the TNLP can store/write the solution
bool eval_grad_f(int n, const double *x, bool new_x, double *grad_f) override
Method to return the gradient of the objective
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
Method to return: 1) The structure of the hessian of the lagrangian (if "values" is nullptr) 2) The v...
bool eval_obj(int n, const T *x, T *obj_value)
Template to return the objective value
bool get_bounds_info(int n, double *x_l, double *x_u, int m, double *g_l, double *g_u) override
Method to return the bounds for my problem
bool eval_f(int n, const double *x, bool new_x, double &obj_value) override
Method to return the objective value
void generate_tapes(int n, int m, int *nnz_h_lag)
Method to generate the required tapes by ADOL-C
bool eval_constraints(int n, const T *x, int m, T *g)
Template to compute constraints
Planning module main class.
Math-related util functions.
Some util functions.
class register implement
Definition arena_queue.h:37
optional VehicleParam vehicle_param