6 #include <jsoncpp/json/json.h>
11 #define ETA 1.0 // for steer, nv
12 #define GAMMA(cV) ({ \
13 __typeof__ (cV) _cV = (cV); \
14 pow(log(_cV) / _cV, 1.0 / 3.0); \
17 /*! \brief Possible type of RRT node.
19 \param cusp The node that is cusp (change in direction).
20 \param connected The node that branches generated steered path.
24 static const unsigned int cusp = 1 << 0;
25 static const unsigned int connected = 1 << 1;
28 /*! \brief RRT node basic class.
30 \param c Cumulative cost from RRT data structure root.
31 \param p Pointer to parent RRT node.
32 \param t Type of the RRT node (RRTNodeType).
34 \param x Horizontal coordinate of rear axle center.
35 \param y Vertical coordinate of rear axle center.
36 \param h Heading of the car in the interval [-pi,+pi] radians.
37 \param sp Speed of the car.
38 \param st Steering of the car.
43 RRTNode *p_ = nullptr;
55 double c() const { return this->c_; }
56 void c(double c) { this->c_ = c; }
58 RRTNode *p() const { return this->p_; }
59 void p(RRTNode *p) { this->p_ = p; }
61 bool t(unsigned int flag) { return this->t_ & flag; }
62 void set_t(unsigned int flag) { this->t_ |= flag; }
63 void clear_t(unsigned int flag) { this->t_ &= ~flag; }
67 double x() const { return this->x_; }
68 void x(double x) { this->x_ = x; }
70 double y() const { return this->y_; }
71 void y(double y) { this->y_ = y; }
73 double h() const { return this->h_; }
83 double sp() const { return this->sp_; }
84 void sp(double sp) { this->sp_ = sp; }
86 double st() const { return this->st_; }
87 void st(double st) { this->st_ = st; }
90 RRTNode(const BicycleCar &bc);
91 bool operator==(const RRTNode& n);
92 friend std::ostream &operator<<(
105 /*! \brief Polygon obstacle basic class.
107 \param poly Border polygon of the obstacle.
111 std::vector<std::tuple<double, double>> poly_;
114 std::vector<std::tuple<double, double>> &poly()
122 /*! \brief RRT* algorithm basic class.
124 \param icnt RRT algorithm iterations counter.
125 \param goals The vector of goal nodes.
126 \param nodes The vector of all nodes in RRT data structure.
127 \param samples The vector of all samples of RRT algorithm.
128 \param sample_dist_type Random distribution type for sampling function (0 -
129 normal, 1 - uniform, 2 - uniform circle)
133 unsigned int icnt_ = 0;
134 std::chrono::high_resolution_clock::time_point tstart_;
138 int sample_dist_type_ = 0;
140 std::vector<RRTNode> goals_;
141 std::vector<RRTNode> nodes_;
142 std::vector<Obstacle> obstacles_;
143 std::vector<RRTNode> samples_;
144 std::vector<RRTNode> steered_;
145 double log_path_time_ = 0.1;
146 std::vector<double> log_path_cost_;
148 /*! \brief Update and return elapsed time.
151 /*! \brief Log current path cost.
153 void log_path_cost();
154 /*! \brief Set normal distribution for sampling.
156 void set_sample_normal(
157 double x1, double x2,
158 double y1, double y2,
161 /*! \brief Set uniform distribution for sampling.
163 void set_sample_uniform(
164 double x1, double x2,
165 double y1, double y2,
168 /*! \brief Set uniform circle distribution for sampling.
170 void set_sample_uniform_circle();
171 RRTNode* use_nn; // Used for RRTExt12.
172 std::vector<RRTNode> tmp_steered_;
173 bool finishit = false;
174 double path_cost_before_opt_ = 9999;
177 /*! \brief Store RRT node to tree data structure.
179 virtual void store_node(RRTNode n);
182 std::tuple<bool, unsigned int, unsigned int>
183 collide(std::vector<std::tuple<double, double>> &poly);
184 virtual std::tuple<bool, unsigned int, unsigned int>
185 collide_steered_from(RRTNode &f);
186 virtual std::tuple<bool, unsigned int, unsigned int>
187 collide_tmp_steered_from(RRTNode &f);
188 virtual std::tuple<bool, unsigned int, unsigned int>
189 collide_two_nodes(RRTNode &f, RRTNode &t);
191 std::default_random_engine gen_;
192 std::normal_distribution<double> ndx_;
193 std::normal_distribution<double> ndy_;
194 std::normal_distribution<double> ndh_;
195 std::uniform_real_distribution<double> udx_;
196 std::uniform_real_distribution<double> udy_;
197 std::uniform_real_distribution<double> udh_;
198 std::uniform_int_distribution<unsigned int> udi1_;
199 std::uniform_int_distribution<unsigned int> udi2_;
200 virtual RRTNode *nn(RRTNode &t);
201 virtual std::vector<RRTNode *> nv(RRTNode &t);
202 void steer(RRTNode &f, RRTNode &t);
203 void tmp_steer(RRTNode &f, RRTNode &t);
204 virtual void steer1(RRTNode &f, RRTNode &t);
205 virtual void steer2(RRTNode &f, RRTNode &t);
206 /*! \brief Join steered nodes to RRT data structure
208 \param f RRT node to join steered nodes to.
210 void join_steered(RRTNode *f);
211 void join_tmp_steered(RRTNode *f);
212 virtual bool goal_found(RRTNode &f);
218 struct { double x=0; double y=0; double b=0; double e=0; } entry;
219 bool entry_set = false;
220 std::vector<RRTNode *> steered1_;
221 std::vector<RRTNode *> steered2_;
223 /*! \brief Initialize RRT algorithm if needed.
226 /*! \brief Deinitialize RRT algorithm if needed.
228 virtual void deinit();
229 /*! \brief Return path found by RRT*.
231 virtual std::vector<RRTNode *> path();
232 /*! \brief Return ``true`` if algorithm should stop.
234 Update counters (iteration, seconds, ...) and return if
235 the current iteration should be the last one.
238 /*! \brief Return ``true`` if the algorithm should finish.
240 Finish means that the algorithm will not be resumed.
242 bool should_finish();
243 /*! \brief Return ``true`` if the algorithm shoud break.
245 Break means that the algorithm can be resumed.
248 /*! \brief Return ``true`` if algorithm should continue.
250 `pcnt_` is set to `scnt_`, so the difference is 0 and it can
251 start from scratch. After the `should_continue` is called,
252 there must be `while (rrts.next()) {}` loop.
254 bool should_continue();
255 /*! \brief Run next RRT* iteration.
258 /*! \brief Set sampling info.
260 Based on `sample_dist_type`, set proper distribution
261 parameters. The distribution parameters are relative to `front`
262 node in `nodes` (init).
265 \param x1 Mean x value.
266 \param x2 Standard deviation of x.
267 \param y1 Mean y value.
268 \param y2 Standard deviation of y.
269 \param h1 Mean h value.
270 \param h2 Standard deviation of h.
272 For uniform sampling:
273 \param x1 Minimum x value.
274 \param x2 Maximum x value.
275 \param y1 Minimum y value.
276 \param y2 Maximum y value.
277 \param h1 Minimum h value.
278 \param h2 Maximum h value.
280 For uniform circle sampling:
289 double x1, double x2,
290 double y1, double y2,
293 /*! \brief Generate JSON output.
296 /*! \brief Load JSON input.
298 void json(Json::Value jvi);
301 virtual double cost_build(RRTNode &f, RRTNode &t);
302 virtual double cost_search(RRTNode &f, RRTNode &t);
305 unsigned int icnt() const { return this->icnt_; }
306 double scnt() const { return this->scnt_; }
307 bool gf() const { return this->gf_; }
308 void gf(bool f) { this->gf_ = f; }
309 int sample_dist_type() const { return this->sample_dist_type_;}
310 void sample_dist_type(int t) { this->sample_dist_type_ = t; }
311 std::vector<RRTNode> &goals() { return this->goals_; }
312 std::vector<RRTNode> &nodes() { return this->nodes_; }
313 std::vector<Obstacle> &obstacles() { return this->obstacles_; }
314 std::vector<RRTNode> &samples() { return this->samples_; }
315 std::vector<RRTNode> &steered() { return this->steered_; }
320 /*! \brief Compute cumulative cost of RRT node.
322 \param t RRT node to compute cumulative cost to.
324 double cc(RRTNode &t);