]> rtime.felk.cvut.cz Git - hubacji1/rrts.git/blob - api/rrts.h
Add join steered nodes method
[hubacji1/rrts.git] / api / rrts.h
1 #ifndef RRTS_H
2 #define RRTS_H
3
4 #include <functional>
5 #include <random>
6 #include <vector>
7 #include "bcar.h"
8
9 /*! \brief RRT node basic class.
10
11 \param c Cumulative cost from RRT data structure root.
12 \param p Pointer to parent RRT node.
13 \param ch The vector of pointers to children RRT nodes.
14 */
15 class RRTNode : public BicycleCar {
16         private:
17                 double c_ = 0;
18                 RRTNode *p_ = nullptr;
19         public:
20                 // getters, setters
21                 double c() const { return this->c_; }
22                 void c(double c) { this->c_ = c; }
23
24                 RRTNode *p() const { return this->p_; }
25                 void p(RRTNode *p) { this->p_ = p; }
26
27                 RRTNode();
28                 RRTNode(const BicycleCar &bc);
29 };
30
31 /*! \brief Polygon obstacle basic class.
32
33 \param poly Border polygon of the obstacle.
34 */
35 class Obstacle {
36         private:
37                 std::vector<std::tuple<double, double>> poly_;
38         public:
39                 // getters, setters
40                 std::vector<std::tuple<double, double>> &poly()
41                 {
42                         return this->poly_;
43                 }
44
45                 Obstacle();
46 };
47
48 /*! \brief RRT* algorithm basic class.
49
50 \param icnt RRT algorithm iterations counter.
51 \param goals The vector of goal nodes.
52 \param nodes The vector of all nodes in RRT data structure.
53 \param samples The vector of all samples of RRT algorithm.
54 */
55 class RRTS {
56         private:
57                 unsigned int icnt_ = 0;
58
59                 std::vector<RRTNode> goals_;
60                 std::vector<RRTNode> nodes_;
61                 std::vector<Obstacle> obstacles_;
62                 std::vector<RRTNode> samples_;
63                 std::vector<RRTNode> steered_;
64
65                 // RRT procedures
66                 std::tuple<bool, unsigned int, unsigned int>
67                 collide(std::vector<std::tuple<double, double>> &poly);
68                 std::tuple<bool, unsigned int, unsigned int>
69                 collide_steered_from(RRTNode &f);
70                 std::tuple<bool, unsigned int, unsigned int>
71                 collide_two_nodes(RRTNode &f, RRTNode &t);
72                 double cost(RRTNode &f, RRTNode &t);
73                 double cost_build(RRTNode &f, RRTNode &t);
74                 double cost_search(RRTNode &f, RRTNode &t);
75                 void sample();
76                         std::default_random_engine gen_;
77                         std::normal_distribution<double> ndx_;
78                         std::normal_distribution<double> ndy_;
79                         std::normal_distribution<double> ndh_;
80                 RRTNode *nn(RRTNode &t);
81                 std::vector<RRTNode *> nv(RRTNode &t);
82                 void steer(RRTNode &f, RRTNode &t);
83                 /*! \brief Join steered nodes to RRT data structure
84
85                 \param f RRT node to join steered nodes to.
86                 */
87                 void join_steered(RRTNode *f);
88                 // RRT* procedures
89                 bool connect();
90                 void rewire();
91         public:
92                 /*! \brief Return path found by RRT*.
93                 */
94                 std::vector<RRTNode *> path();
95                 /*! \brief Run next RRT* iteration.
96                 */
97                 bool next();
98                 /*! \brief Set sampling info.
99
100                 There is normal distribution sampling for `x`, `y`, and
101                 `h` parameters of RRT node.
102
103                 \param mx Mean x value.
104                 \param dx Standard deviation of x.
105                 \param my Mean y value.
106                 \param dy Standard deviation of y.
107                 \param mh Mean h value.
108                 \param dh Standard deviation of h.
109                 */
110                 void set_sample(
111                         double mx, double dx,
112                         double my, double dy,
113                         double mh, double dh
114                 );
115
116                 // getters, setters
117                 std::vector<RRTNode> &goals() { return this->goals_; }
118                 std::vector<RRTNode> &nodes() { return this->nodes_; }
119                 std::vector<Obstacle> &obstacles() { return this->obstacles_; }
120                 std::vector<RRTNode> &samples() { return this->samples_; }
121                 std::vector<RRTNode> &steered() { return this->steered_; }
122
123                 RRTS();
124 };
125
126 /*! \brief Compute cumulative cost of RRT node.
127
128 \param t RRT node to compute cumulative cost to.
129 */
130 double cc(RRTNode &t);
131
132 #endif /* RRTS_H */