|
@brief Parameters used by adaptive dynamic domain.
@brief The value used to increase/decrease the radius of a node. "A small value for ? (usually a few percents) is sufficient to increase the robustness of the algorithm" (doi> 10.1109/IROS.2005.1545607)
@brief The initial radius for boundary nodes "The gain is particularly significant when the initial value is an overestimation of the optimal value compared to an under estimation." (doi> 10.1109/IROS.2005.1545607)
@brief adaptiveDynamicDomainMinimalRadius "To keep the probabilistic completeness of the algorithm we always ensure the possibility for a node to be extended. To do so, we put a lower bound on the possible radius values of the nodes (not shown in the algorithm of Figure 6). This bound is a multiple of the interpolation step used to check the collisions when we attempt to expand a node." (doi> 10.1109/IROS.2005.1545607)
|