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 - Operator `==` for RRTNode.
16 - Invalid memory access.
17 - Missing goals in ut.
22 - Missing source file in cmake config.
27 - Uniform sampling. (Normal sampling is still default.)
28 - Compound extensions 18 - 33.
29 - Path optimization in backward direction.
30 - Goal found check for zone instead of Euclidean distance and max. angle
34 - Reformat lists in readme.
35 - Add `RRTExt3` to compound extensions 18 - 33.
39 - Double value in unsigned int constant.
43 - Collision detection based on [cute c2][].
44 - Time restriction for algorithm.
45 - RRT node types (currently `cusp` and `connected`).
46 - Compound extensions.
47 - Dijkstra algorithm for path optimization (`rrtext3.cc`).
48 - Grid based `nn` and `nv` methods (`rrtext4.cc`).
49 - Compound extensions.
51 - Should continue method.
52 - Deinit method -- get ready for planner reset.
55 - 2D K-d tree extension.
56 - 3D K-d tree extension.
59 - How the algorithm is stopped - possible to choose from more options.
60 - Separate `store_node` procedure.
61 - Grid constants used in `ext4`.
62 - Some small refactoring.
65 - `should_continue` method.
67 [cute c2]: https://github.com/RandyGaul/cute_headers/blob/master/cute_c2.h
71 - Bicycle car constructor for RRTNode.
72 - Different costs extension.
75 - Extend next with steering from just added nodes.
80 - Changelog, license, readme.
81 - Doxygen config file.
82 - [WvTest][] unit testing framework.
83 - Basic naive RRT star implementation without obstacles.
84 - Polygon obstacle, collision with obstacles.
85 - Use [Reeds and Shepp](https://github.com/ghliu/pyReedsShepp) in steer method.
87 [WvTest]: https://github.com/apenwarr/wvtest