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 - Bidirectional T3 planner based on two T2 planners.
13 - RRT\*-Connect algorithm based on [Klemm2015] paper.
16 - Make `sample` procedure part of RRTBase.
20 - Cost distribution plot function.
21 - Heading independent near vertices procedure inspired by `nn4`.
25 - `nn4` use Euclidean distance while independently on RRT framework cost used.
28 - `opt_part` procedure (unused).
31 - Dijkstra path optimization only if goal found.
32 - Workaround used for optimizing part of path. There is a bug that causes
33 collision when steering from `i` to `i + 1` node of path from `tlog`. See
38 - Optimize path until optimal.
42 - Compilation macros that can specify output binary parameters.
43 - Auxiliary build and test scripts.
44 - Nearest neighbour `nn2` procedure based on linear search over `nodes()`.
45 - Nearest neighbour `nn3` procedure based on indexing over `y` axis.
46 - Near vertices `nv2` procedure based on indexing over `y` axis.
47 - OpenMP parallelization of nearest neighbour and near vertices procedures.
48 - Rebase method that changes (rebases) RRT root to another RRT node.
49 - Structure and method for logging tree edges.
50 - Time dimension to RRT node.
51 - Obstacle distance to RRT Node.
52 - Test planner `T2` based on RRT\* [Karaman2011] with steering from newly added
54 - OpenGL 2.1 plot using SDL2.
55 - `nn4` procedure - set node's heading to heading of currently comparing node.
56 - Add optimize path method based on [Islam2012]'s *Path Optimize* procedure.
57 - Update cost method of `RRTNode` that updates cumulative costs of all
62 - Split `connect` and `rewire` procedures from Karaman2011's `next` procedure.
63 - Main planning loop logic.
64 - Path optimization of `T2` based on Dijkstra between cusps points.
67 - Deletion of nodes returned by `steer` but not used.
68 - Scaling for `iy_` nearest neighbour search structure.
72 - Changelog, license, readme.
73 - Class for RRT nodes.
74 - Base class for RRT planners.
75 - RRT primitive procedures:
77 - nearest neigbour search,
80 - RRT planner based on [LaValle1998] paper.
81 - Main program (input/output) with cmake file.
82 - Obstacles class (circle obstacle, segment obstacle).
83 - Collision check function to base RRT class.
84 - Bicycle car model used for collision check with car frame.
85 - Near vertices procedure.
86 - RRT\* planner based on [Karaman2011] paper.
87 - Alternative steering procedure.
88 - Reeds and Shepp cost, steering procedures.
89 - Bicycle car simulation.
90 - Closed loop controller with PI for speed and PurePursuit based on
91 [Coulter1992] paper for steering.
92 - Testing parking scenarios.
94 - RRT planner based on [Kuwata2008] paper.
95 - RRT testing planner `T1`. First node of steer add as in RRT\* (connect and
96 rewire procedures) then the rest stick to the first node without rewiring.
97 - Cost log and legend with cost in plot.
100 - Adding JSON ouput for edges, samples.
101 - Steer procedure `st2` use bicycle car model.
105 - RRTNode heading overflow in constructor.
106 - Sampling range in `sa1` algorithm.