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.
14 ## 0.5.0 - 20109-02-26
16 - 2d grid data structure for indexing nodes by `x` and `y` axes.
18 - Bicycle car geometry:
19 - Turning radius circle centers.
20 - Drivable space collision.
21 - Slot planner for parallel parking.
25 - Bidirectional T3 planner based on two T2 planners.
26 - RRT\*-Connect algorithm based on [Klemm2015] paper.
27 - Optimization procedure based on *Remove Redundant Points* from [Lan2015].
28 - Variable steer step size to `st3` procedure.
31 - Make `sample` procedure part of RRTBase.
32 - Make `cost` function part of RRTBase.
33 - Make `nn` procedure part of RRTBase.
34 - Make `nv` procedure part of RRTBase.
35 - Make `steer` procedure part of RRTBase.
36 - Refactor `gplot` module.
37 - T2 planner to include variable steer step size.
38 - Set T3 planner as default.
41 - RRTBase planner destructor. See `base/rrtbase.cc` for more info.
45 - Cost distribution plot function.
46 - Heading independent near vertices procedure inspired by `nn4`.
50 - `nn4` use Euclidean distance while independently on RRT framework cost used.
53 - `opt_part` procedure (unused).
56 - Dijkstra path optimization only if goal found.
57 - Workaround used for optimizing part of path. There is a bug that causes
58 collision when steering from `i` to `i + 1` node of path from `tlog`. See
63 - Optimize path until optimal.
67 - Compilation macros that can specify output binary parameters.
68 - Auxiliary build and test scripts.
69 - Nearest neighbour `nn2` procedure based on linear search over `nodes()`.
70 - Nearest neighbour `nn3` procedure based on indexing over `y` axis.
71 - Near vertices `nv2` procedure based on indexing over `y` axis.
72 - OpenMP parallelization of nearest neighbour and near vertices procedures.
73 - Rebase method that changes (rebases) RRT root to another RRT node.
74 - Structure and method for logging tree edges.
75 - Time dimension to RRT node.
76 - Obstacle distance to RRT Node.
77 - Test planner `T2` based on RRT\* [Karaman2011] with steering from newly added
79 - OpenGL 2.1 plot using SDL2.
80 - `nn4` procedure - set node's heading to heading of currently comparing node.
81 - Add optimize path method based on [Islam2012]'s *Path Optimize* procedure.
82 - Update cost method of `RRTNode` that updates cumulative costs of all
87 - Split `connect` and `rewire` procedures from Karaman2011's `next` procedure.
88 - Main planning loop logic.
89 - Path optimization of `T2` based on Dijkstra between cusps points.
92 - Deletion of nodes returned by `steer` but not used.
93 - Scaling for `iy_` nearest neighbour search structure.
97 - Changelog, license, readme.
98 - Class for RRT nodes.
99 - Base class for RRT planners.
100 - RRT primitive procedures:
102 - nearest neigbour search,
104 - steering procedure.
105 - RRT planner based on [LaValle1998] paper.
106 - Main program (input/output) with cmake file.
107 - Obstacles class (circle obstacle, segment obstacle).
108 - Collision check function to base RRT class.
109 - Bicycle car model used for collision check with car frame.
110 - Near vertices procedure.
111 - RRT\* planner based on [Karaman2011] paper.
112 - Alternative steering procedure.
113 - Reeds and Shepp cost, steering procedures.
114 - Bicycle car simulation.
115 - Closed loop controller with PI for speed and PurePursuit based on
116 [Coulter1992] paper for steering.
117 - Testing parking scenarios.
118 - Plot python script.
119 - RRT planner based on [Kuwata2008] paper.
120 - RRT testing planner `T1`. First node of steer add as in RRT\* (connect and
121 rewire procedures) then the rest stick to the first node without rewiring.
122 - Cost log and legend with cost in plot.
125 - Adding JSON ouput for edges, samples.
126 - Steer procedure `st2` use bicycle car model.
130 - RRTNode heading overflow in constructor.
131 - Sampling range in `sa1` algorithm.