freespace_planner_node is a global path planner node that plans trajectory
in the space having static/dynamic obstacles. This node is currently based on
Hybrid A* search and RRT* algorithms in freesapce_planning_algorithms package.
Note
Due to the constraint of trajectory following, the output trajectory will be split to include only the single direction path.
In other words, the output trajectory doesn't include both forward and backward trajectories at once.
If true, refine solution path as possible after initial feasible path found within the given time budget time_limit. If false, the algorithm is almost equivalent of plane RRT
mu
double
neighbor radius in reeds-shepp space
margin
double
collision check margin internally used in RRT*'s collision check of continuous path, which does not appear in discrete search algorithm such as A*. Note that this margin is an extra margin on top of the collision_margin in the Node paramter.