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 - Compilation macros that can specify output binary parameters.
13 - Auxiliary build and test scripts.
14 - Nearest neighbour `nn2` procedure based on linear search over `nodes()`.
15 - Nearest neighbour `nn3` procedure based on indexing over `y` axis.
16 - Near vertices `nv2` procedure based on indexing over `y` axis.
17 - OpenMP parallelization of nearest neighbour and near vertices procedures.
24 - Changelog, license, readme.
25 - Class for RRT nodes.
26 - Base class for RRT planners.
27 - RRT primitive procedures:
29 - nearest neigbour search,
32 - RRT planner based on [LaValle1998] paper.
33 - Main program (input/output) with cmake file.
34 - Obstacles class (circle obstacle, segment obstacle).
35 - Collision check function to base RRT class.
36 - Bicycle car model used for collision check with car frame.
37 - Near vertices procedure.
38 - RRT\* planner based on [Karaman2011] paper.
39 - Alternative steering procedure.
40 - Reeds and Shepp cost, steering procedures.
41 - Bicycle car simulation.
42 - Closed loop controller with PI for speed and PurePursuit based on
43 [Coulter1992] paper for steering.
44 - Testing parking scenarios.
46 - RRT planner based on [Kuwata2008] paper.
47 - RRT testing planner `T1`. First node of steer add as in RRT\* (connect and
48 rewire procedures) then the rest stick to the first node without rewiring.
49 - Cost log and legend with cost in plot.
52 - Adding JSON ouput for edges, samples.
53 - Steer procedure `st2` use bicycle car model.
57 - RRTNode heading overflow in constructor.
58 - Sampling range in `sa1` algorithm.