2 All notable changes to this project will be documented in this file.
4 The format is based on [Keep a Changelog][] and this project adheres to
5 [Semantic Versioning][].
7 [Keep a Changelog]: http://keepachangelog.com/
8 [Semantic Versioning]: http://semver.org/
12 - Right parallel parking slot planner.
13 - Shrinking length of parallel parking slot test.
14 - SlotPlanner *Find Init Pose* `fip()` method based on BFS.
15 - Reverse approach for finding "entry pose". See Vorobieva2015 for more info.
16 - SlotSide (LEFT, RIGHT) and SlotType (PARALLEL, PERPENDICULAR) methods for
18 - Information used for sampling getter.
22 - Make T2 planner the default planner.
23 - Sampling info for different dimensions and angles of slot.
28 ## 0.5.0 - 20109-02-26
30 - 2d grid data structure for indexing nodes by `x` and `y` axes.
32 - Bicycle car geometry:
33 - Turning radius circle centers.
34 - Drivable space collision.
35 - Slot planner for parallel parking.
39 - Bidirectional T3 planner based on two T2 planners.
40 - RRT\*-Connect algorithm based on [Klemm2015] paper.
41 - Optimization procedure based on *Remove Redundant Points* from [Lan2015].
42 - Variable steer step size to `st3` procedure.
45 - Make `sample` procedure part of RRTBase.
46 - Make `cost` function part of RRTBase.
47 - Make `nn` procedure part of RRTBase.
48 - Make `nv` procedure part of RRTBase.
49 - Make `steer` procedure part of RRTBase.
50 - Refactor `gplot` module.
51 - T2 planner to include variable steer step size.
52 - Set T3 planner as default.
55 - RRTBase planner destructor. See `base/rrtbase.cc` for more info.
59 - Cost distribution plot function.
60 - Heading independent near vertices procedure inspired by `nn4`.
64 - `nn4` use Euclidean distance while independently on RRT framework cost used.
67 - `opt_part` procedure (unused).
70 - Dijkstra path optimization only if goal found.
71 - Workaround used for optimizing part of path. There is a bug that causes
72 collision when steering from `i` to `i + 1` node of path from `tlog`. See
77 - Optimize path until optimal.
81 - Compilation macros that can specify output binary parameters.
82 - Auxiliary build and test scripts.
83 - Nearest neighbour `nn2` procedure based on linear search over `nodes()`.
84 - Nearest neighbour `nn3` procedure based on indexing over `y` axis.
85 - Near vertices `nv2` procedure based on indexing over `y` axis.
86 - OpenMP parallelization of nearest neighbour and near vertices procedures.
87 - Rebase method that changes (rebases) RRT root to another RRT node.
88 - Structure and method for logging tree edges.
89 - Time dimension to RRT node.
90 - Obstacle distance to RRT Node.
91 - Test planner `T2` based on RRT\* [Karaman2011] with steering from newly added
93 - OpenGL 2.1 plot using SDL2.
94 - `nn4` procedure - set node's heading to heading of currently comparing node.
95 - Add optimize path method based on [Islam2012]'s *Path Optimize* procedure.
96 - Update cost method of `RRTNode` that updates cumulative costs of all
101 - Split `connect` and `rewire` procedures from Karaman2011's `next` procedure.
102 - Main planning loop logic.
103 - Path optimization of `T2` based on Dijkstra between cusps points.
106 - Deletion of nodes returned by `steer` but not used.
107 - Scaling for `iy_` nearest neighbour search structure.
109 ## 0.1.0 - 2018-07-05
111 - Changelog, license, readme.
112 - Class for RRT nodes.
113 - Base class for RRT planners.
114 - RRT primitive procedures:
116 - nearest neigbour search,
118 - steering procedure.
119 - RRT planner based on [LaValle1998] paper.
120 - Main program (input/output) with cmake file.
121 - Obstacles class (circle obstacle, segment obstacle).
122 - Collision check function to base RRT class.
123 - Bicycle car model used for collision check with car frame.
124 - Near vertices procedure.
125 - RRT\* planner based on [Karaman2011] paper.
126 - Alternative steering procedure.
127 - Reeds and Shepp cost, steering procedures.
128 - Bicycle car simulation.
129 - Closed loop controller with PI for speed and PurePursuit based on
130 [Coulter1992] paper for steering.
131 - Testing parking scenarios.
132 - Plot python script.
133 - RRT planner based on [Kuwata2008] paper.
134 - RRT testing planner `T1`. First node of steer add as in RRT\* (connect and
135 rewire procedures) then the rest stick to the first node without rewiring.
136 - Cost log and legend with cost in plot.
139 - Adding JSON ouput for edges, samples.
140 - Steer procedure `st2` use bicycle car model.
144 - RRTNode heading overflow in constructor.
145 - Sampling range in `sa1` algorithm.